Data storage using disk drives in accordance with a schedule...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S151000, C711S163000

Reexamination Certificate

active

07734867

ABSTRACT:
Techniques for data storage using disk drives. To conserve power and reduce heat generation so that higher packaging density is possible, only some of the disk drives in an array may be powered on at any one time. Disk accesses may then be scheduled so that appropriate drives are powered on and off at appropriate times. In addition, various levels of storage services may be provided depending, for example, upon how accessible the drives are to individual clients and upon a level of data redundancy provided. Another advantage includes off-loading of tasks to a controller or processor included within the disk drives themselves. For example, the disk drives themselves may compute error detection or error correction representations and perform data integrity checks based on those representations. Failure simulation may also be performed to verify the ability to recover lost data and the disk drives may be used to convert the data into general formats that may be expected to be more easily read in the future.

REFERENCES:
patent: 5461266 (1995-10-01), Koreeda et al.
patent: 5659704 (1997-08-01), Burkes et al.
patent: 5664143 (1997-09-01), Olbrich
patent: 5687390 (1997-11-01), McMillan, Jr.
patent: 5694581 (1997-12-01), Cheng
patent: 5954822 (1999-09-01), Yashiro et al.
patent: 6021464 (2000-02-01), Yao et al.
patent: 6092114 (2000-07-01), Shaffer et al.
patent: 6480904 (2002-11-01), Kato et al.
patent: 6704838 (2004-03-01), Anderson
patent: 2001/0047412 (2001-11-01), Weinman, Jr.
patent: 2003/0135609 (2003-07-01), Carlson et al.
patent: 2003/0187972 (2003-10-01), Bauchot
patent: 2004/0243761 (2004-12-01), Bohrer et al.
C. Waldspurger and W. Weihl, “Lottery Scheduling: Flexible Proportional-Share Resource Management,” Proc. of the First USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 1-11, Nov. 1994.
R. Hagmann, “Reimplementing the Cedar File System Using Logging and Group Commit,” Proc. of Symp. on Operating Systems Principles, pp. 155-162, Nov. 1987.
R. Henderson, A. Poston, “MSS-II and RASH: A Mainframe UNIX Based Mass Storage System with a Rapid Access Storage Hierarchy File Management System,” pp. 65-84, Usenix, Winter 1989.
A. Chervenak, V. Vellanki and Z. Kurmas. “Protecting file systems: a survey of backup techniques,” Proc. of Mass Storage Symp., 1998.
J. Douceur and W. Bolosky. “A large-scale study of file-system contents,” Proc. of Sigmetrics 1999, pp. 59-69, May 1999.
J. Gray and P. Shenoy. “Rules of thumb in data engineering.” Proc. of International Conference on Data Engineering, Feb. 2000.
R. Green, A. Baird and C. Davies. “Designing a Fast, On-line Backup System for a Log-structured File System,” Digital Technical Journal, Oct. 1996.
D. Hitz, J. Lau, M. Malcolm. “File System Design for an NFS File Server Appliance,” Proc. of Winter USENIX Technical Conference, pp. 235-246, Jan. 1994.
J. Johnson and W. Laing. “Overview of the Spiralog File System,” Digital Technical Journal, 8(2):5-14,1996.
S. Lammert. “The AFS 3.0 Backup System,” USENIX Proceedings of the 4th Conference on Large Installation System Administration, pp. 143-147, Oct. 1990.
E. Lee and C. Thekkath. “Petal: Distributed Virtual Disks,” Proc. of Conference on Architectual Support for Programming Languages and Operating Systems (ASPLOS-VII), pp. 84-92, Oct. 1996.
R. Pike, D. Presotto, S. Dorward, B. Flandrena, K. Thompson, H. Trickey, P. Winterbottom. “Plan 9 from Bell Labs,” Proc. of United Kingdom UNIX Systems User Group (UKUUG), pp. 1-9, Jul. 1990.
D. Santry, M. Feeley, N. Hutchinson, A. Veitch, R. Carton, J. Ofir. “Deciding when to forget in the Elephant file system,” Proc. of the 17th Symp. on Operating Systems Principles (SOSP-17), pp. 110-123, Dec. 1999.
P. Lyman , H. Varian, J. Dunn, A, Strygin, and K. Swearingen. “How much information?” www.simsberkley.edu/how-much-information/. Downloaded Apr. 4, 2001. Copyright 2000.
E. Anderson, D. Patterson. “A Retrospective on Twelve Years of LISA Proceedings,” Proceedings of LISA '99: 13th Systems Administration Conference, pp. 95-108, Nov. 1999.
“Network Appliance Announces NearStore TM Family to Address Enterprise Need for Business Continuance,” http://www.netapp.com
ews/press/2001
ews—rel—20011210a.html, Network Appliance, Dec. 10, 2001.
D. Colarelli, D. Grunwald, and M. Neufeld. “The Case for Massive Arrays of Idle Disks (MAID),” Depart. of Computer Science, Univ. of Colorado, Boulder, Jan. 7, 2002.
E. Miller, R. Katz. “An Analysis of File Migration in a Unix Supercomputing Environment,” 1993 Winter USENIX, Jan. 1993.
R. Pike, D. Presotto, S. Dorward, B. Flandrena, K. Thompson, H. Trickey, P. Winterbottom. “Plan 9 From Bell Labs,” Computing Systems, vol. 8 #3, Summer 1995, pp. 221-254.

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

Data storage using disk drives in accordance with a schedule... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data storage using disk drives in accordance with a schedule..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data storage using disk drives in accordance with a schedule... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4154483

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