Deadline-monotonic software scheduling for the co-synthesis of parallel hard real-time systems

Authors:
P. Altenbernd
Affiliations:
CADLAB, D-33094 Paderborn - Germany
Venue:
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Year:
1995

Citing 5
Cited 3

Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Software scheduling in the co-synthesis of reactive real-time systems

DAC '94 Proceedings of the 31st annual Design Automation Conference
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations

IEEE Transactions on Software Engineering

The Slack Method: A New Method for Static Allocation ofHard Real-Time Tasks

Real-Time Systems
A methodology and algorithms for the design of hard real-time multitasking ASICs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
CHaRy: the C-LAB hard real-time system to support mechatronical design

ECBS'97 Proceedings of the 1997 international conference on Engineering of computer-based systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on software scheduling in hard real-time embedded systems. It uses the deadline-monotonic scheduling heuristics, where the analysis whether the hard real-time conditions are met, is done by a schedulability test. The test presented in this paper overcomes the problems of existing approaches with parallel communicating tasks. The essential of the test is, that the communication caused precedence constraints are mapped to minimum-maximum offset intervals, to deal with multiperiod systems, where fixed offset values are insufficient. By this method the deadlines and the offset intervals are computed automatically during the efficient analysis.