Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Integer and combinatorial optimization
Integer and combinatorial optimization
The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
The real-time operating system of MARS
ACM SIGOPS Operating Systems Review
Introduction to algorithms
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Parametric scheduling for hard real-time systems
Parametric scheduling for hard real-time systems
Computer Control of Manufacturing Systems
Computer Control of Manufacturing Systems
Real-Time Database and Information
Real-Time Database and Information
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
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
| Hi-index | 0.00 |
Parametric scheduling in real-time systems, in the presence of linear relative constraints between the start and execution times of tasks, is a well-studied problem. Prior research established the existence of polynomial time algorithms for the case when the constraints are restricted to be standard and the execution time vectors belong to an axis-parallel hyper-rectangle. In this paper we present a polynomial time algorithm for the case when the execution time vectors belong to arbitrary convex domains. Our insights into the problem occur primarily as a result of studying the dual polytope of the constraint system.