Bounding the end-to-end response time in multiprocessor real-time systems

Authors:
Jun Sun;J. W. S. Liu
Affiliations:
-;-
Venue:
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
Year:
1995

Citing 0
Cited 4

Using an architecture description language for quantitative analysis of real-time systems

WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Response time analysis of EDF distributed real-time systems

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

ACM Transactions on Embedded Computing Systems (TECS)
A recursive approach to end-to-end path latency computation in heterogeneous multiprocessor systems

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.