Sciweavers

197 search results - page 26 / 40
» Robust Parallel Computations through Randomization
Sort
View
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
P2P
2007
IEEE
132views Communications» more  P2P 2007»
15 years 3 months ago
The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
CCGRID
2010
IEEE
14 years 9 months ago
Discovering Piecewise Linear Models of Grid Workload
—Despite extensive research focused on enabling QoS for grid users through economic and intelligent resource provisioning, no consensus has emerged on the most promising strategi...
Tamás Éltetö, Cécile Ger...
SPAA
2005
ACM
15 years 3 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
IPPS
2002
IEEE
15 years 2 months ago
Cluster Load Balancing for Fine-Grain Network Services
This paper studies cluster load balancing policies and system support for fine-grain network services. Load balancing on a cluster of machines has been studied extensively in the...
Kai Shen, Tao Yang, Lingkun Chu