Sciweavers

2474 search results - page 187 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
PPOPP
2012
ACM
14 years 1 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
163
Voted
IPPS
2007
IEEE
16 years 19 days ago
A Prototype Multithreaded Associative SIMD Processor
The performance of SIMD processors is often limited by the time it takes to transfer data between the centralized control unit and the parallel processor array. This is especially...
Kevin Schaffer, Robert A. Walker
ICPP
2006
IEEE
16 years 11 days ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 11 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ATAL
2009
Springer
16 years 27 days ago
Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...