Sciweavers

10 search results - page 2 / 2
» Counting Networks and Multi-Processor Coordination
Sort
View
ADHOCNOW
2007
Springer
13 years 11 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...
PIMRC
2008
IEEE
13 years 11 months ago
Understanding the Performance of 802.11 Networks
Abstract—In this paper, we review the most important performance characteristics of the 802.11 DCF wireless networks, point out some false common knowledge, and report on recent ...
Andrzej Duda
IMC
2009
ACM
13 years 12 months ago
Sampling biases in network path measurements and what to do about it
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
Srikanth Kandula, Ratul Mahajan
EUROPAR
2009
Springer
14 years 10 hour ago
PSINS: An Open Source Event Tracer and Execution Simulator for MPI Applications
The size of supercomputers in numbers of processors is growing exponentially. Today’s largest supercomputers have upwards of a hundred thousand processors and tomorrow’s may ha...
Mustafa M. Tikir, Michael Laurenzano, Laura Carrin...
SIROCCO
2000
13 years 6 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman