Accessing data storage systems without waiting for read errors

Details Accessing data storage systems without waiting for read errors Accessing data storage systems without waiting for read errors

2007-03-05

2010-10-26

Kim, Hong (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Specific memory composition

C711S154000, C714S006130

Reexamination Certificate

active

07822922

ABSTRACT:
Improved techniques for accessing data storage systems are disclosed. These techniques detect, correct and prevent undesirable access delays experienced in storage systems. “Slow-access” refers to an access operation that does not successfully complete within a predetermined amount of time. When slow-access is detected, an attempt is made to provide data by other means rather than waiting for the access operation to eventually complete. By way of example, parity information is used to generate data rather than waiting beyond a predetermined amount of time for a “slow-read” operation to complete. In addition, preventative measures can be taken to avoid reoccurrence of a “slow-access” operating once it has been identified. These preventative measures, for example, include rewriting the same data to the same data section that caused the slow-access problem or remapping the section to another section in order to avoid the same section of data to cause another slow access problem.

REFERENCES:
patent: 4467419 (1984-08-01), Wakai
patent: 4558413 (1985-12-01), Schmidt et al.
patent: 4631673 (1986-12-01), Haas
patent: 4761737 (1988-08-01), Duvall
patent: 4953080 (1990-08-01), Dysart et al.
patent: 5163148 (1992-11-01), Walls
patent: 5175849 (1992-12-01), Schneider
patent: 5201044 (1993-04-01), Frey, Jr. et al.
patent: 5276860 (1994-01-01), Fortier
patent: 5369757 (1994-11-01), Spiro
patent: 5375232 (1994-12-01), Legvold
patent: 5379412 (1995-01-01), Eastriudge
patent: 5381545 (1995-01-01), Baker
patent: 5386554 (1995-01-01), Nozaki
patent: 5403639 (1995-04-01), Belsan
patent: 5454103 (1995-09-01), Coverston
patent: 5487160 (1996-01-01), Bemis
patent: 5594900 (1997-01-01), Cohn et al.
patent: 5603020 (1997-02-01), Hashimoto
patent: 5623598 (1997-04-01), Voigt et al.
patent: 5627996 (1997-05-01), Bauer
patent: 5636359 (1997-06-01), Beardsley
patent: 5636360 (1997-06-01), Courts et al.
patent: 5642501 (1997-06-01), Doshi
patent: 5664177 (1997-09-01), Lowry
patent: 5664186 (1997-09-01), Bennett
patent: 5724552 (1998-03-01), Taoda
patent: 5742752 (1998-04-01), DeKoning
patent: 5764972 (1998-06-01), Crouse
patent: 5771379 (1998-06-01), Gore
patent: 5778411 (1998-07-01), DeMoss
patent: 5819275 (1998-10-01), Badger
patent: 5875459 (1999-02-01), Taoda
patent: 5918229 (1999-06-01), Davis
patent: 5953689 (1999-09-01), Hale et al.
patent: 6101615 (2000-08-01), Lyons
patent: 6151659 (2000-11-01), Solomon
patent: 6233648 (2001-05-01), Tomita
patent: 6263298 (2001-07-01), Kerman et al.
patent: 6311193 (2001-10-01), Sekido
patent: 6353837 (2002-03-01), Blumenau
patent: 6397311 (2002-05-01), Capps
patent: 6606585 (2003-08-01), Borowsky et al.
patent: 6651137 (2003-11-01), Baek
patent: 6654772 (2003-11-01), Crow
patent: 6671772 (2003-12-01), Cousins
patent: 6687793 (2004-02-01), Thomas et al.
patent: 6775679 (2004-08-01), Gupta
patent: 6823336 (2004-11-01), Srinivasan
patent: 6829617 (2004-12-01), Sawdon
patent: 6981171 (2005-12-01), Hashemi
patent: 7085785 (2006-08-01), Sawdon
patent: 7134053 (2006-11-01), Moore
patent: 7213103 (2007-05-01), Eng et al.
patent: 7275179 (2007-09-01), Coatney
patent: 2001/0055226 (2001-12-01), Miura et al.
patent: 2002/0091903 (2002-07-01), Mizuno
patent: 2002/0103969 (2002-08-01), Koizumi et al.
patent: 2002/0112022 (2002-08-01), Kazar
patent: 2002/0194209 (2002-12-01), Bolosky
patent: 2003/0074528 (2003-04-01), Soejima et al.
patent: 2003/0145167 (2003-07-01), Tomita
patent: 2003/0158873 (2003-08-01), Sawdon
patent: 2003/0159007 (2003-08-01), Sawdon
patent: 2003/0212872 (2003-11-01), Patterson et al.
patent: 2004/0024900 (2004-02-01), Breiter et al.
patent: 2004/0103189 (2004-05-01), Cherkasova et al.
patent: 2004/0148444 (2004-07-01), Thomas et al.
patent: 2005/0138284 (2005-06-01), Cohn et al.
patent: 2005/0223269 (2005-10-01), Stolowitz
patent: 2005/0240742 (2005-10-01), Eng et al.
patent: 2006/0077894 (2006-04-01), Schmuck
patent: 2006/0184587 (2006-08-01), Federwisch
patent: 2006/0206536 (2006-09-01), Sawdon
patent: 3919802 (1989-12-01), None
patent: 0 278 313 (1988-08-01), None
patent: 0 339 221 (1989-11-01), None
patent: 0 341 037 (1989-11-01), None
patent: 0 501 160 (1992-09-01), None
patent: 0 566 966 (1993-10-01), None
patent: 0 679 028 (1995-10-01), None
patent: 0 238 158 (1995-12-01), None
patent: 0 840 242 (1998-05-01), None
patent: 1 246 061 (2002-10-01), None
patent: 2 218 833 (1989-11-01), None
patent: 09265357 (1997-10-01), None
patent: WO93/08529 (1993-04-01), None
patent: WO98/20419 (1998-05-01), None
patent: WO99/13403 (1999-03-01), None
patent: WO99/63441 (1999-12-01), None
Computer dictionary, 1997, Microsoft Press, Third Edition, p. 121.
Benford, “Dynamic Definition of Entries and Attributes in the Directory Service,” 8thInternational Conference on Distributed Computing Systems, Jun. 13-17, 1988, pp. 563-568.
Chang et al., “Extended K-d Tree Database Organization” A Dynamic Multiattribute Clustering Method, IEEE Transactions on Software Engineering, vol. SE-7, No. 3, May 1981, pp. 284-290.
Chen et al., “A Performance Evaluation of Raid Architectures,” IEEE Transactions on Computers, vol. 45, No. 10, Oct. 1996, pp. 1116-1130.
Chen et al., “Schemes for Snapshot Advancement for Multiversion Concurrency Control,” IBM Technical Disclosure Bulletin, vol. 34, No. 12, May 1992, pp. 135-137.
Coley, “Support of a Dynamically Managed Device Switch Table on a UNIX Operating System,” IBM Technical Disclosure Bulletin, vol. 34, No. 10A, Mar. 1992, pp. 130-132.
Condry et al., “The Object-Oriented Advantage in Prototyping a Remote File System,” Proceedings of the Second International Workshop on Object Orientation in Operating Systems, Sep. 24-25, 1992, pp. 190-199.
Corn et al., “Dynamic Memory Estimation for Database Monitor Snapshot,” IBM Technical Disclosure Bulletin, vol. , No. , May 1992, pp. 135-137.
Cruz et al., “Dunes: A Performance—Oriented System Support Environment for Dependency Maintenance in Workstation Networks,” Proceedings of the Eighth International Symposium on High Performance Distributed Computing, 1999, pp. 309-318.
de Jonge et al., “Concurrent Access to B-trees,” International Conference on Databases, Parallel Architectures and their Applications, PARBASE-90, Mar. 7-9, 1990, pp. 312-320.
Duvall et al., “Database Server Journal Backup Automation Technique,” IBM Technical Disclosure Bulletin, vol. 36, No. 2, Feb. 1993, p. 463.
Emma et al., “Exclusive Use Directory and Inode Caching,” IBM Technical Disclosure Bulletin, vol. 32, No. 7, Dec. 1989, pp. 279-280.
Gait, “Stability, Availability, and Response in Network File Service,” IEEE Transactions on Software Engineering, vol. 17, No. 2, Feb. 1991, pp. 133-140.
Greene, “Indicating the ”File Types“ in the Files Window of a User-Interactive Display System,” IBM Technical Disclosure Bulletin, vol. 29, No. 6, Nov. 1986, p. 2684.
Helary et al., “Computing Particular Snapshots in Distributed Systems,” Ninth Annaul International Phoenix Conference on Computers and Communications, Mar. 21-23, 1990, pp. 116-123.
Henson, “Managing Executing Files in a Virtual File System,” IBM Technical Disclosure Bulletin, vol. 30, No. 10, Mar. 1988, pp. 68-69.
Heyrman et al., “Storage Management Mechanism for Managing Snapshot Pages, ” IBM Technical Disclosure Bulletin, vol. 35, No. 4B, Sep. 1992, pp. 26-29.
Honishi et al., “An Index Structure for Parallel Database Processing,” Second International Workshop on Research Issues on Data Engineering, Transaction and Query Processing, Feb. 2-3, 1992, pp. 224-225.
Hsieh et al., “Performance Evaluation ofSoftware Raidvs.Hardware RAIDfor Parallel Virtual File System,” Proceedings of the Ninth International Conference on Parallel and Distributed Systems, 2002, pp. 1-7.
Hua et al., “Improving RAID Performance Using a Multibuffer Technique,” Proceedings of

Affiliated with

Also associated with

Rating

Accessing data storage systems without waiting for read errors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Accessing data storage systems without waiting for read errors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accessing data storage systems without waiting for read errors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4206706