Abstract:
Abstract: We present a novel approach to parallel computing, where (virtual) PRAM processors are represented as light-weight threads, and each physical processor is capable of managing several threads. Instead of moving read and write requests, and replies between processor&memory pairs (and caches), we move the light-weight threads. Consequently, the processor load balancing problem reduces to the problem of producing evenly distributed memory references. In PRAM computations, this can be achieved by properly hashing the shared memory into the processor&memory pairs. We describe the idea of moving threads, and show that the moving threads framework provides a natural validation for Brent's theorem in work-optimal PRAM simulation situations on mesh of trees, coated mesh, and OCPC based distributed memory machines
Citations
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
926
|
Active Messages: A mechanism for integrated communication and computation
– Eicken, Culler, et al.
- 1992
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
228
|
C.E.: Scheduling Multithreaded Computations by Work Stealing
– Blumofe, Leiserson
- 1994
|
|
224
|
The parallel evaluation of general arithmetic expressions,J
– Brent
- 1974
|
|
220
|
Genaral purpose parallel architectures
– Valiant
- 1990
|
|
202
|
How toEmulate Shared Memory
– Ranade
- 1991
|
|
173
|
A scheme for fast parallel communication
– Valiant
- 1982
|
|
118
|
Dynamic perfect hashing: Upper and lower bounds
– Dietzfelbinger, Karlin, et al.
- 1994
|
|
95
|
Memory Consistency Models
– Mosberger
- 1993
|
|
53
|
Towards a theory of nearly constant time parallel algorithms
– Gil, Matias, et al.
- 1991
|
|
51
|
Analysis of multithreaded architectures for parallel computing
– Saavedra-Barrera, Culler, et al.
- 1990
|
|
47
|
Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers, To appear in this journal. (A preliminary version appeared
– Goldberg, Jerrum, et al.
- 1993
|
|
45
|
Converting high probability into nearly-constant time|with applications to parallel hashing
– Matias, Vishkin
- 1991
|
|
42
|
An Optical Simulation of Shared Memory
– Goldberg, Matias, et al.
- 1994
|
|
31
|
Polynomial hash functions are reliable
– Dietzfelbinger, Gil, et al.
- 1992
|
|
29
|
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
– Goodrich
- 1991
|
|
23
|
Spatial machines: A more-realistic approach to parallel computation
– Feldman, Shapiro
- 1992
|
|
20
|
Fast hashing on a PRAM|designing by expectation
– Gil, Matias
- 1991
|
|
20
|
The log-star revolution
– Hagerup
- 1992
|
|
19
|
Work-Optimal Simulation of PRAM Models on Meshes
– Leppanen, Penttonen
- 1994
|
|
13
|
The performance of work stealing in multiprogrammed environments (extended abstract
– Blumofe, Papadopoulos
- 1998
|
|
11
|
gossiping on grids and tori: Deterministic sorting and routing match the bisection bound
– Block
- 1993
|
|
10
|
Fast Load Balancing on a PRAM
– Gil
- 1991
|
|
10
|
A probabilistic simulation of PRAMs on a bounded degree network
– Luccio, Pietracaprina, et al.
- 1988
|
|
7
|
A Concept for a Multithreaded Scheduling Environment
– Leberecht
- 1996
|
|
4
|
Studies on the Realization of PRAM
– Leppanen
- 1996
|
|
3
|
On Implementing EREW Work-Optimally on Mesh of Trees
– Leppanen
- 1995
|
|
