Sciweavers

2609 search results - page 121 / 522
» Optimizing for parallelism and data locality
Sort
View
131
Voted
DCOSS
2011
Springer
14 years 14 days ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...
IPPS
2010
IEEE
14 years 10 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
TPDS
2008
101views more  TPDS 2008»
15 years 17 days ago
An Energy-Oriented Evaluation of Buffer Cache Algorithms Using Parallel I/O Workloads
Power consumption is an important issue for cluster supercomputers as it directly affects running cost and cooling requirements. This paper investigates the memory energy efficienc...
Jianhui Yue, Yifeng Zhu, Zhao Cai
SPAA
2003
ACM
15 years 6 months ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
107
Voted
MDM
2007
Springer
209views Communications» more  MDM 2007»
15 years 6 months ago
Parallelized Simulated Annealing for Model Updating in Ad-Hoc Wireless Sensing Networks
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...
Andrew T. Zimmerman, Jerome P. Lynch