Sciweavers

6939 search results - page 735 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
CONCUR
2008
Springer
15 years 9 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
CLUSTER
2002
IEEE
15 years 7 months ago
Energy-Efficient Multicasting of Session Traffic in Bandwidth- and Transceiver-Limited Wireless Networks
In this paper, we address the impact of resource limitations on the operation and performance of the broadcasting and multicasting schemes developed for infrastructureless wireless...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
247
Voted
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 7 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
PPOPP
2012
ACM
14 years 3 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
HPDC
2008
IEEE
16 years 1 months ago
FaTLease: scalable fault-tolerant lease negotiation with paxos
A lease is a token which grants its owner exclusive access to a resource for a defined span of time. In order to be able to tolerate failures, leases need to be coordinated by di...
Felix Hupfeld, Björn Kolbeck, Jan Stender, Mi...