Theoretical Computer Science
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Multidimensional access methods
ACM Computing Surveys (CSUR)
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
Journal of Heuristics
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Durations for Truly-Concurrent Transitions
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
New results on shortest paths in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
| Hi-index | 0.00 |
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs. In this paper, we pursue this direction further by showing a property of the geometrization that permits finding good schedules by means of efficient geometric computation. In addition, this geometric property is also exploited to reduce the scheduling problem to a simple path planning problem originating from robotics, for which we developed a scheduling algorithm using probabilistic path planning techniques. These results enabled us to implement a prototype tool that can handle models with up to 100 concurrent threads.