RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
A caching relay for the World Wide Web
Selected papers of the first conference on World-Wide Web
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Memory-based architecture for distributed WWW caching proxy
WWW7 Proceedings of the seventh international conference on World Wide Web 7
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Minerva: An automated resource provisioning tool for large-scale storage systems
ACM Transactions on Computer Systems (TOCS)
Optimal Data Placement on Disks: A Comprehensive Solution for Different Technologies
IEEE Transactions on Knowledge and Data Engineering
Design and development of data-intensive web sites: The Araneus approach
ACM Transactions on Internet Technology (TOIT)
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Conserving disk energy in network servers
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Characteristics of WWW Client-based Traces
Characteristics of WWW Client-based Traces
Replica placement in adaptive content distribution networks
Proceedings of the 2004 ACM symposium on Applied computing
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
Continuous Replica Placement schemes in distributed systems
Proceedings of the 19th annual international conference on Supercomputing
Proceedings of the twentieth ACM symposium on Operating systems principles
Quickly finding near-optimal storage designs
ACM Transactions on Computer Systems (TOCS)
The automatic improvement of locality in storage systems
ACM Transactions on Computer Systems (TOCS)
CRUSH: controlled, scalable, decentralized placement of replicated data
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
SEA: A Striping-Based Energy-Aware Strategy for Data Placement in RAID-Structured Storage Systems
IEEE Transactions on Computers
Object replication strategies in content distribution networks
Computer Communications
A dynamic and adaptive load balancing strategy for parallel file system with large-scale I/O servers
Journal of Parallel and Distributed Computing
SDS: a framework for scientific data services
PDSW '13 Proceedings of the 8th Parallel Data Storage Workshop
A three-phase energy-saving strategy for cloud storage systems
Journal of Systems and Software
MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
The problem of statically assigning nonpartitioned files in a parallel I/O system has been extensively investigated. A basic workload characteristic assumption of most existing solutions to the problem is that there exists a strong inverse correlation between file access frequency and file size. In other words, the most popular files are typically small in size, while the large files are relatively unpopular. Recent studies on the characteristics of Web proxy traces suggested, however, the correlation, if any, is so weak that it can be ignored. Hence, the following two questions arise naturally. First, can existing algorithms still perform well when the workload assumption does not hold? Second, if not, can one develop a new file assignment strategy that is immune to the workload assumption? To answer these questions, we first evaluate the performance of three well-known file assignment algorithms with and without the workload assumption, respectively. Next, we develop a novel static nonpartitioned file assignment strategy for parallel I/O systems, called static round-robin (SOR), which is immune to the workload assumption. Comprehensive experimental results show that SOR consistently improves the performance in terms of mean response time over the existing schemes.