Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
Deadline Assignment in Multiprocessor-Based Fault-Tolerant Systems
HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
Fault-tolerant scheduling algorithm for distributed real-time systems
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
Load profiling: a methodology for scheduling real-time tasks in a distributed system
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Real-Time Primary-Backup (RTPB) Replication with Temporal Consistency Guarantees
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Supporting fault-tolerance for time-critical events in distributed environments
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Supporting fault-tolerance for time-critical events in distributed environments
Scientific Programming
| Hi-index | 0.00 |
In distributed systems, a real-time task has several subtasks which need to be executed at different nodes. Some of these subtasks can be executed in parallel on different nodes without violating their precedence relationships, if any, among them. To better exploit the parallelism, it becomes necessary to assign separate deadlines to subtasks and schedule them independently. We use three subtask deadline assignment policies which we have introduced earlier [4], [7] to develop a bidding-based fault-tolerant scheduling algorithm for distributed real-time systems. A local scheduler which resides on each node, tries to determinea schedule for each subtask according to the primary-backup approach. In this paper we discuss the algorithm and present the results of simulation studies conducted to establish the efficacy of our algorithm.