Results 1  10
of
55
Proportionate progress: A notion of fairness in resource allocation
 Algorithmica
, 1996
"... Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progre ..."
Abstract

Cited by 306 (27 self)
 Add to MetaCart
(Show Context)
Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progress, called Pfairness, and use it to design an e cient algorithm which solves the periodic scheduling problem. Keywords: Euclid's algorithm, fairness, network ow, periodic scheduling, resource allocation.
Fast Scheduling of Periodic Tasks on Multiple Resources
 In Proceedings of the 9th International Parallel Processing Symposium
"... Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of t ..."
Abstract

Cited by 132 (16 self)
 Add to MetaCart
Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(minfm lg n; ng) time per slot scheduled. 1 Introduction Given a set \Gamma of n tasks, where each task x is characterized by two integer parameters x:e and x:p, and m identical copies of a resource, a periodic schedule is one that allocates a resource to each task x in \Gamma for exactly x:e time units in each interval [k \Delta x:p; (k+1) \Delta x:p) for all k in N, subject to the following constraints: Constraint 1: A resource can only be allocated to a task for an entire "slot" of time, where for each i in N slot i is the unit interval from time i to time i + 1. Constraint 2: No task may be allocated more than one copy of the resource ...
PriorityDriven Scheduling of Periodic Task Systems on Multiprocessors
, 2001
"... The scheduling of systems of periodic tasks upon multiprocessor platforms is considered. ..."
Abstract

Cited by 117 (16 self)
 Add to MetaCart
The scheduling of systems of periodic tasks upon multiprocessor platforms is considered.
A categorization of realtime multiprocessor scheduling problems and algorithms
 HANDBOOK ON SCHEDULING ALGORITHMS, METHODS, AND MODELS
, 2004
"... ..."
Models of Machines and Computation for Mapping in Multicomputers
, 1993
"... It is now more than a quarter of a century since researchers started publishing papers on mapping strategies for distributing computation across the computation resource of multiprocessor systems. There exists a large body of literature on the subject, but there is no commonlyaccepted framework ..."
Abstract

Cited by 80 (1 self)
 Add to MetaCart
It is now more than a quarter of a century since researchers started publishing papers on mapping strategies for distributing computation across the computation resource of multiprocessor systems. There exists a large body of literature on the subject, but there is no commonlyaccepted framework whereby results in the field can be compared. Nor is it always easy to assess the relevance of a new result to a particular problem. Furthermore, changes in parallel computing technology have made some of the earlier work of less relevance to current multiprocessor systems. Versions of the mapping problem are classified, and research in the field is considered in terms of its relevance to the problem of programming currently available hardware in the form of a distributed memory multiple instruction stream multiple data stream computer: a multicomputer.
A survey of hard realtime scheduling for multiprocessor systems
 ACM COMPUTING SURVEYS
, 2011
"... This survey covers hard realtime scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results ab ..."
Abstract

Cited by 79 (9 self)
 Add to MetaCart
This survey covers hard realtime scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.
FixedPriority Preemptive Multiprocessor Scheduling: To Partition or not to Partition
, 2000
"... Traditional multiprocessor realtime scheduling partitions a task set and applies uniprocessor scheduling on each processor. For architectures where the penalty of migration is low, such as uniformmemory access sharedmemory multiprocessors, the nonpartitioned method becomes a viable alternative. ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
Traditional multiprocessor realtime scheduling partitions a task set and applies uniprocessor scheduling on each processor. For architectures where the penalty of migration is low, such as uniformmemory access sharedmemory multiprocessors, the nonpartitioned method becomes a viable alternative. By allowing a task to resume on another processor than the task was preempted on, some task sets can be scheduled where the partitioned method fails. We address fixedpriority scheduling of periodically arriving tasks on Ñ equally powerful processors having a nonpartitioned ready queue. We propose a new priorityassignment scheme for the nonpartitioned method. Using an extensive simulation study, we show that the priorityassignment scheme has equivalent performance to the best existing partitioning algorithms, and outperforms existing fixedpriority assignment schemes for the nonpartitioned method. We also propose a dispatcher for the nonpartitioned method which reduces the number of preemptions to levels below the best partitioning schemes.
Priority Assignment for Global Fixed Priority Preemptive Scheduling in Multiprocessor RealTime Systems
, 2009
"... This paper addresses the problem of priority assignment in multiprocessor realtime systems using global fixed taskpriority preemptive scheduling. In this paper, we prove that Audsley’s Optimal Priority Assignment (OPA) algorithm, originally devised for uniprocessor scheduling, is applicable to th ..."
Abstract

Cited by 36 (16 self)
 Add to MetaCart
(Show Context)
This paper addresses the problem of priority assignment in multiprocessor realtime systems using global fixed taskpriority preemptive scheduling. In this paper, we prove that Audsley’s Optimal Priority Assignment (OPA) algorithm, originally devised for uniprocessor scheduling, is applicable to the multiprocessor case, provided that three conditions hold with respect to the schedulability tests used. Our empirical investigations show that the combination of optimal priority assignment policy and a simple compatible schedulability test is highly effective, in terms of the number of tasksets deemed to be schedulable. We also examine the performance of heuristic priority assignment policies such as Deadline Monotonic, and an extension of the TkC priority assignment policy called DkC that can be used with any schedulability test. Here we find that Deadline Monotonic priority assignment has relatively poor performance in the multiprocessor case, while DkC priority assignment is highly effective. 1.
Fairness in Periodic RealTime Scheduling
, 1995
"... The issue of temporal fairness in periodic realtime scheduling is considered. It is argued that such fairness is often a desirable characteristic in realtime schedules. A concrete criterion for temporal fairness  pfairness  is described. The weightmonotonic scheduling algorithm, a static prio ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
The issue of temporal fairness in periodic realtime scheduling is considered. It is argued that such fairness is often a desirable characteristic in realtime schedules. A concrete criterion for temporal fairness  pfairness  is described. The weightmonotonic scheduling algorithm, a static priority scheduling algorithm for generating pfair schedules, is presented and proven correct. A feasibility test is presented which, if satisfied by a system of periodic tasks, ensures that the weightmonotonic scheduling algorithm will schedule the system in a pfair manner.
A Survey of Hard RealTime Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems
"... This survey covers hard realtime scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results a ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
(Show Context)
This survey covers hard realtime scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open