Zero-Clairvoyant scheduling with inter-period constraints

Authors:
K. Subramani
Affiliations:
LCSEE, West Virginia University, Morgantown, WV
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 4
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Introduction to Algorithms

Introduction to Algorithms
A Specification Framework for Real-Time Scheduling

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
An analysis of quantified linear programs

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces two new mathematical modelingparadigms called Periodic Linear Programming and Periodic Quantified Linear Programming. The former is an extension of traditional Linear Programming, whereas the latter extends Quantified Linear Programming. We use these tools to capture the specifications of real-time embedded systems, which are characterized by uncertainty, complex timing constraints and periodicity. The strength of the modeling techniques lies in the ease with which these specifications can be represented and analyzed.