Toward a definition of and linguistic support for partial quiescence

Authors:
Billy Yan-Kit Man;Hiu Ning (Angela) Chan;Andrew J. Gallagher;Appu S. Goundan;Aaron W. Keen;Ronald A. Olsson
Affiliations:
Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA;Computer Science Department, California Polytechnic State University, San Luis Obispo, CA;Department of Computer Science, University of California, Davis, Davis, CA
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 12
Cited 0

Detection of stable properties in distributed applications

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
An overview of the SR language and implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global quiescence detection based on credit distribution and recovery

Information Processing Letters
Process Groups and Group Communications: Classifications and Requirements

Computer
The SR programming language: concurrency in practice

The SR programming language: concurrency in practice
A partially deadlock-free typed process calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
A taxonomy of distributed termination detection algorithms

Journal of Systems and Software
What is a “good” encoding of guarded choice?

Information and Computation - Special issue on EXPRESS 1997
Distributed Termination

ACM Transactions on Programming Languages and Systems (TOPLAS)
GARLIC: generic Ada reusable library for interpartition communication

Proceedings of the conference on TRI-Ada '95: Ada's role in global markets: solutions for a changing complex world
Specification of Real-time Systems Using a Timed Automata Model with Shared Variables and Verification of Partial-Deadlock Freeness

ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
JR: Flexible distributed programming in an extended Java

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide global quiescence detection as a built-in feature so that programmers do not need to write special synchronization code to detect quiescence. This paper introduces partial quiescence (PQ), which generalizes quiescence detection to a specified part of a distributed computation. Partial quiescence is useful, for example, when two independent concurrent computations that both rely on global quiescence need to be combined into a single program. The paper describes how we have designed and implemented a PQ mechanism within an experimental version of the JR concurrent programming language. Our early results are promising qualitatively and quantitatively.