Sciweavers

109 search results - page 3 / 22
» Collapsing the Hierarchy of Parallel Computational Models
Sort
View
PPOPP
2009
ACM
14 years 9 months ago
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
Scott Schneider, Jae-Seung Yeom, Benjamin Rose, Jo...
IPPS
2006
IEEE
14 years 2 months ago
Cache-oblivious simulation of parallel programs
This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-lev...
Andrea Pietracaprina, Geppino Pucci, Francesco Sil...
DFVLR
1987
14 years 2 days ago
Two Fundamental Issues in Multiprocessing
: This paper examines the argument for dataflow architectures in "Two Fundamental Issues in Multiprocessing[5]." We observe two key problems. First, the justification of ...
Arvind, Robert A. Iannucci
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
14 years 1 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
IPPS
1996
IEEE
14 years 22 days ago
Implementing the Data Diffusion Machine Using Crossbar Routers
The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(logp), wh...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...