Name
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 space-efficient 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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1145/232627.232645 | Proceedings of the first ACM SIGPLAN international conference on Functional programming |
Keywords | Field | DocType |
polymorphism,type theory,subtyping | Synchronization,Programming language,Computer science,Concurrency,Data synchronization,Thread (computing),Theoretical computer science,Rendezvous,Graph reduction,Synchronization (computer science),Security token,Distributed computing | Conference |
Volume | Issue | ISSN |
31 | 6 | 0362-1340 |
ISBN | Citations | PageRank |
0-89791-770-7 | 3 | 0.39 |
References | Authors | |
19 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franklyn Turbak | 1 | 55 | 4.54 |