67 search results - page 1 / 14 » Contention-free Complexity of Shared Memory Algorithms |
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and c...
PODC
1994
ACM
13 years 8 months ago
1994
ACM
STOC
1993
ACM
13 years 8 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
OPODIS
2003
13 years 6 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...