Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Dynamic processor assignment in a task system with time-varying load

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

2 Author(s)
Brunstrom, A. ; Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA ; Simha, R.

In many applications a task is repeatedly executed on several sets of data in a pipeline fashion. For example, image processing software is frequently executed on a sequence of images. Due to varying semantic content in the data, each subtask of the overall task may experience variations in execution time for different instances of the data. The authors consider the problem of efficiently executing a task on a large parallel machine. In particular, they focus on dynamically assigning processors to subtasks in response to changing workloads seen by the subtasks. They present several processor assignment algorithms and study their performance through simulation. The simulation study is based on an application in computer vision. The results suggest dynamic re-assignment can perform very close to the theoretical optimum and distinctly better than static assignments

Published in:

Southeastcon '95. Visualize the Future., Proceedings., IEEE

Date of Conference:

26-29 Mar 1995