by Radu Calinescu, Radu Calinescu
http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/TR-1-97.ps.gz
Add To MetaCart
Abstract:
One of the major challenges of the current research in the field of parallel computing is the development of a realistic underlying framework for the design and programming of general purpose parallel computers. The bulk-synchronous parallel (BSP) model is largely viewed as the most suitable candidate for this role, as it offers support for both the design of scalable parallel architectures and the generation of portable parallel code. However, when considering the development of portable parallel software within the framework of the BSP model, one cannot disregard the existence of a broad basis of efficient sequential and PRAM solutions for the most various classes of problems. In fact, the recent emergence of reliable techniques for the identification of the potential parallelism of a sequential program has rendered the automatic parallelisation of existing sequential code more compelling than ever. At first sight, BSP simulation of PRAMs appears to be the ideal strategy for taking advantage of this wealth of potential parallelism. Unfortunately, PRAM simulation
Citations
|
344
|
Dependence Analysis for Supercomputing
– Banerjee
- 1988
|
|
293
|
Automatic Translation of FORTRAN Programs to Vector Form
– Allen, Kennedy
- 1987
|
|
255
|
Parallelism in random access machines
– Fortune, Wyllie
- 1978
|
|
204
|
Supernode partitioning
– Irigoin, Triolet
- 1988
|
|
195
|
A Taxonomy of Scheduling in General-purpose Distributed Computing Systems
– Casavant, Kuhl
- 1988
|
|
185
|
Direct Bulk-Synchronous Parallel Algorithms
– Gerbessiotis, Valiant
- 1992
|
|
172
|
Unimodular transformations of double loops
– Banerjee
- 1990
|
|
146
|
Some efficient solutions to the affine scheduling problem. part II. multidimensional time
– Feautrier
- 1992
|
|
98
|
A Comparison of Clustering Heuristics for Scheduling DAGS on Multiprocessors
– Gemsoulis, Yang
- 1992
|
|
77
|
Scienti c Computing on Bulk Synchronous Parallel Architectures
– Bisseling, McColl
- 1993
|
|
75
|
Practical multiprocessor scheduling algorithms for efficient parallel processing
– Kasahara, Narita
- 1984
|
|
46
|
et al “LogP: Towards a Realistic Model of Parallel Computation
– Culler
- 1993
|
|
42
|
An Optical Simulation of Shared Memory
– Goldberg, Matias, et al.
- 1994
|
|
38
|
A theory of loop permutations
– Banerjee
- 1990
|
|
30
|
A survey of PRAM simulation techniques
– Harris
- 1994
|
|
27
|
Finding legal reordering transformations using mappings
– Kelly, Pugh
- 1994
|
|
17
|
Unrolling loops
– Dongarra, Hinds
- 1979
|
|
10
|
et al. Compiler Transformations for High-Performance Computing
– Bacon
- 1994
|
|
9
|
Deterministic simulations of PRAMs on bounded degree networks
– Herley, Bilardi
- 1988
|
|
7
|
et al. Conversion of control dependence to data dependence
– Allen
- 1983
|
|
6
|
Bulk synchronous parallel algorithms for optimistic discrete event simulation
– Calinescu
- 1996
|
|
6
|
Efficient scheduling of loop nests for BSP programs
– Ding, Stefanescu
- 1995
|
|
5
|
et al. (Pen)-ultimate tiling
– Boulet
- 1994
|
|
5
|
An Automatic Programming System of High Efficiency
– Ershov
- 1966
|
|
4
|
Bulk synchronous parallel algorithms for conservative discrete event simulation
– Calinescu
- 1996
|
|
4
|
Bulk synchronous parallel scheduling of uniform dags
– Calinescu
- 1996
|
|
4
|
et al., Task Scheduling in Parallel and Distributed Systems
– El-Rewini
- 1994
|
|
1
|
et al. A comparison of list schedules for parallel processing systems
– Adam
- 1974
|
|
1
|
A parallel model for dynamic load balancing in clustered distributed systems
– Calinescu, Evans
- 1994
|
|
1
|
A neural self-organizing scheme for dynamic load allocation
– Calinescu, Grigoras
- 1994
|
|
1
|
et al. Bulk synchronuous parallel computing -- a paradigm for transportable software
– Cheatham
- 1994
|
|
1
|
et al. The Green BSP library
– Goudreau
- 1995
|
|
1
|
et al. A proposal for the BSP Worlwide standard library
– Goudreau
- 1996
|
|
1
|
Greenberg et al. Efficient parallel algorithms for linear recurrence computation
– C
- 1982
|
|
1
|
kernel service for dynamic load balancing
– Grigoras, Calinescu
- 1995
|
