Channel characteristics in local-area hard real-time systems
Computer Networks and ISDN Systems
Scheduling algorithms for hard real-time systems: a brief survey
Tutorial: hard real-time systems
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads
IEEE Transactions on Software Engineering
Scheduling periodic and aperiodic tasks using the slack stealing algorithm
Advances in real-time systems
Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
| Hi-index | 0.00 |
Modern real-time systems need enormous computer power, for which a uniprocessor system is often inadequate. This work is directed at developing a task scheduling algorithm for distributed systems with the goal of achieving flexibility through dynamic scheduling of tasks in a distributed and adaptive manner. In this paper we present a dynamic soft real-time task scheduling algorithm named DDSCHED for distributed systems. The two main components of DDSCHED are a local scheduler and a distributed scheduling scheme. The local scheduler is designed based on the earlist deadline first(EDF) policy and the concept of window. The implementation uses an efficient data structure to reduce the time complexity from 0(n2) for the basic EDF algorithm to 0(n log n). The distributed scheduling scheme is based on a focus-based heuristic algorithm and a bidding-based algorithm. Our algorithm takes care of the network delays.