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

Tarek F. Abdelzaher, Kang G. Shin

Research output: Contribution to conferencePaper

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.

Original languageEnglish (US)
Pages162-171
Number of pages10
StatePublished - Dec 1 1995
Externally publishedYes
EventProceedings of the 1995 16th IEEE Real-Time Systems Symposium - Pisa, Italy
Duration: Dec 5 1995Dec 7 1995

Other

OtherProceedings of the 1995 16th IEEE Real-Time Systems Symposium
CityPisa, Italy
Period12/5/9512/7/95

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Optimal combined task and message scheduling in distributed real-time systems'. Together they form a unique fingerprint.

  • Cite this

    Abdelzaher, T. F., & Shin, K. G. (1995). Optimal combined task and message scheduling in distributed real-time systems. 162-171. Paper presented at Proceedings of the 1995 16th IEEE Real-Time Systems Symposium, Pisa, Italy, .