Hybrid Distributed Real Time Scheduling Algorithm

A Scalable Scheduling Algorithm for Real-Time Distributed Systems

Scheduling real-time tasks in a distributed-memory multiprocessor is characterized as sequencing a set of tasks and assigning them to processors of the architecture. Realtime systems research has extensively investigated the sequencing dimension of the scheduling problem by extending uni-processor scheduling techniques to more complex architectures. We introduce a technique that uses an assignm...

Real-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems

This article proposes a Distributed Realtime Fault-tolerant model, priority Real-time Fault-tolerant algorithm and computational architecture of Distributed Real-time Fault-tolerant. According to this model, the problem of how to schedule a weighted Directed Acyclic Graph (DAG) in Distributed computing system for high reliability can be solved in the presence of multiprocessors faults. When som...

DDSCHED: A distributed dynamic real-time scheduling algorithm

An Optimal Scheduling Algorithm for Distributed Heterogeneous Real-Time Systems

We present a branch-and-bound algorithm to optimally schedule a set of communicating parallel real-time tasks, made up of subtasks, in a distributed heterogeneous computer system. The algorithm generates a search tree and for every tree vertex, corresponding to a partial schedule, it calculates a lower bound on the completion time of the subtasks being considered in that vertex. The algorithm t...

Hybrid Multiprocessor Real-Time Scheduling Approach

Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system’s requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can N...