Ramamritham, K., Shiah, P.-F., and Stankovic, J. A. Ecient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 1, 2 (April 1990), 184-195. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Greedy Heuristics for Resource Allocation in.. - Ali, Kim+.. (1 citation) (Correct)
....performance metric that measures how well prepared our static mapping is for absorbing run time variations in the system load. Our metric is aimed for evaluating a statically derived mapping for systems that operate in dynamic environments. Research e#orts in (e.g. 42] 43] 44] 45] 19] [46]) do consider task assignment as well as task scheduling. The research in [42] and [43] used a very simple partition of processors for allocation of tasks to each partition. In the research e#orts of [45] and [19] a branch and bound search algorithm was used for the allocation phase. Even though ....
....suite of machines with multitasking multiple processors and communication links using round robin scheduling policy. Additionally our performance metric focuses on evaluating a statically derived mapping for systems that operate in dynamic environments. The mapping approaches in [44] and [46] allocate and schedule tasks, but the system environment they assume is di#erent. The research e#ort in [46] assumes that applications are independent with no precedence constraints, no communication among applications, no multitasking processors and communication links, and run time variations ....
[Article contains additional citation context not shown here]
K. Ramamritham, J. A. Stankovic, and P.-F. Shiah, "E#cient scheduling algorithms for real-time multiprocessor systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, pp. 184--194, Apr. 1990.
Real-Time Support in General Purpose Operating Systems - Gopalan (2001) (Correct)
....accepted if every task in the request can be scheduled. Once accepted, every task is guaranteed to be executed to meet a hard deadline, irrespective of future scheduling requests at the same or lower levels of importance. The details of the Spring scheduler algorithms can be found in [15] and [28]. Virtual memory is not supported in the Spring kernel because of its inherent unpredictability. Execution is limited to the processors on which the process was physically loaded. Spring provides predictable memory operations by preallocating physical pages at process creation time and ....
K. Ramamritham, J.A. Stankovic, and P.F. Shiah, \Ecient Scheduling Algorithms for Real-Time Multiprocessor Systems", IEEE Transactions on Parallel and Distributed Systems, Vol 1, No. 2, pp 184-195, Apr. 1990.
High-Level Real-Time Concurrency - Harji (2000) (Correct)
No context found.
Ramamritham, K., Shiah, P.-F., and Stankovic, J. A. Ecient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 1, 2 (April 1990), 184-195.
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