By Topic

Performance evaluation of dynamic scheduling algorithms on a multiprocessor cluster

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)
E. Di Sciascio ; Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari, Italy ; G. Piscitelli

Solutions currently available for task scheduling of multiprocessor systems are mainly static, i.e. they assume a prior complete knowledge of tasks and consequently make a rigid system set-up. These solutions are costly, as they require the design of a specific task allocation scheme for each application, and suffer from inflexibility. The authors simulated performance results of three modified version of the dynamic scheduling bidding algorithm, referred to a multiprocessor cluster. A discrete element dynamic model of the multiprocessor system is applied

Published in:

Electrotechnical Conference, 1996. MELECON '96., 8th Mediterranean  (Volume:2 )

Date of Conference:

13-16 May 1996