ACM Transactions on Computer Systems (TOCS)
Andrew: a distributed personal computing environment
Communications of the ACM - The MIT Press scientific computation series
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
An empirical study of a wide-area distributed file system
ACM Transactions on Computer Systems (TOCS)
Network attached storage architecture
Communications of the ACM
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
GPFS: A Shared-Disk File System for Large Computing Clusters
FAST '02 Proceedings of the Conference on File and Storage Technologies
A comparison of file system workloads
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
| Hi-index | 0.00 |
The object-based storage system, in which files are mapped onto one or more data objects stored on Object-Based Storage Devices (OSDs), has distributed storage system architecture. In such a system, the policy for object allocation is a critical aspect affecting the overall systems performance. Hashing and fragment-strip are two common techniques used for managing objects, but both have their disadvantages, and advantages, e.g. hashing achieves good workload balance and provide rather high effectiveness in allocating data, but it can not provide readily available parallelism for large file; fragment-strip takes full advantage device parallelism, simplifies the clients’ operations, but this policy is not fit for small file. In this paper, we present an efficient algorithm that combines the advantages of these two approaches while avoiding their shortcomings. The key factors which can impact the performance of the whole system in the objects allocation are also be discussed.