NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Optimal partitioning of random programs across two processorsThe optimal partitioning of random-distributed programs is discussed. It is concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor, or distributes the modules as evenly as possible among all processors. The analysis rests heavily on the approximation which equates the expected maximum of a set of independent random variables with the set's maximum expectation. The results are strengthened by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is also shown that use of this approximation causes two of the previous central results to be false.
Document ID
19890041364
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Nicol, David M.
(College of William and Mary Williamsburg, VA, United States)
Date Acquired
August 14, 2013
Publication Date
February 1, 1989
Publication Information
Publication: IEEE Transactions on Software Engineering
Volume: 15
ISSN: 0098-5589
Subject Category
Computer Systems
Accession Number
89A28735
Funding Number(s)
CONTRACT_GRANT: NAS1-18107
Distribution Limits
Public
Copyright
Other

Available Downloads

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