Allocation and scheduling of precedence-related periodic tasks

Ramamritham, K. (1995) Allocation and scheduling of precedence-related periodic tasks IEEE Transactions on Parallel and Distributed Systems, 6 (4). pp. 412-420. ISSN 1045-9219

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/71.372795

Abstract

This paper discusses a static algorithm for allocating and scheduling components of periodic tasks across sites in distributed systems. Besides dealing with the periodicity constraints, (which have been the sole concern of many previous algorithms), this algorithm handles precedence, communication, as well as replication requirements of subtasks of the tasks. The algorithm determines the allocation of subtasks of periodic tasks to sites, the scheduled start times of subtasks allocated to a site, and the schedule for communication along the communication channel(s). Simulation results show that the heuristics and search techniques incorporated in the algorithm are very effective.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:62898
Deposited On:24 Sep 2011 05:11
Last Modified:24 Sep 2011 05:11

Repository Staff Only: item control page