An analysis of zero-clairvoyant scheduling

DOI10.1007/3-540-46002-0_8MaRDI QIDQ4472230zbMATH OpenFDO

Authors K. Subramani

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2280/22800098.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A polynomial time algorithm for Zero-Clairvoyant scheduling
• An analysis of partially Clairvoyant scheduling
• An analysis of totally clairvoyant scheduling
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 437567

Cited in

(11)

• An analysis of partially Clairvoyant scheduling
• An analysis of totally clairvoyant scheduling
• A zero-space algorithm for negative cost cycle detection in networks
• A polynomial time algorithm for Zero-Clairvoyant scheduling
• On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
• A complexity perspective on entailment of parameterized linear constraints
• An empirical analysis of algorithms for partially Clairvoyant scheduling
• Zero-clairvoyant scheduling with inter-period constraints
• Formal Modeling and Analysis of Timed Systems
• Graceful Degradation in Semi-Clairvoyant Scheduling
• On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers

This page was built for publication: An analysis of zero-clairvoyant scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472230)