T. F. Adbelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Trans. on Computers, 49(1), 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and communication constraints exist among tasks as in our task systems, these results cannot be used directly. Instead, an approach to task assignment that can take into account the relationship of workload and schedulability must be explored for distributed real time systems. Abdelzaher and Shin [1], Ramamritham [17] and Peng et al. 16] studied the problem where subtasks or modules of a task can have precedence and communication constraints in a distributed environment. Both allocation and scheduling decisions are considered in their approaches. In this respect, their work comes closest to ....

....decisions are considered in their approaches. In this respect, their work comes closest to ours. But there are many differences. In their task models, subtasks or modules within a task that are to be scheduled share the same period, while our algorithm handles tasks with different periods. In [1], Abdelzaher and Shin first generate task and processor clustering recommendations based on heuristic analysis of communication capacities and task periods, respectively. Task clusters are then mapped to processor clusters. Workload is considered in the mapping stage. However, schedulability is ....

T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Transactions on Computers, 49(1):81--87, January 2000.

....environments [2, 4, 6, 10, 11, 26] All these techniques are for preemptive tasks and task or job migrations are assumed to be permitted without any penalty. If precedence and communication constraints exist, these results cannot be directly used. Peng et al. 17] Abdelzaher et al. [1] and Ramamritham [18] studied the task allocation and scheduling problem in a distributed environment. In their models, subtasks or modules of a task can have precedence and communication constraints. From this perspective, their work comes closest to ours. By using a branch and bound search ....

....[8] while the algorithm [3] used in their method is to find a preemptive schedule; 3) the precedence constraints are predetermined among specific instances of tasks in their algorithm, while in our approach, this is accomplished by the scheduling subject to the precedence constraints. In [1], a period based method is proposed to the problem of load partitioning and assignment for large distributed real time applications. Scalability is achieved by utilizing a recursive divide and conquer technique. 18] discussed a static algorithm for allocating and scheduling components of periodic ....

T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Transactions on Computers, 49(1):81--87, January 2000.

....recent paper, Nilsson et al. 12] presented an application of PCM on an avionics control software using constraint programming. 5 example, 13, 14, 15, 16, 17, 18] few techniques actually exist for deriving other types of task level constraints. However, Ramamritham [19] and Abdelzaher Shin [20] propose techniques that generate task clustering recommendations based on heuristic analyses of inter task communication needs and task periods, respectively. All of these constraint derivation techniques assume a subsequent scheduling stage which means that constraint derivation is primarily ....

T. F. Abdelzaher and K. G. Shin, "Period-Based Load Partitioning and Assignment for Large Real-Time Applications," IEEE Trans. on Computers, vol. 49, no. 1, pp. 81--87, Jan. 2000.

.... assumed in 50 of the cases Deadline Period Deadline equal to period [41] MinMax Overlapping execution windows [16, 10] Slicing Non overlapping execution windows [13, 27] Cluster Explicit Clustering as provided by TaskSet class Pairwise Pairwise clustering [43] Period Period based clustering [1] Replicate Explicit Replication as provided by TaskSet class Allocate Exhaustive Branch and bound strategy [35, 28] Greedy Greedy strategy (subset of Exhaustive) ObjFunc HSL Highest static level [2] HDL Highest dynamic level [47] EST Earliest start time [39] EFT Earliest finish time [30] ....

T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. Technical report, Dept. of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, May 1996.

No context found.

A. Tarek and K. Shin. Period based load partitioning and assignment for large real time applications. IEEE Transactions on Computers, 49(1):81--87, January 2000.

No context found.

T. F. Adbelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Trans. on Computers, 49(1), 2000.

No context found.

T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Transactions on Computers, 49(1), 2000.

No context found.

T. F. Abdelzaher and K. G. Shin. Period-based load partitioning and assignment for large real-time applications. IEEE Transactions on Computers, 49(1):81--87, January 2000.

No context found.

T. F. Abdelzaher and K. G. Shin, "Period-Based Load Partitioning and Assignment for Large Real-Time Applications," IEEE Trans. on Computers, vol. 49, no. 1, pp. 81--87, Jan. 2000.

No context found.

T. F. Abdelzaher and K. G. Shin, \Period-Based Load Partitioning and Assignment for Large Real-Time Applications," IEEE Trans. on Computers, vol. 49, no. 1, pp. 81-87, Jan. 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC