Sciweavers

506 search results - page 11 / 102
» Distributing synchronous programs using bounded queues
Sort
View
INFOCOM
1998
IEEE
13 years 11 months ago
On Adaptive Bandwidth Sharing with Rate Guarantees
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
Nick G. Duffield, T. V. Lakshman, Dimitrios Stilia...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 12 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
14 years 2 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt
ISORC
2002
IEEE
14 years 15 days ago
Real-Time Resource Reservation for Synchronized Multimedia Object over Wireless LAN
The increasing use of wireless networks has necessitated the development of a wireless networking infrastructure that supports quality of service (QoS) for multimedia communicatio...
Husni Fahmi, Mudassir Latif, Basit Shafiq, Raymond...
HPCA
2000
IEEE
13 years 12 months ago
Improving the Throughput of Synchronization by Insertion of Delays
Efficiency of synchronization mechanisms can limit the parallel performance of many shared-memory applications. In addition, the ever increasing performance gap between processor...
Ravi Rajwar, Alain Kägi, James R. Goodman