Sciweavers

411 search results - page 37 / 83
» Distributed algorithms for QoS load balancing
Sort
View
NBIS
2007
Springer
14 years 1 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
IPPS
1999
IEEE
13 years 12 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan
INFOCOM
2005
IEEE
14 years 1 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
HPDC
2002
IEEE
14 years 17 days ago
Distributed Computing with Load-Managed Active Storage
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
Rajiv Wickremesinghe, Jeffrey S. Chase, Jeffrey Sc...
IPPS
2002
IEEE
14 years 16 days ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...