2556 search results - page 210 / 512 » Clustering processes |
149
Voted
CCGRID
2010
IEEE
15 years 2 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
158
click to vote
TALG
2010
14 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
141
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
140
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present a cost-effective, high bandwidth server I/O network architecture, named PaScal (Parallel and Scalable). We use the PaScal server I/O network to support da...
139
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...