Actions for Optimal partitioning of random programs across two processors

Email RIS file
Bookmark
Report an Issue

Optimal partitioning of random programs across two processors

Author
Nicol, D. M.
Published
Aug 1, 1986.
Physical Description
1 electronic document
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
The 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.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19860021789.
Accession ID: 86N31261.
NAS 1.26:178159.
ICASE-86-53.
NASA-CR-178159.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15701811