Synchronization protocols in distributed real-time systems

In many distributed real-time systems, the workload can be modeled as a set of periodic tasks, each of which consists of a chain of subtasks executing on different processors. Synchronization protocols are used to govern the release of subtasks so that the precedence constraints among subtasks are s...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 16th International Conference on Distributed Computing Systems pp. 38 - 45
Main Authors: Sun, J., Liu, J.
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
ISBN:9780818673993, 0818673990
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In many distributed real-time systems, the workload can be modeled as a set of periodic tasks, each of which consists of a chain of subtasks executing on different processors. Synchronization protocols are used to govern the release of subtasks so that the precedence constraints among subtasks are satisfied and the schedulability of the resultant system is analyzable. Tasks have different worst-case and average end-to-end response times when different protocols are used. In this paper, we consider distributed real-time systems with independent, periodic tasks and fixed-priority scheduling algorithms. We propose three synchronization protocols and conduct simulation to compare their performance with respect to the two timing aspects.
ISBN:9780818673993
0818673990
DOI:10.1109/ICDCS.1996.507899