By Topic

Task and resource assignment in distributed real-time 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
$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)
Too-Seng Tia ; Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA ; Liu, J.W.S.

In this paper, we propose an efficient algorithm to statically assign tasks and logical resources to the processors, taking into account the blocking times due to resource contention. We formulate the assignment problem using an assignment graph where the weights on the edges of the graph represent the desirability of assigning the tasks (connected by the edges) to the processors. These weights are computed based on the resource usages, communication costs, and the priorities of the tasks. An efficient clustering and graph-bisection algorithm is used to find an assignment of the tasks and resources such that the total communication costs and total blocking time are minimized, subject to the constraint that the tasks are schedulable after the assignment. Experimental results indicate the effectiveness of our algorithm

Published in:

Parallel and Distributed Real-Time Systems, 1994. Proceedings of the Second Workshop on

Date of Conference:

28-29 Apr 1994