Technique for increasing the number of persistent...

Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

06988220

ABSTRACT:
An on-disk storage arrangement increases the number of persistent consistency point images (PCPIs) that may be maintained for a volume of a storage system. The on-disk storage arrangement comprises a novel volume information (volinfo) block representing a root of the volume; the volinfo block is stored at predefined locations on disk and comprises various system wide configuration data. The volinfo block further comprises a data structure configured to provide a level of indirection that increases the number of PCPIs maintainable by a file system executing on the storage system. To that end, the data structure may be organized as an array of pointers, wherein each pointer references a block containing a snapshot root, thereby enabling efficient access to each PCPI maintained by the file system.

REFERENCES:
patent: 4570217 (1986-02-01), Allen et al.
patent: 5163131 (1992-11-01), Row et al.
patent: 5202979 (1993-04-01), Hillis et al.
patent: 5278979 (1994-01-01), Foster et al.
patent: 5963962 (1999-10-01), Hitz et al.
patent: 6721764 (2004-04-01), Hitz et al.
patent: 6728922 (2004-04-01), Sundaram et al.
patent: 2003/0182317 (2003-09-01), Kahn et al.
patent: 2004/0260673 (2004-12-01), Hitz et al.
Akyurek, Sedat,Placing Replicated Data to Reduce Seek Delays, Department of Computer Science, University of Maryland, UMIACS-TR-91-121, CS-TR-2746, Aug. 1991.
Bitton, Dina,Disk Shadowing, Proceedings of the 14thVLDB Conference, LA, CA 1988.
Chaudhuri, Surajit, et al.,Self-Tuning Technology in Microsoft SQL Server, Data Engineering Journal 22, 2 1999, pp. 20-27.
Chutani, Sailesh, et al.,The Episode File System, In Proceedings of the USENIX Winter 1992.
Coyne, Robert A., et al.,Storage Systems for National Information Assets, Proc. Supercomputing 92, Minneapolis, Nov. 1992, pp. 626-633.
Finlayson, Ross S., et al.,Log Files: An Extended File Service Exploiting Write-Once StorageDepartment of Computer Science, Stanford University, Report No. STAN-CS-87-1177, Sep. 1987.
Gray, Jim, et al.,The Recovery Manager of the System R Database Manager, ACM Computing Surveys, 13(2:223-242 1981.
Hecht, Matthew S., et al.,Shadowed Management of Free Disk Pages with a Linked List, ACM Transactions on Database Systems, 8/4, Dec. 1983, pp. 503-514.
Howard, John, et al.,Scale and Performance in a Distributed File System, Carnegie Mellon University, CMU-ITC-87-068, Aug. 1987.
Howard, John H.,An Overview of the Andrew File System, Carnegie Mellon University, CMU-ITC-88-062 1988.
Howard, John, H. et al.,Scale and Performance in a Distributed File System, ACM Trans. Computer System, 6(1), Feb. 1988 pp. 51-81.
Kazar, Michael Leon,Synchronization and Caching Issues in the Andrew File System, Carnegie Mellon University, CMU-ITC-88-063.
Kazar, Michael L., et al.,DEcorum File System Architectural Overview, USENIX Summer Conference, Anaheim, California, 1990.
Kemper, Alfons, et al.,Performance Tuning for SAP R/3, Data Engineering Journal 22, 2 1999 pp. 33-40.
Kent, Jack et al.,Optimizing Shadow Recovery Algorithms, IEEE Transactioins on Software Engineering, 14(2): 155-168, Feb. 1988.
Kistler, et al.,Disconnected Operation in the Code File System, ACM Transactions on Computer Systems, ACM Transactions on Computer Systems, vol. 10, No. 1, Feb. 1992, pp. 3-25.
Lorie, Raymond, A.Physical Integrity in a Large Segmented Database, ACM Trans. Database Syst., vol. 2, Mar. 1977, pp. 91-104.
Ousterhout, John et al.,Beating the I/O Bottleneck: A Case for Log-Structured File Systems, Technical Report, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley, Oct. 30, 1988.
Patterson, D., et al.,A Case for Redundant Arrays of Inexpensive Disks (RAID), Technical Report, CSD-87-391, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley 1987.
Patterson, D., et al.,A Case for Redundant Arrays of Inexpensive Disks (RAID), SIGMOD International Conference on Management of Data, Chicago, IL, USA, Jun. 1-3, 1988, SIGMOD RECORD 17(3): 109-16 Sep. 1988.
Peterson, Zachary Nathaniel Joseph,Data Placement for Copy-on-Write Using Virtual Contiguity, University of CA, Santa Cruz, Master's Thesis for the Department of Science in Computer Science, Sep. 2002.
Quinlan, Sean,A Cached WORM File System, Software-Practice and Experience, 21(12):1289-1299 1991.
Rosenblum, Mendel, et al.,The LFS Storage Manager, Computer Science Division, Electrical Engineering And Computer Sciences, Univ. of CA, presented at Summer '90 USENIX Technical Conference, Anaheim, CA Jun. 1990.
Rosenblum, Mendel, et al.,The Design and Implementation of a Log-Structured File SystemJul. 24, 1991 pp. 1-15.
Rosenblum, Mendel,The Design and Implementation of Log-Structured File System, 1992 pp. 1-93.
Rosenblum, Mendel, et al.,The Design and Implementation of a Log-Structured File System, In Proceedings of ACM Transactions on Computer Systems, (10)1:26-52, Feb. 1992.
Schiefer, Berni, et al.,DB2 Universal Database Performance Tuning, Data Engineering Journal 22, 2 1999 pp. 12-19.
Seltzer, Margo I., et al.,Journaling Versus Soft Updates: Asynchronous Meta-Data Protection in File Systems, Proceedings of 200 USENIX Annual Technical Conference, 6/18-23/2000.
Shasha, Dennis,Tuning Time Series Queries in Finance: Case Studies and Recommendations, Data Engineering Journal 22, 2 1999 pp. 41-47.
Sidebotham, Bob,Volumes: The Andrew File System Data Structuring Primitive, EEUG Conference Proceedings, Manchester, UK, Autumn 1986.
Subramanian, Muralidhar, et al.,Performance Challenges in Object-Relational DBMSs, Data Engineering Journal 22, 2 1999 pp. 28-32.
Weikum, Gerhard, et al.,Towards Self-Tuning Memory Management for Data Servers, Data Engineering Journal 22, 2 1999 pp. 3-11
West, Michael, et al.,The ITC Distributed File System: Prototype and Experience, Carnegie-Mellon University, Technical Report CMU-ITC-040, Mar. 1985.
Zayas, Edward R., AFS-3 Programmer's Reference: Architectural Overview, Transarc Corporation, Pittsburgh, pa, 1.0 edition of Sep. 2, 1991.
Kazar Michael L., et al., “DEcorum File System Architectural Overview”, USENIX Conference, Summer 1990.
Chen, Peter M., et al, “An Evaluation of Redundant Arrays of Disks Using an Amdahl 5890”, Computer Science Division, University of California, Berkeley, 1989.
Howard, John H., “Scale and Performance in a Distributed File System”, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 51-81.
Howard, John H., “An Overview of the Andrew File System”, Information Technology Center, Carnegie Mellon University, 1988, pp. 1-6.
Bitton, Dina, et al., “Disk Shadowing”, Proceedings of the 14th VLDB Conference, Los Angeles, California 1988, pp. 331-338.
Sidebotham, Bob, “Volumes: The Andrew File System Data Structuring Primitive”, EUUG Conference Proceedings, Manchester, UK, Autumn 1986.
David A. Patterson et al., “A Case for Redundant Arrays of Inexpensive Disks (RAID)”Computer Science Division, University of California, 1998.
Brian Pawlowski et al., “Multi-Protocol Storage Appliance That Provides Integrated Support for File and Block Access Protocols”, U.S. Patent Application Ser. No. 10/215,917 filed on Aug. 9, 2002.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Technique for increasing the number of persistent... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Technique for increasing the number of persistent..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for increasing the number of persistent... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3585710

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.