Sciweavers

1144 search results - page 173 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
IPPS
2007
IEEE
14 years 1 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
DC
2010
13 years 7 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride
INFOCOM
2010
IEEE
13 years 6 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
CLUSTER
2001
IEEE
13 years 11 months ago
Using Multirail Networks in High-Performance Clusters
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...
Salvador Coll, Eitan Frachtenberg, Fabrizio Petrin...