By Topic

A heuristic approach to task dispatching

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 $31
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)

The work described in this paper suggests that throughput gains are possible for some work loads if dispatching is controlled by a self-adjusting algorithm thatakes into accounthe changing characteristics of tasks both singly and as a group. Minimum benefits can be anticipated when the characteristics of the tasks are homogeneous; if all tasks are heavily Iporiented or all tasks are heavily CPU-oriented, no throughput improvement can be anticipated. In fact, additional overhead will be incurred handling time intervals and manipulating task queues. Under these conditions, the only benefit is the cyclic dispatching of all CPU-oriented tasks, which prevents any single task from monopolizing use of the CPU. Maximum benefits can be anticipated for a mixture of heavily CPU-oriented and heavily Iporiented tasks. It is under these conditions that the algorithm can strive for maximum CPU-I/O overlap.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:9 ,  Issue: 3 )