An Engineering Approach to Decomposing End-to-End Delays on a Distributed Real-Time System

Authors:
M. Saksena;S. Hong
Affiliations:
-;-
Venue:
WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
Year:
1996

Citing 0
Cited 7

Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems

Real-Time Systems
Time/Utility Function Decomposition Techniques for Utility Accrual Scheduling Algorithms in Real-Time Distributed Systems

IEEE Transactions on Computers
Integrating On-Line Performance Visualization and Real-Time System Design

Real-Time Systems
Pulsar: a resource-control architecture for time-critical service-oriented applications

IBM Systems Journal
HW resource componentizing for smooth migration from single-function ECU to multi-function ECU

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

Journal of Systems and Software
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 propose an adequate engineering technique for decomposing end-to-end delays in distributed real-time systems. Our technique greatly simplifies real-time system design process by turning a global distributed scheduling problem into a set of single processor scheduling problems with local deadlines. The deadline decomposition is done using critical scaling factor as a schedulability metric. As the problem is extremely hard in general, we develop an approximate technique using a simple linear response time model to generate a quick initial solution. We then go on to show how the initial solution helps us identify the bottlenecks, and then use that knowledge to iteratively fine tune the initial solution. The end result is a practical engineering technique to decomposing end-to-end deadlines.