Safety analysis of timing properties in real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Theory of linear and integer programming
Theory of linear and integer programming
An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
The real-time operating system of MARS
ACM SIGOPS Operating Systems Review
Artificial Intelligence - Special issue on knowledge representation
Scheduling real-time computations with separation constraints
Information Processing Letters
Compiling real-time programs into schedulable code
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
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
Real-Time Database and Information
Real-Time Database and Information
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
Duality in the parametric polytope and its applications to a scheduling problem
Duality in the parametric polytope and its applications to a scheduling problem
Timing Constraints of Real-Time Systems: Constructs for Expressing Them, Methods of Validating Them
IEEE Transactions on Software Engineering
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
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
Periodic Linear Programming with applications to real-time scheduling
Mathematical Structures in Computer Science
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
A Zero-Space algorithm for Negative Cost Cycle Detection in networks
Journal of Discrete Algorithms
On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
International Journal of Parallel Programming
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A randomized algorithm for BBCSPs in the prover-verifier model
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Totally clairvoyant scheduling with relative timing constraints
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
In the design of real-time systems, it is often the case that certain process parameters, such as its execution time are not known precisely. The challenge in real-time system design is to develop techniques that efficiently meet the requirements of impreciseness. Traditional models tend to simplify the issue of impreciseness by assuming worst-case values. This assumption is unrealistic and at the same time, may cause certain constraints to be violated at run-time. In this paper, we study the problem of scheduling a set of ordered, nonpreemptive jobs under non-constant execution times. Typical applications for variable execution time scheduling include process scheduling in Real-time Operating Systems such as Maruti, compiler scheduling, database transaction scheduling and automated machine control. An important feature of application areas such as robotics is the interaction between execution times of various processes. We explicitly model this interaction through the representation of execution time vectors as points in convex sets. Our algorithms do not assume any knowledge of the distributions of execution times, i.e. they are zero-clairvoyant. We present both sequential and parallel algorithms for determining the existence of a zero-clairvoyant schedule.