1370 search results - page 194 / 274 » Synchronization Transformations for Parallel Computing |
110
Voted
ECOOPW
1994
Springer
15 years 6 months ago
1994
Springer
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
116
Voted
REX
1993
15 years 6 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
106
Voted
ICPP
1990
IEEE
15 years 6 months ago
1990
IEEE
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
103
Voted
SPAA
1990
ACM
15 years 6 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
137
Voted
CONCUR
2007
Springer
15 years 6 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...