scientific article; zbMATH DE number 2080043

zbMATH Open1043.68512MaRDI QIDQ4472230FDOQ4472230

Authors: K. Subramani 

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (11)

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

This page was built for publication:

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