124 search results - page 8 / 25 » Dynamic Function Placement for Data-Intensive Cluster Comput... |
146
click to vote
WOMPAT
2001
Springer
15 years 8 months ago
2001
Springer
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
147
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
137
click to vote
CCGRID
2006
IEEE
15 years 10 months ago
2006
IEEE
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
123
click to vote
CCGRID
2007
IEEE
15 years 10 months ago
2007
IEEE
Maximizing resource provider profit and satisfying user requirements at the same time is a challenging problem in utility computing environments. In this paper, we introduce adap...
125
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Minimizing the energy cost and improving thermal performance of power-limited datacenters, deploying large computing clusters, are the key issues towards optimizing the...