A Maiden Analysis of Longest Wait First

ACM Transactions on Algorithms

Volumn 1, Issue 1, 2005, Pages 14-32

  Edmonds, Jeff ^a   Pruhs, Kirk ^b  

^a YORK UNIVERSITY   (Canada)

^b Learning Research and Development Ctr   (United States)

Author keywords

Algorithms; Broadcast; Flow Time; Multicast; Peformance; Resource augmentation; Scheduling; Theory

Indexed keywords

EID: 84969254462     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1077464.1077467     Document Type: Article

References (31)

1. Apt, K. R. 1990. Logic programming. In Handbook of theoretical computer science, Vol. B: Formal Models and Sematics, J. van Leeuwen, Ed. Elsevier and MIT Press, 493-574.
2. Apt, K. R. and Etalle, S. 1993. On the unification free Prolog programs. In Proceedings of the Conference on Mathematical Foundations of Computer Science, A. Borzyszkowski and S. Sokolowski, Eds. Number 711 in LNCS. Springer-Verlag, 1-19.
3. Apt, K. R. and Marchiori, E. 1994. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing 6, 6A, 743-765.
4. Apt, K. R. and Pedreschi, D. 1993. Reasoning about termination of pure Prolog programs. Information Computation 106, 1 (Sept.), 109-157.
5. Apt, K. R. and Pedreschi, D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory. Oxford University Press, 183-229.
6. Bol, R. and Degerstedt, L. 1993. The underlying search for magic templates and tabulation. In Proceedings of the Tenth International Conference on Logic Programming, D. S. Warren, Ed. The MIT Press, 793-811.
7. BOssi, A., Cocco, N., and Fabris, M. 1994. Norms on terms and their use in proving universal termination of a logic program. Theor. Comput. Sci. 124, 2 (Feb.), 297-328.
8. Bruynooghe, M., Leuschel, M., and Sagonas, K. 1998. A polyvariant binding time analysis for off-line partial deduction. In Proceedings of the 7th European Symposium on Programming,.
9. C. Hankin, Ed. Number 1381 in LNCS. Springer, 27-41.
10. Chen, W. and Warren, D. S. 1996. Tabled evaluation with delaying for general logic programs. Journal of the ACM 43, 1 (Jan.), 20-74.
11. De Schreye, D. and Decorte, S. 1994. Termination of logic programs: the never-ending story. Journal of Log Program. 19 & 20, 1 (May/July), 199-260.
12. De Schreye, D., Verschaetse, K., and Bruynooghe, M. 1992. A framework for analysing the termination of definite logic programs with respect to call patterns. In Proceedings of Fifth Generation Computer Systems Conference. ICOT, 481-488.
13. Decorte, S., De Schreye, D., Leuschel, M., Martens, B., and Sagonas, K. 1997. Termination Analysis for Tabled Logic Programming. In Proceedings of LOPSTR'97: Logic Program Synthesis and Transformation, N. Fuchs, Ed. Number 1463 in LNCS. Springer, 107-123.
14. Decorte, S., De Schreye, D., and Vandecasteele, H. 1999. Constraint-based automatic termination analysis for logic programs. ACM Trans. Program. Lang. Syst. 21, 6 (Nov.), 1077-1136.
15. Early, J. 1970. An efficient context-free parsing algorithm. Commun. ACM 13, 2, 94-102.
16. Glenstrup, A. J. and Jones, N. D. 1996. BTA algorithms to ensure termination of off-line partial evaluation. In Perspectives of System Informatics: Proceedings of the Andrei Ershov Second International Memorial Conference. Number 1181 in LNCS. Springer, 273-284.
17. Holst, C. K. 1991. Finiteness analysis. In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Number 523 in LNCS. Springer-Verlag, 473-495.
18. Jørgensen, J. and Leuschel, M. 1996. Efficiently generating efficient generating extensions in Prolog. In Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, O. Danvy, R. Gluck, and P. Thiemann, Eds. Number 1110 in LNCS. Springer, 238-262.
19. Kanamori, T. and Kawamura, T. 1993. OLDT-based abstract interpretation. Journal of Log. Program. 15, 1 & 2 (Jan.), 1-30.
20. Leuschel, M., Martens, B., and Sagonas, K. 1997. Preserving termination of tabled logic programs while unfolding. In Proceedings of LOPSTR'97: Logic Program Synthesis and Transformation, N. Fuchs, Ed. Number 1463 in LNCS. Springer, 189-205.
21. Lloyd, J. 1987. Foundations of logic programming. Springer-Verlag.
22. Mogensen, T. and Bondorf, A. 1992. Logimix: A self-applicable partial evaluator for Prolog. In Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, K.-K. Lau and T. Clement, Eds. Springer-Verlag, 214-227.
23. Plümer, L. 1990. Termination proofs for logic programs. Number 446 in LNAI. Springer-Verlag.
24. Sagonas, K., Swift, T., and Warren, D. S. 1994. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data. ACM Press, 442-453.
25. Tamaki, H. and SATO, T. 1986. OLD Resolution with Tabulation. In Proceedings of the Third International Conference on Logic Programming. Number 225 in LNCS. Springer-Verlag, 84-98.
26. Verbaeten, S. and De Schreye, D. 1999. Termination analysis of tabled logic programs using mode and type information. In Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming (FLOPS), A. Middeldorp and T. Sato, Eds. Number 1722 in LNCS. Springer, 163-178.
27. Verbaeten, S. and De Schreye, D. 2000. Termination of simply moded well-typed programs under a tabled execution mechanism. Submitted to the Journal of Applicable Algebra in Engineering, Communication and Computing (AAECC).
28. Verbaeten, S., Sagonas, K., and De Schreye, D. 1999. Modular termination proofs for Prolog with tabling. In Proceedings of Principles and Pracice of Declarative Programming, G. Nadathur, Ed. Number 1702 in LNCS. Springer, 342-359.
29. Vieille, L. 1989. Recursive query processing: the power of logic. Theor. Comput. Sci. 69, 1, 1-53.
30. Warren, D. S. 1995. Programming the PTQ grammar in XSB. In Applications of Logic Databases, R. Ramakrishnan, Ed. Kluwer Academic Publishers, Chapter 10, 217-234.
31. Warren, D. S. 1998. Notes for “Programming in Tabled Prolog”. Early draft available at http://www.cs.sunysb.edu/~warren/.