Sciweavers

4177 search results - page 177 / 836
» On the Performance of Ant-based Clustering
Sort
View
CLUSTER
2008
IEEE
16 years 27 days ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
RTAS
2007
IEEE
16 years 21 days ago
Real-Time Divisible Load Scheduling for Cluster Computing
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...
HPCA
2002
IEEE
15 years 11 months ago
User-Level Communication in Cluster-Based Servers
Clusters of commodity computers are currently being used to provide the scalability required by severalpopular Internet services. In this paper we evaluate an efficient cluster-b...
Enrique V. Carrera, Srinath Rao, Liviu Iftode, Ric...
ISCAPDCS
2003
15 years 7 months ago
Efficient Data Allocation for a Cluster of Workstations
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky
IDA
2007
Springer
15 years 6 months ago
In search of deterministic methods for initializing K-means and Gaussian mixture clustering
The performance of K-means and Gaussian mixture model (GMM) clustering depends on the initial guess of partitions. Typically, clus∗ corresponding author 1
Ting Su, Jennifer G. Dy