Toward a Definition of and Linguistic Support for Partial Quiescence

Man, Billy Yan-Kit; Chan, Hiu Ning; Gallagher, A. J.; Goundan, Appu S.; Keen, Aaron W.; Olsson, Ronald A.

doi:10.1007/11823285_68

Cited by 2 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 12 illustrates the overall structure of process groups in this tennis tournament example. The code for this program appears in 17.…”

Section: Jr Extended For Partial Quiescencementioning

confidence: 99%

“…The anonymous referees for the Euro‐Par 2006 conference provided thoughtful comments on an earlier version of this paper (Reference 1). The anonymous referees for CCP&E offered very helpful suggestions too.…”

Section: Acknowledgementsmentioning

confidence: 99%

“…If so, it will awaken the ‘idler’ thread to perform a final confirmation of idleness of all JRVMs and check that no messages are in transit, specifically: for each VM JRVM a , the number of sends from JRVM a to each other JRVM, JRVM b , matches the number of receives from JRVM a reported by JRVM b , If so, then the system is globally quiescent. Additional information about the GQ implementation appears in 17.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A definition of and linguistic support for partial quiescence

Man

Chan

Gallagher

et al. 2007

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

The global quiescence (GQ) of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide GQ 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. PQ is useful, for example, when two independent concurrent computations that both rely on GQ 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, and have gained experience with several representative applications. Our early results are promising qualitatively and quantitatively.deadlocked. This quiescence problem is challenging because each process has only local information, but to solve the problem requires information about all processes (i.e. global state information). More formally, global quiescence (GQ) is defined as the state in which each process has terminated or deadlocked and there are no messages in the communication channels [2]. Quiescence detection, then, is the mechanism used to detect such a state in a distributed system. Many solutions to this problem have been proposed (e.g. [3][4][5][6][7][8]).Some programming languages and systems provide GQ detection as a built-in feature. That is, programmers do not need to write special synchronization code to detect quiescence. Instead, they can focus on writing application code. When quiescence is reached, the program can perform various actions such as simply terminating the program, outputting final results, gathering statistics from the overall computation, or initiating a new phase of the program, which might involve a new, corresponding phase of quiescence detection.Although useful, GQ is limited to dealing with the state of all processes in a program. A more general, but more difficult to detect, property would define when a specified part of the program has become quiescent. For example, suppose we have two programs that use GQ and we want to combine them into a single program in which we want to perform different actions when each part of it becomes quiescent. This motivation led us to explore partial quiescence (PQ).This paper proposes possible ways of defining PQ. It then discusses the particular definition selected and implemented in an experimental version of the JR concurrent programming language.(JR extends Java [9] with a richer concurrency model [10][11][12].) The definition of PQ and its implementation in JR apply to truly distributed programs. The paper also shows how PQ leads to a different programming style for some problems. We compare the performance of using PQ detection and GQ detection. PQ might be a useful feature for other languages and libraries that define process or thread groups, as many do, and especially useful for those languages and libraries that alre...

show abstract

“…Figure 12 illustrates the overall structure of process groups in this tennis tournament example. The code for this program appears in 17.…”

Section: Jr Extended For Partial Quiescencementioning

confidence: 99%

Section: Acknowledgementsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation