Sciweavers

348 search results - page 8 / 70
» Distributed Approximation Algorithm for Resource Clustering
Sort
View
CCGRID
2005
IEEE
14 years 1 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
MOBIHOC
2002
ACM
14 years 7 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
ICPP
2008
IEEE
14 years 1 months ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
COLT
2007
Springer
14 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
HPDC
2000
IEEE
13 years 11 months ago
Performance Evaluation of a Firewall-Compliant Globus-based Wide-Area Cluster System
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
Yoshio Tanaka, Motonori Hirano, Mitsuhisa Sato, Hi...