On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling

DOI10.1007/978-3-319-22975-1_8zbMath1465.68031OpenAlexW2206282488MaRDI QIDQ2945589

Raul Gorcitz, Emilien Kofman, Dumitru Potop-Butucaru, Thomas Carle, Robert de Simone

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01250010/file/paper.pdf

zbMATH Keywords

constraint solvingreal-time schedulingsatisfiability modulo theoriesrepeatable

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• CPLEX

Cites Work

• Measuring the performance of schedulability tests
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Optimal scheduling for two-processor systems
• Symmetry Breaking for Multi-criteria Mapping and Scheduling on Multicores
• Complexity Results for Multiprocessor Scheduling under Resource Constraints

This page was built for publication: On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling