Sciweavers

3107 search results - page 506 / 622
» Parallel Communication
Sort
View
175
Voted
PODC
2006
ACM
16 years 2 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
168
Voted
SPAA
2006
ACM
16 years 2 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
168
Voted
ICDCS
2005
IEEE
15 years 11 months ago
Handling Asymmetry in Power Heterogeneous Ad Hoc Networks: A Cross Layer Approach
Power heterogeneous ad hoc networks are characterized by link layer asymmetry: the ability of lower power nodes to receive transmissions from higher power nodes but not vice versa...
Vasudev Shah, Srikanth V. Krishnamurthy
165
Voted
IPPS
2005
IEEE
15 years 11 months ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein
SPAA
2005
ACM
15 years 11 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...