By Topic

Optimal partitioning of random workloads in homogeneous multiprocessor and distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
E. K. Haddad ; Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Falls Church, VA, USA

The problem of distributing M interacting program modules of a given homogeneous random workload over P identical processors for optimizing execution time is examined. The execution time modeling allows full concurrency of activities among different processors but cascades for each processor its computation time, internal communications, external communications, and synchronization/contention delays. The results obtained express the optimality conditions in terms of the various statistical and deterministic parameters of the problem: number of modules; number of processors; mean value of module run time; probabilities and mean values of intraprocessor, interprocessor, and synchronization/contention communications overheads. Optimal load distributions are found to be either even or single-processor assignments, albeit for different conditions than stipulated in previous results

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990