S. Chang, J. A. Stankovic and K. Ramamritham, `Scheduling algorithms for hard real-time systems: a brief survey', in J. A. Stankovic and K. Ramamritham (eds), Hard Real-Time Systems: Tutorial, IEEE, 1988, pp. 150--173.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....earliest start times, etc. of an incoming job. Before a job is assigned one or more physical processors, the scheduler checks whether the system can satisfy the job s timing constraints. This analysis is known as schedulability analysis. Schedulability analysis and scheduling for real time systems [53, 269, 37, 108, 150, 71, 268] are active areas of research and are not within the scope of this paper. 3.2 Memory Management Memory management for UMA multiprocessors is conceptually similar to that for multiprogrammed uniprocessors. As mentioned earlier, in an UMA architecture, memory access times are equal for all ....

Sheng-Chang Cheng, John A. Stankovic, and Krithi Ramamritham. Scheduling algorithms for hard real-time systems - a brief survey. In Tutorial Hard Real-Time Systems, pages 150--173. IEEE, 1988.

....we have developed several algorithms that attempt to selectively build as much fault tolerance as possible into an existing schedule, while observing hard real time and precedence constraints. The existing schedule may be created by any number of hard real time scheduling heuristics [3, 8, 10, 13, 15, 17, 22, 30, 27]. Next, fault tolerance is built into the schedule using two types of backups, replicas and deallocating backups, and the practice of backup overloading. A replica is a copy of a task which is scheduled in case the primary copy of the task fails to execute properly. In the event of such a ....

Sheng-Chang Cheng and John A. Stankovic. "Scheduling Algorithms for Hard Real-Time Systems--A Brief Survey," Hard Real-Time Systems Tutorial, (John A. Stankovic and Krithi Ramamritham, eds), IEEE Computer Society Press, Washington D.C., pages 150-173, 1988.

....to create multiprocessor schedules. These are algorithms which are not guaranteed to always yield the best solution; however, a judicious heuristic algorithm will always yield a relatively good solution. A great number of researchers have explored the area of hard real time heuristic algorithms [3, 9, 11, 14, 16, 18, 23, 30, 31]. 1.2 Fault Tolerant Methods and Failure Models In this paper, fault tolerance is provided for a task by the use of two types of backups replicas and deallocating backups. A replica is a copy of a task which is scheduled in case the primary copy of the task fails to execute properly. In the ....

Sheng-Chang Cheng and John A. Stankovic. "Scheduling Algorithms for Hard Real-Time Systems--A Brief Survey," Hard Real-Time Systems Tutorial, (John A. Stankovic and Krithi Ramamritham, eds), IEEE Computer Society Press, Washington D.C., pages 150-173, 1988.

No context found.

S. Chang, J. A. Stankovic and K. Ramamritham, `Scheduling algorithms for hard real-time systems: a brief survey', in J. A. Stankovic and K. Ramamritham (eds), Hard Real-Time Systems: Tutorial, IEEE, 1988, pp. 150--173.

No context found.

Sheng-Chang Cheng and John A. Stankovic. Scheduling algorithms for hard realtime systems -- a brief survey. In John A. Stankovic and Krithi Ramamritham, editors, Hard Real-Time Systems, chapter 5, pages 150--173. IEEE Computer Society Press, 1988.

No context found.

Sheng-Chang Cheng and John A. Stankovic. Scheduling Algorithms for Hard Real-Time Systems --- A Brief Survey. In J.A. Stankovic, K. Ramamrithan, editor, Hard real-time systems, IEEE CS Press, 1988.

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