Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks

Authors:
Anupam Datta;Sidharth Choudhury;Anupam Basu
Affiliations:
Computer Science Dept., Stanford University;Dept. of Computer Sciences, University of Texas at Austin;Dept. of Computer Science & Engg., IIT Kharagpur, India
Venue:
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Year:
2002

Citing 9
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Performance estimation of embedded software with instruction cache modeling

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling

IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Improved Approximation Guarantees for Packing and Covering Integer Programs

SIAM Journal on Computing
Adding instruction cache effect to schedulability analysis of preemptive real-time systems

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Satisfying Timing Constraints of Preemptive Real-Time Tasks through Task Layout Technique

VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)

Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In preemptive real-time systems, a tighter estimate of the Worst Case Response Time (WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the estimation procedure. This is because the Cache Related Preemption Delay (CRPD) depends on the inter-task interference in the cache. We develop a response time analysis framework which takes the layout of the tasks into account. We present an ILP formulation which generates a layout of the tasks such that all timing constraints are satisfied. To overcome the issue of non-scalability associated with an ILP solution, we also present a linear programming relaxation of the ILP formulation, which offers an approximate solution. The performance of the proposed formulation is demonstrated.