Universiti Teknologi Malaysia Institutional Repository

Applying divisible load theory in real-time multiprocessor scheduling

Chuprat, Suriayati and Salleh, Shaharuddin and Baruah, Sanjoy (2008) Applying divisible load theory in real-time multiprocessor scheduling. In: Advances in Planning, Scheduling and Timetabling Volume 2. Penerbit UTM , Johor, pp. 15-29. ISBN 978-983-52-0635-1

[img]
Preview
PDF
134Kb

Abstract

Real-time computer application systems are systems in which the correctness of a computation depends upon both the logical and temporal properties of the result of the computation. Temporal constraints of real-time systems are commonly specified as deadlines within which activities should complete execution. For hard-real-time systems, meeting timing constraints is crucially important – failure to do so may cause critical failures and in some cases cause hazard to human life (Buttazzo, 2004). In soft-realtime systems, by contrast, the consequences of an occasional missed deadline are not as severe (Buttazzo et al., 2005). One of a well-known real-time scheduling algorithm that focused on meeting the deadlines is the Earliest Deadline First (Liu and Layland, 1973). The EDF algorithm is known to be optimal for single processor, but also proven non-optimal in the multiprocessor system (Baruah, 2002). As parallel processing technologies are getting more sophisticated, the problem of scheduling tasks in multiprocessor system is becoming even more crucial. Thus, there are needs to investigate the scheduling techniques for such systems.Real-time computer application systems are systems in which the correctness of a computation depends upon both the logical and temporal properties of the result of the computation. Temporal constraints of real-time systems are commonly specified as deadlines within which activities should complete execution. For hard-real-time systems, meeting timing constraints is crucially important – failure to do so may cause critical failures and in some cases cause hazard to human life (Buttazzo, 2004). In soft-realtime systems, by contrast, the consequences of an occasional missed deadline are not as severe (Buttazzo et al., 2005). One of a well-known real-time scheduling algorithm that focused on meeting the deadlines is the Earliest Deadline First (Liu and Layland, 1973). The EDF algorithm is known to be optimal for single processor, but also proven non-optimal in the multiprocessor system (Baruah, 2002). As parallel processing technologies are getting more sophisticated, the problem of scheduling tasks in multiprocessor system is becoming even more crucial. Thus, there are needs to investigate the scheduling techniques for such systems.

Item Type:Book Section
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:16822
Deposited By: Liza Porijo
Deposited On:28 Oct 2011 04:56
Last Modified:28 Oct 2011 04:56

Repository Staff Only: item control page