Sciweavers

455 search results - page 41 / 91
» Asynchronous and deterministic objects
Sort
View
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 1 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
CSL
1999
Springer
14 years 8 days ago
A Truly Concurrent Semantics for a Simple Parallel Programming Language
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Paul Gastin, Michael W. Mislove
IPPS
1998
IEEE
14 years 7 days ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
OPODIS
2007
13 years 9 months ago
Byzantine Consensus with Few Synchronous Links
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
Moumen Hamouma, Achour Mostéfaoui, Gilles T...
ISCAPDCS
2001
13 years 9 months ago
A Study of Parallel Monitoring Algorithm in ATM Network Admission Control
Admission control strategies play an important role in congestion control and in guaranteeing the quality of service in Asynchronous Transfer Mode (ATM) networks. Three categories...
Mansoor Alam, Carl Weisfelder, Min Song