First-class synchronization barriers (1996) [2 citations — 0 self]
|
Abstract:
Our purpose is to promote a second-class mechanism--- the synchronization barrier--- to a first-class value. We introduce the synchron, a novel synchronization mechanism that enables the coordination of a dynamically varying set of concurrent threads that share access to a first-class synchronization token. We demonstrate how synchrons can be used to modularly manage resources in cases where existing techniques are either inapplicable or non-modular. In particular, synchronized lazy aggregates enable the first spacee #cient aggregate data decomposition of a wide range of algorithms. We also introduce explicit-demand graph reduction, a new semantic framework that we have developed to describe concurrency and explain the meaning of a synchron rendezvous. 1
Citations
| 588 | Compiling with Continuations – Appel - 1992 |
| 155 | The call-by-need lambda calculus – Ariola, Felleisen, et al. - 1995 |
| 19 | and Arvind. Properties of a first-order functional language with sharing – Ariola - 1995 |
| 16 | Dataflow and eduction: Data-driven and demand-driven distributed computation – Ashcroft - 1986 |
| 6 | Semantics of barriers in a non-strict, implicitly-parallel language – Aditya, Arvind, et al. - 1995 |
| 1 | et al. Toward an intermediate language based on graph rewriting – Barendregt - 1987 |
