Logic of global synchrony

ACM Transactions on Programming Languages and Systems

Volumn 26, Issue 2, 2004, Pages 221-262

  Chen, Yifeng ^a   Sanders, J W ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Bulk synchronous parallelism; PRAM; Reactive programming

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; FORMAL LOGIC; PARALLEL PROCESSING SYSTEMS; SEMANTICS; SYNCHRONIZATION;

BULK-SYNCHRONOUS PARALLELISM; PARALLEL RANDOM-ACCESS MACHINE; REACTIVE PROGRAMMING;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 1842786452     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/973097.973098     Document Type: Article

References (27)

1. Abolhassan, F., Keller, J., and Paul, W. 1999. On the cost-effectiveness of PRAMs. Acta Informatica 36, 6, 463-487.
2. Blackburn, P., de Rijke, M., and Venema, Y. 2001. Modal Logic. Cambridge University Press, Cambridge, U.K.
3. Chandy, K. M. and Misra, J. 1988. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA.
4. Chen, Y. 2001. Formal methods for global synchrony. Ph.D. dissertation. Oxford University Computing Laboratory, Oxford, U.K.
5. Chen, Y. 2002. Generic composition. Form. Aspects Comput. 14, 2, 108-122.
6. Chen, Y. 2003. A fixpoint theory for non-monotonic parallelism. Theoret. Comput. Sci. 308, 1-3, 367-392.
7. Chen, Y. and Sanders, J. W. 2001. Logic of global synchrony. In 12th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 2154. Springer-Verlag, Berlin, Germany 487-501.
8. Cousot, P. and Cousot, R. 1979. Constructive versions of Tarski's fixedpoint theorems. Pacific J. Math. 82, 1, 43-57.
9. Dijkstra, E. 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J.
10. Dijkstra, E. 1978. Two starvation free solutions to a general exclusion problem. Unpublished Tech. Note EWD 625. Plataanstraat 5, 5671 Al Nuenen, The Netherlands.
11. Farrell, C. A. and Kieronska, D. H. 1996. Formal specification of parallel SIMD execution. Theoret. Comput. Sci. 169, 1, 39-65.
12. Fortune, S. and Wyllie, J. 1978. Parallelism in random access machines. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY 114-118.
13. Foster, I. 1995. Designing and Building Parallel Programs. Addison Wesley, Reading, MA.
14. Hill, J. M. D., et al. 1998. BSPlib: The BSP programming library. Parallel Comput. 24, 14, 1927-2148.
15. Hoare, C. A. R. 1985. Communicating Sequential Processes. Prentice Hall, Englewood Cliffs, NJ.
16. Hoare, C. A. R. and He, J. 1998. Unifying Theories of Programming. Prentice Hall, Englewood Cliffs NJ.
17. Inda, M. and Bisseling, R. 2001. A simple and efficient parallel FFT algorithm using the BSP model. Parallel Comput. 27, 14, 1847-1878.
18. Jones, C. 1983. Specification and design of parallel programs. In IFIP 9th World Congress. Kluwer Academic Publishers, Norwell, MA, 321-332.
19. Lamport, L. 1994. A temporal logic of actions. ACM Trans. Programm. Lang. Syst. 16, 3, 872-923.
20. Leppnnen, V. and Penttonen, M. 1995. Work-optimal simulation of PRAM models on meshes. Nordic J. Comput. 2, 1, 51-69.
21. McColl, W. F. 1996. Scalability, portability and predictability: The BSP approach to parallel programming. Fut. Gen. Comput. Syst. 12, 4, 265-272.
22. Milner, R. 1989. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ.
23. Nelson, G. 1989. A generalisation of Dijkstra's calculus. ACM Trans. Programm. Lang. Syst. 11, 4, 517-561.
24. Owicki, S. and Gries, D. 1976. An axiomatic proof technique for parallel programs I. Acta Informatica 6, 4, 319-340.
25. Saraswat, V., Rinard, M., and Panangaden, P. 1991. Semantic foundations of concurrent constraint programming. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, NY, 333-352.
26. Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285-309.
27. Valiant, L. 1990. A bridging model for parallel computation. Commun. ACM 33, 8, 103-111.