1091 search results - page 9 / 219 » Approximation Algorithms for Data Placement Problems |
MASCOTS
2001
13 years 9 months ago
2001
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
STACS
2001
Springer
14 years 2 days ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...