By Topic

A clustering heuristic algorithm for scheduling periodic and deterministic tasks on a multiprocessor system

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

2 Author(s)
M. U. Ilyas ; Avaz Networks, Commun. Enabling Technol., Islamabad, Pakistan ; S. A. Khan

In this paper, a Clustering Heuristic Scheduling Algorithm (CHSA) for periodic and deterministic tasks on a multiprocessor system is presented It is assumed that system repeatedly processes scheduled tasks periodically. The system consists of an array of independent processing elements and no inter-processor communication overheads. The system may or may not require code fetches for the execution of different tasks. The CHSA receives different tasks with a variable probability distribution over time. The CHSA attempts to increase the average processor utilization of the system, reduce the code fetch time overhead by attempting to cluster similar tasks and reduces power consumption across the system by attempting to keep as many processors as possible unutilized, thereby allowing them to be kept in a low-power mode.

Published in:

Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International

Date of Conference: