Concept

Massively parallel

Related publications (274)

GPGPU Accelerated Parallel and Fast Simulation of Thousand-core Platforms.

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

Future architectures will feature hundreds to thousands of simple processors and on-chip memories connected through a network-on-chip. Architectural simulators will remain primary tools for design space exploration, performance (and power) evaluation of th ...

2011

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Jorge Miguel Dias Almeida Rodrigues Soares

Opportunistic wireless sensor networks (WSNs) have recently been proposed as solutions for many remote monitoring problems. Many such problems, including environmental monitoring, involve large deployment scenarios with lower-than-average node density, as ...

2011

Study of the twinned dendrite tip shape I : Phase-field modeling

Michel Rappaz, Jean-Luc Desbiolles, Mario Alberto Salgado Ordorica

The growth kinetics advantage of twinned aluminum dendrites over regular ones is still an unsolved problem of solidification. Although it is linked to the tip geometry, the influence of a coherent (1 1 1) twin plane on a < 1 1 0 > twinned dendrite tip is u ...

Elsevier2011

GPGPU-Accelerated Parallel and Fast Simulation of Thousand-core Platforms

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

The multicore revolution and the ever-increasing complexity of computing systems is dramatically changing system design, analysis and programming of computing platforms. Future architectures will feature hundreds to thousands of simple processors and on-ch ...

IEEE/ACM Press2011

Parallelizing Machine Learning- Functionally: A Framework and Abstractions for Parallel Graph Processing

Philipp Haller

Implementing machine learning algorithms for large data, such as the Web graph and social networks, is challenging. Even though much research has focused on making sequential algorithms more scalable, their running times continue to be prohibitively long. ...

2011

Embarrassingly Scalable Database Systems

Anastasia Ailamaki

From Wikipedia-An embarrassingly parallel workload (or embarrassingly parallel problem) is one for which little or no effort is required to separate the problem into a number of parallel tasks. This is often the case where there exists no dependency (or co ...

2011

Parallel Molecular Dynamics with Irregular Domain Decomposition

The spatial domain of Molecular Dynamics simulations is usually a regular box that be easily divided in subdomains for parallel processing. Recent efforts aimed at simulating complex biological systems, like the blood flow inside arteries, require the exec ...

Cambridge University Press2011

GPU-accelerated Convex Multi-phase Image Segmentation

Jean-Philippe Thiran, Xavier Bresson, Subrahmanyam Venkata Ravi Mohana Sai Gorthi, Hadrien Copponnex, Arnaud Le Carvennec

Image segmentation is a key area of research in computer vision. Recent advances facilitated reformulation of the non-convex multi-phase segmentation problem as a convex optimization problem (see for example [2, 4, 9, 10, 13, 16]). Recently, [3] proposed a ...

2011

Rgtsp: a generalized top scoring pairs package for class prediction

Mauro Delorenzi, Vlad Popovici

A top scoring pair (TSP) classifier consists of a pair of variables whose relative ordering can be used for accurately predicting the class label of a sample. This classification rule has the advantage of being easily interpretable and more robust against ...

Oxford University Press2011

A New FFT-Based Algorithm for Secondary Code Acquisition for Galileo Signals

Pierre-André Farine, Cyril Botteron, Aleksandar Jovanovic, Jérôme Leclère, Youssef Tawk

The innovative spreading codes used to modulate the new Galileo signals creates new challenges for receiver designers. It is well known in GNSS systems that longer integration times are needed to obtain a better sensitivity. However, the existence of the n ...

IEEE2011

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.