An empirical analysis of algorithms for partially Clairvoyant scheduling

DOI10.1080/17445760601029560zbMath1124.68015OpenAlexW1972643847MaRDI QIDQ5421611

D. Desovski, K. Subramani and Vahan Mkrtchyan

Publication date: 24 October 2007

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760601029560

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Cites Work

• Quantifier elimination for real algebra -- the quadratic case and beyond
• Designing deductive databases
• Scheduling real-time computations with separation constraints
• An analysis of partially Clairvoyant scheduling
• Out of order quantifier elimination for standard quantified linear programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An empirical analysis of algorithms for partially Clairvoyant scheduling