Optimal combined task and message scheduling in distributed real-time systems

Authors:
T. F. Abdelzaher;K. G. Shin
Affiliations:
-;-
Venue:
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Year:
1995

Citing 0
Cited 7

Planning and resource allocation for hard real-time, fault-tolerant plan execution

Proceedings of the third annual conference on Autonomous Agents
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control

IEEE Transactions on Computers
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems

Real-Time Systems
Planning and Resource Allocation for Hard Real-time, Fault-Tolerant Plan Execution

Autonomous Agents and Multi-Agent Systems
A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System

ICPP '97 Proceedings of the international Conference on Parallel Processing
Integrated scheduling of tasks and messages in distributed real-time systems

Engineering of distributed control systems
Adaptive energy-efficient scheduling for hierarchical wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a branch-and-bound (B&B) algorithm for combined task and message scheduling in distributed hard real-time systems. The algorithm finds an optimal schedule for a set of communicating tasks with known arrival times, precedence constraints, and resource requirements in conjunction with the assignment and scheduling of intertask messages over communication links. The schedule is "optimal" in the sense of minimizing maximum task lateness under a heuristic message priority assignment found during the search. A robotics application is used to illustrate the utility and potential of the algorithm. Results of an extensive simulation study analyzing its performance are also presented.