Sciweavers

317 search results - page 16 / 64
» Snap-Stabilization in Message-Passing Systems
Sort
View
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 4 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
13 years 7 months ago
Exploring and exploiting routing opportunities in wireless ad-hoc networks
Abstract--In this paper, d-AdaptOR, a distributed opportunistic routing scheme for multi-hop wireless ad-hoc networks is proposed. The proposed scheme utilizes a reinforcement lear...
Abhijeet Bhorkar, Mohammad Naghshvar, Tara Javidi,...
AOSD
2007
ACM
14 years 1 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
VLSID
2003
IEEE
148views VLSI» more  VLSID 2003»
14 years 10 months ago
Extending Platform-Based Design to Network on Chip Systems
Exploitation of silicon capacity will require improvements in design productivity and more scalable system paradigms. Asynchronous message passing networks on chip (NOC) have been...
Juha-Pekka Soininen, Axel Jantsch, Martti Forsell,...
PVM
1999
Springer
14 years 2 months ago
Building MPI for Multi-Programming Systems Using Implicit Information
Abstract. With the growing importance of fast system area networks in the parallel community, it is becoming common for message passing programs to run in multi-programming environ...
Frederick C. Wong, Andrea C. Arpaci-Dusseau, David...