MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The Dybbuk Runtime System

Download:
pdf | ps
by Ravi Ponnusamy, Raja Das, Joel Saltz, Dimitri Mavriplis, Alok Choudhary
ftp://ftp.cs.umd.edu/pub/hpsl/papers/compcon.ps.Z
Add To MetaCart

Abstract:

Over the past few years, we have developed methods that make it possible for a compiler to efficiently map many sparse and unstructured scientific problems to scalable multiprocessor architectures. These methods are implemented using compiler embeddable runtime support procedures. These procedures can be thought of as supporting a type of weakly coherent distributed shared memory that can be closely coupled to distributed shared memory compilers. These procedures (1) coordinate inter-processor data movement, (2) manage the storage of and access to copies of off-processor data, (3) support a shared name space, and (4) couple runtime

Citations

414 Partitioning sparse matrices with eigenvectors of graphs – Pothen, Simon, et al. - 1990
216 SPARSKIT: a Basic Tool Kit for Sparse Matrix Computations – Saad - 1990
196 A partitioning strategy for nonuniform problems on multiprocessors – Berger, Bokhari
175 Supporting Compiling Global Name-Space Parallel Loops for Distributed Execution – Koelbel, Mehrotra - 1991
155 Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency Practice and Experience – Williams - 1991
114 Run-time scheduling and execution of loops on message passing machines – Saltz, Crowley, et al. - 1991
99 The design and implementation of a parallel unstructured Euler solver using software primitives – Das, Mavriplis, et al. - 1994
80 Principles of run-time support for parallel processors – Mirchandaney, Saltz, et al. - 1988
50 Execution time support for adaptive scientific algorithms on distributed memory machines. Concurrency: Practice and Experience – Berryman, Saltz, et al. - 1991
48 A MIMD Implementation of a Parallel Euler Solver for Unstructured Grids – Venkatakrishnan, Simon, et al. - 1991
47 Distributed memory compiler methods for irregular problems - data copy reuse and runtime partitioning – Das, Ponnusamy, et al.
40 Partitioning of unstructured mesh problems for parallel processing – Simon - 1991
32 Compiler analysis for irregular problems in Fortran D – Hanxleden, Kennedy, et al. - 1992
29 SUPERB support for irregular scientific computations – Brezany, Gerndt, et al. - 1992
20 Load balancing loosely synchronous problems with a neural network – Fox, Furmanski - 1988
20 PARTI primitives for unstructured and block structured problems – Sussman, Saltz, et al. - 1992
15 Performance of hashed cache data migration schemes on multicomputers – Hiranandani, Saltz, et al. - 1991
13 Runtime compilation for multiprocessors. Concurrency: Practice and Experience – Saltz, Berryman, et al. - 1991
1 An evolutionary approach to load balancing parallel computations – Mansour, Fox - 1991