We consider the problem of finding efficient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which different processors have different computational potential. To this end, we define a formal computational model for heterogeneous systems and develop algorithms for commonly used communication operations. The result is that many existing parallel algorithms which use these communication operations can be adapted to our model with little or no modifications. Experimental results are give which show that our algorithms are of considerable practical relevance.
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
3620
|
Design Patterns: Elements of Reusable Object-oriented Software
– Gamma, Helm, et al.
- 1994
|
|
970
|
A bridging model for parallel computation
– Valiant
- 1997
|
|
557
|
An Introduction to Parallel Algorithms
– JaJa
- 1992
|
|
492
|
Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition
– Knuth
- 1998
|
|
434
|
LogP: Towards a Realistic Model of Parallel Computation
– Culler, al
- 1993
|
|
185
|
Direct Bulk-Synchronous Parallel Algorithms
– Gerbessiotis, Valiant
- 1992
|
|
149
|
editor. A Synthesis of Parallel Algorithms
– Reif
- 1993
|
|
127
|
Using processor affinity in loop scheduling on shared-memory multiprocessors
– Markatos, LeBlanc
- 1994
|
|
119
|
Strategies for dynamic load balancing on highly parallel computers
– Willebeek-LeMair, Reeves
- 1993
|
|
81
|
Beowulf: Harnessing the power of parallelism in a pileof-PCs
– Ridge, Becker, et al.
- 1997
|
|
77
|
Data-parallel programming on a network of heterogeneous workstations
– Nedeljkovic, Quinn
- 1992
|
|
74
|
Scalable parallel computational geometry for coarse grained multicomputers
– Dehne, Fabri, et al.
- 1996
|
|
61
|
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
– Caceres, Dehne, et al.
- 1997
|
|
57
|
auf der Heide. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
– Baumker, Dittrich, et al.
- 1995
|
|
50
|
A quantitative comparison of parallel computation models
– Juurlink, Wijshoff
- 1996
|
|
46
|
High performance computing on a cluster of workstations
– Cheung, Reeves
- 1992
|
|
35
|
Fully dynamic search trees for an extension of the BSP model
– Baumker, Dittrich
- 1996
|
|
31
|
Parallel algorithms for personalized communication and sorting with an experimental study
– Helman, Bader, et al.
- 1996
|
|
31
|
An effective and practical performance prediction model for parallel computing on non-dedicated heterogeneous NOW
– Yan, Zhang, et al.
- 1996
|
|
26
|
Modeling and Characterizing Parallel Computing Performance on Heterogeneous Networks of Workstations
– Zhang, Yan
- 1995
|
|
25
|
Modeling Parallel Bandwidth: Local vs. Global Restrictions
– Adler, Gibbons, et al.
- 1997
|
|
21
|
Loop scheduling for heterogeneity
– Cierniak, Li, et al.
- 1995
|
|
20
|
Plasma Simulation on Networks of Workstations using the Bulk-Synchronous Parallel Model
– Nibhanupudi, Norton, et al.
- 1995
|
|
19
|
Solving Computational Grand Challenges Using a Network of Supercomputers
– Beguelin, Dongarra, et al.
- 1991
|
|
19
|
Communication efficient data structures on the BSP model with applications
– Gerbessiotis, Siniolakis
- 1996
|
|
19
|
Selection on the Bulk-Synchronous Parallel model with applications to priority queues
– Gerbessiotis, Siniolakis
- 1996
|
|
12
|
A Template for Non--Uniform Parallel Loops Based on Dynamic Scheduling and Prefetching Techniques
– Orlando, Perego
- 1996
|
|
9
|
The deterministic complexity of parallel multisearch
– Baumker, Dittrich, et al.
- 1996
|
|
6
|
A decomposition advisory system for heterogeneous data-parallel processing
– Crandall, Quinn
- 1994
|
|
3
|
auf def
– Baumker, Dittrich, et al.
- 1996
|
|
3
|
Computing the medial axis transform with 8 scan operations
– Ferreira, Ub'eda
- 1995
|
|
3
|
The PLEDA User's Guide
– Morin
- 1997
|
|
3
|
The LEDA manual
– Naer
- 1993
|
|
1
|
The PLEDA User's Guide. Carleton University, 1.0 edition
– Morin
- 1997
|
|
