SPAA
1997
ACM
13 years 12 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
Some of the most common parallel programming idioms include locks, barriers, and reduction operations. The interaction of these programming idioms with the multiprocessor's c...