Aristotle University Of Thessaloniki (AUTH)
Προσομοίωση και αποτίμηση της απόδοσης μεθόδων χρονοδρομολόγησης σε κατανεμημένα συστήματα πραγματικού χρόνου
Abstract
dc:descriptionThe rapid technological advances and the inherent need of most of today's applications for high quality results within strict timing constraints, have made the use of distributed real-time systems vital in our daily life. Avoiding missed deadlines, the complex structure of the workload, the heterogeneity of the computing resources, the need for fault tolerance and the efficient management of overload conditions, are major challenges in distributed real-time systems, which require the employment of appropriate scheduling methods. In order to effectively address these issues, in this thesis we propose and investigate novel scheduling strategies in distributed real-time systems. The performance evaluation of the various policies is performed by simulation. In distributed real-time systems, the workload often consists of complex jobs, which comprise frequently communicating parallel tasks. During the execution of a job, transient failures may occur, due to software faults. In order to improve the system performance and fault tolerance, we propose gang scheduling policies that utilize imprecise computations. The proposed scheduling strategies are compared to other policies that do not employ imprecise computations, under various failure probabilities. Another type of complex workload that is usually used in distributed real-time systems, is a workload that consists of directed acyclic graphs of component tasks. For the scheduling of such complex jobs, we propose algorithms that utilize imprecise computations. The proposed scheduling strategies take into account the effect of input error on the processing time of the component tasks. To further investigate the effect of input error, as well as the effect of heterogeneity of the computing resources on the performance of distributed real-time systems, we examine the scheduling of directed acyclic graphs in a heterogeneous system, utilizing the imprecise computations technique and different input error limits. In the case where the workload consists of directed acyclic graphs, idle time slots may form in the task execution schedule of the system. Hence, we investigate the improvement that can be gained in the performance of a heterogeneous distributed real-time system, by exploiting idle time slots during the scheduling of task graphs. A component task may be inserted into an idle time slot, by employing various bin packing techniques. In order to combine the advantages of both the imprecise computations technique and the idle time slot utilization with bin packing policies, we propose strategies for the scheduling of real-time directed acyclic graphs in a heterogeneous cluster, that combine these techniques for the exploitation of idle time slots.
Degree
thesis:*- Grantor dc:publisher
- Aristotle University Of Thessaloniki (AUTH)
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Stavrinides, Georgios
- Σταυρινίδης, Γεώργιος
Subjects
dc:subject × 12- Προσομοίωση
- Αποτίμηση απόδοσης
- Μέθοδοι χρονοδρομολόγησης
- Κατανεμημένα συστήματα πραγματικού χρόνου
- Simulation
- Performance evaluation
- Scheduling algorithms
- Distributed real-time systems
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Natural Sciences
- Computer and Information Sciences
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/30294