Sciweavers

592 search results - page 84 / 119
» Fairness and Channel Coordination
Sort
View
98
Voted
ICALP
1994
Springer
15 years 1 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
ATAL
2006
Springer
15 years 1 months ago
Behaviosites: a novel paradigm for affecting distributed behavior
In this paper we present the Behaviosite paradigm, a new approach to affecting the behavior of distributed agents in a multiagent system, which is inspired by biological parasites ...
Amit Shabtay, Zinovi Rabinovich, Jeffrey S. Rosens...
PODC
2010
ACM
14 years 9 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
JPDC
2006
111views more  JPDC 2006»
14 years 9 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
JSAC
2007
109views more  JSAC 2007»
14 years 9 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...