Sciweavers

RTSS
1994
IEEE
14 years 3 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
RTSS
1994
IEEE
14 years 3 months ago
Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes
This paper presents a comprehensive design methodology for guaranteeing end-to-end requirements of real-time systems. Applications are structured as a set of process components co...
Richard Gerber, Seongsoo Hong, Manas Saksena
RTSS
1994
IEEE
14 years 3 months ago
Computing Quantitative Characteristics of Finite-State Real-Time Systems
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
RTSS
1994
IEEE
14 years 3 months ago
Bounding Worst-Case Instruction Cache Performance
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently...
Robert D. Arnold, Frank Mueller, David B. Whalley,...
RTSS
1994
IEEE
14 years 3 months ago
On-Line Scheduling to Maximize Task Completions
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
RTSS
1994
IEEE
14 years 3 months ago
Timeliness via Speculation for Real-Time Databases
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency ...
Azer Bestavros, Spyridon Braoudakis