NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Dynamic Load Balancing for Adaptive Computations on Distributed-Memory MachinesDynamic load balancing is central to adaptive mesh-based computations on large-scale parallel computers. The principal investigator has investigated various issues on the dynamic load balancing problem under NASA JOVE and JAG rants. The major accomplishments of the project are two graph partitioning algorithms and a load balancing framework. The S-HARP dynamic graph partitioner is known to be the fastest among the known dynamic graph partitioners to date. It can partition a graph of over 100,000 vertices in 0.25 seconds on a 64- processor Cray T3E distributed-memory multiprocessor while maintaining the scalability of over 16-fold speedup. Other known and widely used dynamic graph partitioners take over a second or two while giving low scalability of a few fold speedup on 64 processors. These results have been published in journals and peer-reviewed flagship conferences.
Document ID
20000021289
Acquisition Source
Marshall Space Flight Center
Document Type
Contractor or Grantee Report
Date Acquired
August 19, 2013
Publication Date
January 1, 1999
Subject Category
Astronomy
Funding Number(s)
CONTRACT_GRANT: NAG8-1114
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
Document Inquiry

Available Downloads

There are no available downloads for this record.
No Preview Available