By Topic

Multiprocessor Scheduling for Distance-Constrained Task Systems

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

3 Author(s)
Da-Ren Chen ; Hwa Hsia Inst. of Technol., Taipei ; Yu-Chun Chu ; Chiun-Chieh Hsu

In this paper, we pay attention to the real-time multiprocessor scheduling for Distance-Constrained Tasks. By using Early-release-fair (ERfair) model, we propose two efficient algorithms to probe whether the distance constraints of every task can be guaranteed. Moreover, they gather the unfeasible tasks and inflate them with a reweighting function. The proposed algorithms are linear-time and increase significantly the ratio of schedulable task sets.

Published in:

Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)

Date of Conference:

3-6 Dec. 2007