Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
Bastian Ristau, Torsten Limberg, Oliver Arnold, Ge...
Automatic pattern search in event traces is a powerful method to identify performance problems in parallel applications. We demonstrate that knowledge about the virtual topology, ...
Nikhil Bhatia, Fengguang Song, Felix Wolf, Jack Do...
We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electro...
Robert E. Lynch, Dan C. Marinescu, Hong Lin, Timot...
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...