E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch, "Hippodrome: running circles around storage administration," in Conference on File and Storage Technologies. USENIX Association, 2002, pp. 175--188. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Storage Embedded Networks (SEN) and Adaptive Caching Using Multiple .. - Ari (2003) (Correct)
.... [8] Recent research shows that these filtering effects [8] in a hierarchy of caches can change the nature of an otherwise predictable workload such that the higher layers are effectively useless [102, 27] In these complex scenarios analytical modeling is daunting, manual tuning is tedious [14] and making wrong decisions has extreme monetary and performance costs. Our machine learning based adaptive caching scheme (ACME) is motivated by these challenges of making caching decisions within complex systems in real time and under dynamic conditions. We consider all previous cache ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
Evaluation of Object Placement Techniques in a.. - Goyal, Radkov, Shenoy (Correct)
....algorithms that determine object placement, and thus the performance, are crucial to the success of a policymanaged storage system. Object placement techniques for large storage systems have been extensively studied in the last decade, most notably in the context of disks arrays such as RAID [4, 8, 9, 10, 21]. Most of these approaches are based on striping a technique that interleaves the placement of objects onto disks and can be classified into two fundamentally different categories. Techniques in the first category require a priori knowledge of the workload and use either analytical or ....
....of objects onto disks and can be classified into two fundamentally different categories. Techniques in the first category require a priori knowledge of the workload and use either analytical or empirically derived models to determine an optimal placement of objects onto the storage system [4, 8, 21]. An optimal placement is one that balances the load across disks, minimizes the response time of individual requests and maximizes the throughput of the system. Since requests accessing independent stores can interfere with one another, these placement techniques often employ narrow ....
[Article contains additional citation context not shown here]
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles Around Storage Administration. In Proceedings of the Usenix Conference on File and Storage Technology (FAST'02), Monterey, CA, pages 175--188, January 2002.
An Observation-based Approach Towards Self-managing Web.. - Prashant Pradhan Renu (2002) (13 citations) (Correct)
....choose the appropriate resource to adapt with changes in the type of workload, and to trigger the appropriate local adaptation to meet per class response time goals. 6 Related Work Several approaches for self managing systems have been proposed in the literature in the context of storage systems [6, 22, 27], general operating systems [25] network services [11] etc. Our focus is to design adaptive techniques to make web servers self managing while providing QoS guarantees to various customer classes. 17 0.05 0.1 0.15 0.2 0.25 0.3 Class 0 Class 1 0 0.05 0.1 0.15 0.2 0.25 0.3 (ms) ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
A Practical Learning-based Approach for Dynamic Storage.. - Sundaram, Shenoy (2003) (3 citations) (Correct)
.... of storage systems, techniques for designing self managing storage have been studied in [2, 4] The design of such systems involves several sub tasks and issues such self configuration [2, 4] capacity planning [8] automatic RAID level selection [5] initial storage system configuration [3], SAN fabric design [21] and on line data migration [12] have been studied. These efforts are complementary to our work which focuses on automatic storage bandwidth allocation to applications with varying workloads. Dynamic bandwidth allocation for multimedia servers has been studied in [19] ....
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: running circles around storage administration. In Conference on File and Storage Technology (FAST'02), Monterey, CA, pp. 175-188, January 2002.
An Online Optimization-based Technique for Dynamic.. - Chandra, Gong, Shenoy (2002) (1 citation) (Correct)
....prediction and dynamic resource allocation techniques in meeting the QoS requirements of application in the presence of varying workloads. V. RELATED WORK Several research efforts have focused on the design of adaptive systems that can react to workload changes in the context of storage systems [3], 20] general operating systems [26] network services [7] web servers [5] 19] 24] 9] 11] and Internet data centers [2] 25] In this paper, we focused on an abstract model of a server resource with multiple class specific queues and presented analytic techniques for dynamic resource ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
An Online Optimization-based Technique for Dynamic.. - Chandra, Gong, Shenoy (2002) (1 citation) (Correct)
....prediction and dynamic resource allocation techniques in meeting the QoS requirements of application in the presence of varying workloads. V. RELATED WORK Several research efforts have focused on the design of adaptive systems that can react to workload changes in the context of storage systems [3], 20] general operating systems [26] network services [7] web servers [5] 19] 24] 9] 11] and Internet data centers [2] 25] In this paper, we focused on an abstract model of a server resource with multiple class specific queues and presented analytic techniques for dynamic resource ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
CacheCOW: QoS for Storage System Caches - Goyal, Jadav, Modha, Tewari (2003) (4 citations) (Correct)
....to be managed. Techniques for allocating CPU, network, and disk bandwidth have been investigated in the literature for web servers and other applications and can potentially be applied to storage systems. Also, techniques for automated pro visioning and load balancing have been investigated in [2]. However, techniques for allocating cache space, which is an important factor in storage system performance, to provide QoS differentiation have not been adequately investigated and are the focus of this paper. Caches differ fundamentally from other resources such as CPU and network bandwidth in ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proc. Usenix Conf. File and Storage Technology (FAST'02), Monterey, CA, pages 175-188, January 2002.
Facade: Virtual Storage Devices With Performance Guarantees - Lumb, Merchant, Alvarez (2003) (5 citations) (Correct)
....area network, including SANsymphony from DataCore Software [19] lPstore from FalconStor software [ 16] and the StorageApps sv3000 virtualization appliance [ 14] none of them, however, provide performance guarantees for applications. Automatic system design tools like Minerva [1] and Hippodrome [2] build systems that satisfy declarative, user specified QoS requirements. They effectively minimize overprovisioning by taking into account workload correlations and detailed de vice capabilities to design device configuration and data layouts. The whole storage system may be redesigned in every ....
....allocates storage for each workload on the storage device and ensures that the device has adequate capacity and bandwidth to meet the aggregate demands of the workloads assigned to it. This allocation may be changed periodically to meet changing workload requirements and device configurations [2]; however, such reallocation occurs on a time scale of hours to weeks. Faqade manages device resources in time scale of milliseconds, to enable SLO compliant per Workload Specs Workload (SLO) Capacity Planning SLO Fa9ade Allocate aScagaln II Os Stores I StorageDevices Storage ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administrators. In Conference on File and Storage Technologies (FAST), (Monterey, CA), pages 175 188. USENIX, January 2002.
A Utility-Centered Approach to Building Dependable.. - Candea, Fox (2002) (2 citations) (Correct)
....valuable tradeoffs that were overlooked, thus guiding the designer in choosing neighboring points to explore. 6.3. Dynamic Runtime Tradeoffs Unpredictable workload is the norm in large scale infrastructures, and over provisioning to handle all possible load spikes is most of the time too costly [3]; fast dynamic tradeoffs are therefore required. Some, like the public telephone system, trade availability for quality by blocking the initiation of calls in overload situations. Others, such as CNN.com, reduce richness of web pages to keep availability constant during high load periods [16] We ....
....intend to peruse in our future work. Value analysis [18] is a 5 well established engineering technique that provides a disciplined, step by step approach to identifying and removing unnecessary cost in product and service design a similar approach to what we are trying to develop. Hippodrome [3] employed an iterative design process to configure storage systems, similar in spirit to what we described here. 6] used a utility function approach for energy and server resources in large data centers. Extensive work has also been done in identifying and making pairwise tradeoffs in systems; ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proceedings of the Conference on File and Storage Technologies (FAST-02), pages 175--188, Monterey, CA, 2002.
An Online Evolutionary Approach to Developing Internet.. - Chen, Kiciman, Brewer (2002) (1 citation) (Correct)
....recognizes the existence of multiple feedback cycles in Internet service development and deployment. Several projects share our view in helping systems adapt and evolve online, with each focusing on a subset of the feedback loops we have identified in section 2. OceanStore [18] and Hippodrome [2] are storage systems with automated adaptation. Focusing on the workload and fault feedback loops, OceanStore adapts to changes in the system, such as server addition and removal, to minimize management overhead and maintain data persistence. Hippodrome closes the workload feedback loop by ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, , and A. Veitch. Hippodrome: running circles around storage administration. In Conference on File and Storage Technology. USENIX, 2002.
ACME: Adaptive Caching Using Multiple Experts - Ari, Amer, Gramacy, Miller.. (2002) (7 citations) (Correct)
.... effect [2] Recent research shows that these filtering effects in a hierarchy of caches can change the nature of an otherwise predictable workload such that the higher layers are effectively useless [32, 7] In these complex scenarios analytical modeling is daunting, manual tuning is tedious [3] and making wrong decisions has extreme monetary and performance costs. Some researchers and businesses predict that all caching systems will be useless due to the immense customization of web content by both the clients and the content providers. However, we believe that the dynamic part of the ....
ANDERSON, E., HOBBS, M., KEETON, K., SPENCE, S., UYSAL, M., AND VEITCH, A. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
An Online Evolutionary Approach to Developing Internet Services - Chen, Kcman, Brewer (2002) (1 citation) (Correct)
....recognizes the existence of multiple feedback cycles in Internet service development and deployment. Several projects share our view in helping systems adapt and evolve online, with each focusing on a subset of the feedback loops we have identified in section 2. OceanStore [18] and Hippodrome [2] are storage systems with automated adaptation. Focusing on the workload and fault feedback loops, OceanStore adapts to changes in the system, such as server addition and removal, to minimize management overhead and maintain data persistence. Hippodrome closes the workload feedback loop by ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, , and A. Veitch. Hippodrome: running circles around storage administration. In Conference on File and Storage Technology. USENIX, 2002.
Inducing Models of Black-Box Storage Arrays - Terence Kelly Ira (2004) (1 citation) Self-citation (Keeton) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In FAST, Jan. 2002. 13
Designing for Disasters - Kimberly Keeton Cipriano (2004) (2 citations) Self-citation (Keeton) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. Proc. File and Storage Technologies (FAST), pp. 175--188, January 2002.
Automatic Design of Dependable Data Storage Systems - Kimberly Keeton And (2003) (2 citations) Self-citation (Keeton) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, andA. Veitch. Hippodrome: running circles around storage administration. Proceedings of Conference on File and Storage Technologies (FAST), Monterey, CA, pages 175--188, January 2002.
Automating Data Dependability - Kimberly Keeton And (2002) (14 citations) Self-citation (Keeton) (Correct)
....the system, and adapt its implementation to unexpected changes such as increased failure rates for a component, get the storage system to do it. Figure 1 illustrates this automatic goal directed design process. We have successfully applied this methodology to performance related storage goals [1, 2, 3]. We believe the time is right to extend it to dependability. In particular, we concentrate on the reliability (whether the system discards, loses or corrupts data) and performability (whether the data can be accessed at a particular performance level at a given time) aspects of dependability ....
....the predicted behavior is realized and whether environmental failures occur as expected. adaptive management: the design tool, configuration tool, and solution monitoring tool can be used in concert to provide an iterative approach to adapt to changes in requirements or the environment [2]. 3 Specifications for automating data dependability In this section, we provide a brief overview of our approach s declarative specifications for user requirements, failures and data protection techniques. As described in [16] we believe it is necessary to distinguish between the following ....
[Article contains additional citation context not shown here]
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. "Hippodrome: running circles around storage administration," Proc. of the USENIX Conference on File and Storage Technologies (FAST) , January 2002, pp. 175 - 188.
Selecting RAID levels for disk arrays - Anderson, Swaminathan, Veitch, A. (2002) (11 citations) Self-citation (Anderson Veitch) (Correct)
....millions of dollars and represents more than half the total system hardware cost. Perhaps even more important is the uncertainty that surrounds a manually designed system: how well) will it meet its performance and availability goals We believe that automatic methods for storage system design [1, 5, 7, 4] can overcome these limitations, because they can consider a wider range of workload interactions, and explore a great deal more of the search space than any manual method. To do so, these automatic methods need to be able to make RAID level selection decisions, so the question arises: what is the ....
.... this, we run our solver to develop a design for a storage system, then implement that design, monitor it under load, analyze the result, and then re design the storage system if necessary, to meet changes in workload, available resources, or even simple mis estimates of the original requirements [4]. Our goal is to do this with no manual intervention at all we would like the storage system to be completely self managing. An important part of the solution is the ability to design configurations and data layouts for disk arrays automatically, which is where the work described in this paper ....
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In File and Storage Technologies Conference (FAST), Monterey, January 2002.
Informed Data Distribution Selection in a - Self-Predicting Storage System (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch, "Hippodrome: running circles around storage administration," in Conference on File and Storage Technologies. USENIX Association, 2002, pp. 175--188.
Modeling the Relative Fitness of Storage Devices - Michael Mesnier Intel (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: running circles around storage administration. Conference on File and Storage Technologies (Monterey, CA, 28--30 January 2002.
Informed Data Distribution Selection in a.. - Thereska.. (2006) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch, "Hippodrome: running circles around storage administration," in Conference on File and Storage Technologies. USENIX Association, 2002, pp. 175--188.
Performance Modeling of Storage Devices Using Machine Learning - Wang (2006) (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: Running circles around storage administration. In Proceedings of the 1st USENIX Conference on File And Storage Technologies (FAST'02), Monterey, CA, pages 175--188, January 2002.
Modeling the Relative Fitness of Storage Devices - Michael Mesnier Intel (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: running circles around storage administration. Conference on File and Storage Technologies (Monterey, CA, 28--30 January 2002.
A Quantitative Approach - Hakim Weatherspoon Byung-Gon (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proc. of USENIX File and Storage Technologies (FAST), January 2002.
Scheduling with QoS in Parallel I/O systems - Gulati, Varman (2004) (Correct)
No context found.
E. Anderson and et al. Hippodrome: running circles around storage administration. In File and Storage Technology (FAST'02), pages 175--188, January 2002.
CHAMELEON: a self-evolving, fully-adaptive.. - Uttamchandani.. (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: Running circles around storage administration. In Proc. of Symposium on File and Storage Technologies (FAST), pages 175--188, January 2002.
C-Miner: Mining Block Correlations in Storage Systems - Li, Chen, Srinivasan, Zhou (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the First USENIX Conference on File and Storage Technologies, 2002.
Using Time Travel to Diagnose Computer Problems - Andrew Whitaker Richard (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
Triage: Performance Isolation and Differentiation for.. - Karlsson, Karamanolis.. (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In International Conference on File and Storage Technologies (FAST), pages 175--188, Monterey, CA, January 2002.
Dynamic Resource Allocation for Shared Data Centers Using.. - Chandra, Gong, Shenoy (2003) (6 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
Evaluation of Object Placement Techniques in a - Policy-Managed Storage System (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proceedings of the Usenix Conference on File and Storage Technology (FAST'02), Monterey, CA, pages 175--188, January 2002.
Triage: Performance Isolation and Differentiation for.. - Karlsson, Karamanolis.. (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In International Conference on File and Storage Technologies (FAST), pages 175--188, Monterey, CA, January 2002. 19
SANBoost: Automated SAN-Level Caching in Storage Area Networks - Ari, Gottwals, Henze (2004) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
Triage: Performance Isolation and Differentiation for.. - Karlsson, Karamanolis.. (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In International Conference on File and Storage Technologies (FAST), pages 175--188, Monterey, CA, January 2002.
Using Statistical Correlation For Dependency Analysis Of Cache.. - Ari (2003) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
Issues and Challenges in the Performance Analysis of Real .. - Varki, Merchant, Xu, Qiu (2004) (4 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch, "Hippodrome: Running Circles around Storage Administration, " Proc. USENIX Conf. File and Storage Technologies (FAST), pp. 175-188 Jan. 2002.
Storage Embedded Networks (SEN) and Adaptive Caching Using Multiple .. - Ari (2003) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the 2002.
C-Miner: Mining Block Correlations in Storage Systems - Li, Chen, Srinivasan, Zhou (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Proceedings of the First USENIX Conference on File and Storage Technologies, 2002.
Self-* Storage: Brick-based storage with automated.. - Ganger, Strunk, Klosterman (2003) (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: running circles around storage administration. Conference on File and Storage Technologies (Monterey, CA, 28--30 January
Multi-Dimensional Storage Virtualization - Huang, Peng, Chiueh (2004) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. In Conference on File and Storage Technology (FAST'02), pages 175-188, Monterey, CA, January 2002.
Session State: Beyond Soft State - Benjamin Ling Emre (2004) (3 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running circles around storage administration. In Proc. Conference on File and Storage Technologies (FAST-02), pages 175--188, Monterey, CA, 2002.
Clotho: Transparent Data Versioning at the Block I/O Level - Flouris, Bilas (2004) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles Around Storage Administration. In Proceedings of the FAST '02 Conference on File and Storage Technologies (FAST-02), pages 175--188, Berkeley, CA, Jan. 28--30 2002. USENIX Association. 113
Session State: Beyond Soft State - Benjamin Ling Emre (2004) (3 citations) (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: Running circles around storage administration. In Proc. Conference on File and Storage Technologies (FAST-02), pages 175--188, Monterey, CA, 2002.
Self-* Storage: Brick-based storage with automated.. - Ganger, Strunk, Klosterman (2003) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. Conference on File and Storage Technologies (Monterey, CA, 28--30 January 2002.
Approximating Quality-of-Service Tradeoffs for Personalized.. - Broadwell, Ong (2003) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch, "Hippodrome: Running Circles Around Storage Administration," in Conference on File and Storage Technology (FAST), 2002.
Back to the Future: - Dependable Computing Dependable (Correct)
No context found.
Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, and Alistair Veitch. Hippodrome: Running Circles Around Storage Administration. In Conference on File and Storage Technology (FAST'02), January 2002.
Dynamic Resource Allocation for Shared Data Centers Using.. - Chandra, Gong, Shenoy (2002) (6 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
An Observation-based Approach Towards Self-managing Web.. - Prashant Pradhan Renu (2002) (13 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
Dynamic Resource Allocation for Shared Data Centers Using.. - Chandra, Gong, Shenoy (2002) (6 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
An Online Optimization-based Technique for Dynamic.. - Chandra, Gong, Shenoy (2002) (1 citation) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
Dynamic Resource Allocation for Shared Data Centers Using.. - Chandra, Gong, Shenoy (2002) (6 citations) (Correct)
No context found.
E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC