The research of the distributed stripped storage spatial model

ABSTRACT

This paper presents an efficient method for finding optimized striped storage policy, abstracts and defines performance parameters to describe stripped policy according to basic requirement of distributed backup, and deduces performance evaluation formula upon several spatial storage model, describes the storage model with polyhedron, and researches the performance of various storage policy upon tetrahedron and hexahedron storage model and finds the optimized one.

REFERENCES

• 1: Cabrera, L.-F. and Long, D. D. E.(1991). Swift: Using distributed disk striping to provide high I/O data rate. Computing System, 4(4):405--436.
• 2: Scott Atchley, Stephen Soltesz, James S. Plank, Micah Beck and Terry Moore, Fault-Tolerance in the Network Storage Stack, Proceedings of the FAST 2002 Conference, Monterey, California, USA, January 28-30, 2002, 3--5.
• 3: Darrell D. E. Long , Bruce R. Montague , Luis-Felipe Cabrera, Swift/RAID: a distributed RAID system, Computing Systems, v.7 n.3, p.333-359, Summer 1994
• 4: Pei Cao , Swee Boon Lin , Shivakumar Venkataraman , John Wilkes, The TickerTAIP parallel RAID architecture, ACM Transactions on Computer Systems (TOCS), v.12 n.3, p.236-269, Aug. 1994 [doi>10.1145/185514.185517]
• 5: André Brinkmann , Kay Salzwedel , Christian Scheideler, Efficient, distributed data placement strategies for storage area networks (extended abstract), Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, p.119-128, July 09-13, 2000, Bar Harbor, Maine, United States [doi>10.1145/341800.341815]

INDEX TERMS

Keywords:
backup, distributed, spatial model, striped storage