The performance of asynchronous algorithms on hypercubes
Many asynchronous algorithms have been developed for parallel computers. Most implementations of asynchronous algorithms, however, have been for shared memory machines. In this paper, we study the implementation and performance of some common asynchronous algorithms on the NCUBE/ten, a 1024 node hypercube. In addition, we summarize existing theoretical work and discuss some classes of algorithms that can be made asynchronous and some that cannot. 16 refs., 3 figs.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 6548901
- Report Number(s):
- SAND-88-2714; ON: DE89005503
- Country of Publication:
- United States
- Language:
- English
Similar Records
Molecular dynamics simulations of short-range force systems on 1024-node hypercubes
Hypercube project and a simulator for a hypercube of computers
Parallel graphics algorithms on a 1024-processor hypercube
Conference
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:7186203
Hypercube project and a simulator for a hypercube of computers
Conference
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5868924
Parallel graphics algorithms on a 1024-processor hypercube
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5956894