Concept

General-purpose processing on graphics processing units

Publications associées (324)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Understanding NVIDIA GPGPU Hardware

Ogier Philippe Maitre

This chapter presents NVIDIA general purpose graphical processing unit (GPGPU) architecture, by detailing both hardware and software concepts. The evolution of GPGPUs from the beginning to the most modern GPGPUs is presented in order to illustrate the tren ...

Springer Berlin Heidelber2013

DynaProg for Scala

Thierry Coppey

Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...

2013

SIMinG-1k: A thousand-core simulator running on general-purpose graphical processing units

David Atienza Alonso, Luca Benini, Martino Ruggiero, Shivani Raghav

This paper introduces SIMinG-1k-a manycore simulator infrastructure. SIMinG-1k is a graphics processing unit accelerated, parallel simulator for design-space exploration of large-scale manycore systems. It features an optimal trade-off between modeling acc ...

Wiley-Blackwell2013

Realtime Deformation of Constrained Meshes Using GPU

Bailin Deng, Alexandre Kaspar

Constrained meshes play an important role in freeform architectural design, as they can represent panel layouts on freeform surfaces. It is challenging to perform realtime manipulation on such meshes, because all constraints need to be respected during the ...

2013

Design Methods for Parallel Hardware Implementation of Multimedia Iterative Algorithms

David Atienza Alonso, Ivan Beretta, Alessandro Antonio Nacci

Traditionally, parallel implementations of multimedia algorithms are carried out manually, since the automation of this task is very difficult due to the complex dependencies that generally exist between different elements of the data set. Moreover, there ...

Institute of Electrical and Electronics Engineers2013

Large-scale Screening of Zeolite Structures for CO2 Membrane Separations

Berend Smit

We have conducted large-scale screening of zeolite materials for CO 2/CH4 and CO2/N2 membrane separation applications using the free energy landscape of the guest molecules inside these porous materials. We show how advanced molecular simulations can be in ...

American Chemical Society2013

Highly Dynamic Distributed Computing with Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Florian Huc

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two ...

2013

Symmetry in 3D Geometry: Extraction and Applications

Mark Pauly, Duygu Ceylan

The concept of symmetry has received significant attention in computer graphics and computer vision research in recent years. Numerous methods have been proposed to find, extract, encode and exploit geometric symmetries and high‐level structural informatio ...

2013

Buffer optimization based on critical path analysis of a dataflow program design

Marco Mattavelli, Simone Casale Brunet

The trade-off between throughput and memory constraints is a common design problem in embedded systems, and especially for streaming applications, where the memory in question usually occurs in the form of buffers for streams of data. This paper presents a ...

IEEE2013

Outsourced Pattern Matching

Sebastian Faust

In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computati ...

2013