Sciweavers

4612 search results - page 564 / 923
» More Communications
Sort
View
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
16 years 1 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
MIDDLEWARE
2005
Springer
16 years 1 months ago
Distributed collaboration for event detection in wireless sensor networks
With the advancement of technology in micro-electronics and wireless communication, small miniature devices called sensor nodes can be used to perform various tasks by forming the...
A. V. U. Phani Kumar, Adi Mallikarjuna Reddy V, D....
SENSYS
2004
ACM
16 years 1 months ago
The dynamic behavior of a data dissemination protocol for network programming at scale
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
Jonathan W. Hui, David E. Culler
SIGCOMM
2004
ACM
16 years 1 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
INFOCOM
2003
IEEE
16 years 27 days ago
Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels
Abstract—The error patterns of a wireless digital communication channel can be described by looking at consecutively correct or erroneous bits (runs and bursts) and at the distri...
Andreas Köpke, Andreas Willig, Holger Karl