Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Fast load balancing on a PRAM

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
$31 $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)
Gil, J. ; Dept. of Comput. Sci., British Univ., BC, Canada

Consider the following setting: n processors of a PRAM are given n independent tasks. Each task can be executed in constant time by a single processor. The distribution of tasks among the processors is unknown; each processor has information only about its set of tasks. The batch execution problem is to reschedule the tasks so that quickest execution of all tasks is achieved. Ignoring rescheduling overhead the tasks can be completed in O(1) time. Thus the batch execution problem captures some basic cooperation obstacles of the PRAM model. The paper presents a load balancing algorithm for solving the batch execution problem. The algorithm runs in O(lg lg n) time and achieves, with overwhelming probability, an almost flat distribution, i.e., O(1) tasks for each processor. The model of computation used is the CRCW-PRAM. Nevertheless, the only requirement from the implementation is that the concurrent-write operation is permitted; no assumption is made about its result

Published in:

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date of Conference:

2-5 Dec 1991