Generalized committed choice

Authors:
Joxan Jaffar;Roland H. C. Yap;Kenny Q. Zhu
Affiliations:
School of Computing, National University of Singapore;School of Computing, National University of Singapore;Department of Computer Science, Princeton University
Venue:
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Year:
2007

Citing 16
Cited 0

Communicating sequential processes

Communicating sequential processes
Occam—A programming language for multiprocessor systems

Computer Languages
Sagas

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Organizing long-running activities with triggers and transactions

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Concurrent constraint programming

Concurrent constraint programming
A calculus of mobile processes, II

Information and Computation
Transaction logic programming

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Database management systems

Database management systems
Parallel, object-oriented, and active knowledge base systems

Parallel, object-oriented, and active knowledge base systems
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Discipline of Programming

A Discipline of Programming
Composable memory transactions

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Indexing for Dynamic Abstract Regions

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Transactional events

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Coordination of many agents

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations from different alternatives to occur concurrently and later commit to one of them. GCC generalizes the traditional committed choice in Dijkstra's Guarded Command Language to handle don't know non-determinism and also allows for speculative computation. The main contribution of the paper is to introduce the GCC programming construct and the associated semantics framework for formalizing GCC. We give some experimental results which show that the power of GCC can be made practical.