An empirical analysis of algorithms for partially Clairvoyant scheduling

References

• Ahuja , R.K. , Magnanti , T.L. and Orlin , J.B. 1993 . Network Flows: Theory, Algorithms and Applications , Prentice-Hall .
   Google Scholar
• Benhamou , F. and Goulard , F. 2000 . “ Universally quantified interval constraints ” . In Proceedings of Constraint Programming September
   Google Scholar
• Colmerauer , A. and Dao , T. 2000 . “ Expressiveness of full first order constraints in the algebra of finite or infinite trees ” . In Proceedings of Constraint Programming September
   Google Scholar
• Choi , S. 2000 . Dynamic time-based scheduling for hard real-time systems . Journal of Real-Time Systems ,
   Google Scholar
• Cormen , T.H. , Leiserson , C.E. and Rivest , R.L. 1992 . Introduction to Algorithms , 1st ed. , MIT Press and McGraw-Hill Book Company .
   Google Scholar
• Gerber , R. , Pugh , W. and Saksena , M. 1995 . “ Parametric Dispatching of Hard Real-Time Tasks ” . In IEEE Transactions on Computers
   Google Scholar
• Han , C.C. and Lin , K.J. 1992 . Scheduling real-time computations with separation constraints . Information Processing Letters , 12 : 61 – 66 . May
   Google Scholar
• Helman , P. and Veroff , R. 1988 . Designing deductive databases . Journal of Automated Reasoning , 4 ( 1 ) : 29 – 68 . March
   Google Scholar
• Immerman , N. 1999 . Descriptive Complexity , Springer .
   Google Scholar
• Lassez , C. and Lassez , J.L. 1993 . Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm , Academic Press .
   Google Scholar
• Mosse , D. , Ko , K.-T. , Agrawala , A.K. and Tripathi , S.K. 1992 . Maruti: An Environment for Hard Real-Time Applications , Edited by: Agrawala , A.K. , Gordon , K.D. and Hwang , P. 75 – 85 . Maruti OS : IOS Press .
   Google Scholar
• Pinedo , M. 1995 . “ Scheduling: Theory, Algorithms, and Systems ” . Englewood Cliffs : Prentice-Hall .
   Google Scholar
• Subramani , K. and Kovalchick , L. 2003 . “ Contraction versus relaxation: a comparison of two approaches for the negative cost cycle detection problem ” . In Proceedings of the 3rd International Conference on Computational Science (ICCS), , Edited by: Sloot , P.M.A. 377 – 387 . Springer-Verlag . volume 2659 of Lecture Notes in Computer Science, June
   Google Scholar
• Subramani , K. 2001 . “ Parametric scheduling for network constraints ” . In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON) , Edited by: Wang , J. 550 – 560 . Springer-Verlag . volume 2108 of Lecture Notes in Computer Science, August
   Google Scholar
• Subramani , K. 2002 . “ A specification framework for real-time scheduling ” . In Proceedings of the 3rd Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM) , Edited by: Grosky , W.I. and Plasil , F. 195 – 207 . Springer-Verlag . volume 2540 of Lecture Notes in Computer Science, November
   Google Scholar
• Subramani , K. 2003 . An analysis of partially clairvoyant scheduling . Journal of Mathematical Modelling and Algorithms , 2 ( 2 ) : 97 – 119 .
   Google Scholar
• Subramani , K. 2003 . “ An analysis of quantified linear programs ” . In Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS) , Edited by: Calude , C.S. 265 – 277 . Springer-Verlag . volume 2731 of Lecture Notes in Computer Science, July
   Google Scholar
• Subramani , K. and Desovski , D. 2005 . “ A new verification procedure for partially Clairvoyant scheduling ” . In Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS) October
   Google Scholar
• Subramani , K. and Desovski , D. 2005 . Out of order quantifier elimination for standard quantified linear programs . Journal of Symbolic Computation , 40 : 1383 – 1396 .
   Google Scholar
• Tarski , A. 1951 . A Decision Method for Elementary Algebra and Geometry , Berkeley : Univ. of California Press .
   Google Scholar
• Chandru , V. and Rao , M.R. 1999 . “ Linear programming ” . In Algorithms and Theory of Computation Handbook, CRC Press, 1999 , CRC Press .
   Google Scholar
• Weispfenning , V. 1997 . Quantifier elimination for real algebra—the quadratic case and beyond . Applicable Algebra in Engineering, Communication and Computing , 8 ( 2 ) : 85 – 101 .
   Google Scholar