Sciweavers

15494 search results - page 200 / 3099
» Computing dynamic clusters
Sort
View
ACTAC
2002
102views more  ACTAC 2002»
15 years 6 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
SC
2004
ACM
15 years 11 months ago
Collaborative User-Centric Lambda-Grid over Wavelength-Routed Network
Emerging lambda-Grid systems employ wavelength-routed network with optical switches to enable dynamic on-demand lightpaths with multi-gigabit rate bandwidth to interconnect shared...
Oliver T. Yu, Thomas A. DeFanti
CCGRID
2009
IEEE
15 years 10 months ago
Failure-Aware Construction and Reconfiguration of Distributed Virtual Machines for High Availability Computing
In large-scale clusters and computational grids, component failures become norms instead of exceptions. Failure occurrence as well as its impact on system performance and operatio...
Song Fu
CLUSTER
2002
IEEE
15 years 11 months ago
Scalable Resource Management in High Performance Computers
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...
ICPR
2008
IEEE
16 years 7 months ago
Geodesic K-means clustering
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...
Arian Maleki, Nima Asgharbeygi