Storage system format for transaction safe file system

Data processing: database and file management or data structures – File management – File systems

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S610000, C707S648000, C707S682000

Reexamination Certificate

active

07747664

ABSTRACT:
A transaction safe file system uses two sets of file allocation tables and bitmap images to perform file modifications on one of the sets while the other set remains a last known good set. After a modification is complete, a pointer is changed to the newly modified set, and the newly modified set becomes the last known good set. The sets are then synchronized. The file allocation table is used to define cluster chains while the bitmap image is used to determine if a cluster is free or not. In some operations, only the bitmap image may need to be manipulated. The file system may be used in a transaction safe mode as well as a non-transaction safe mode.

REFERENCES:
patent: 5086502 (1992-02-01), Malcolm
patent: 5201044 (1993-04-01), Frey et al.
patent: 5297148 (1994-03-01), Harari et al.
patent: 5469562 (1995-11-01), Saether
patent: 5537636 (1996-07-01), Uchida et al.
patent: 5546389 (1996-08-01), Wippenbeck et al.
patent: 5699548 (1997-12-01), Choudhury et al.
patent: 5732268 (1998-03-01), Bizzarri
patent: 5734340 (1998-03-01), Kennedy
patent: 5778168 (1998-07-01), Fuller
patent: 5813011 (1998-09-01), Yoshida et al.
patent: 5825734 (1998-10-01), Igarashi
patent: 5832515 (1998-11-01), Ledain et al.
patent: 5850506 (1998-12-01), Gordons
patent: 5907672 (1999-05-01), Matze et al.
patent: 5983240 (1999-11-01), Shoroff
patent: 6023744 (2000-02-01), Shoroff
patent: 6032223 (2000-02-01), Beelitz
patent: 6037738 (2000-03-01), Morita et al.
patent: 6049807 (2000-04-01), Carroll et al.
patent: 6078999 (2000-06-01), Raju et al.
patent: 6108759 (2000-08-01), Orcutt
patent: 6192432 (2001-02-01), Slivka
patent: 6205558 (2001-03-01), Sobel
patent: 6286113 (2001-09-01), Sembach et al.
patent: 6374268 (2002-04-01), Testardi
patent: 6377958 (2002-04-01), Orcutt
patent: 6378031 (2002-04-01), Kuno et al.
patent: 6470345 (2002-10-01), Doutre
patent: 6510552 (2003-01-01), Benayoun et al.
patent: 6571259 (2003-05-01), Zheng et al.
patent: 6615365 (2003-09-01), Jenevein et al.
patent: 6615404 (2003-09-01), Garfunkel et al.
patent: 6658437 (2003-12-01), Lehman
patent: 6662309 (2003-12-01), Ando et al.
patent: 6675180 (2004-01-01), Yamashita
patent: 6792518 (2004-09-01), Armangau et al.
patent: 6856993 (2005-02-01), Verma
patent: 6883114 (2005-04-01), Lasser
patent: 6907184 (2005-06-01), Yokota et al.
patent: 6922708 (2005-07-01), Sedlar
patent: 7051251 (2006-05-01), Moore et al.
patent: 7062602 (2006-06-01), Moore et al.
patent: 7089448 (2006-08-01), Hinshaw et al.
patent: 7174420 (2007-02-01), Mulueg et al.
patent: 7363540 (2008-04-01), Patel et al.
patent: 2001/0016841 (2001-08-01), Karasudani
patent: 2001/0054129 (2001-12-01), Wouters
patent: 2002/0152354 (2002-10-01), Harmer
patent: 2003/0028765 (2003-02-01), Cromer et al.
patent: 2003/0233385 (2003-12-01), Srinivasa
patent: 2004/0030847 (2004-02-01), Tremaine
patent: 2004/0210706 (2004-10-01), In et al.
patent: 2004/0250172 (2004-12-01), Patel et al.
patent: 2005/0027746 (2005-02-01), Lin
patent: 2005/0060316 (2005-03-01), Kamath
patent: 2007/0136387 (2007-06-01), Malueg et al.
patent: 2007/0239957 (2007-10-01), Lin
patent: 2008/0172426 (2008-07-01), Patel et al.
patent: 2008/0177939 (2008-07-01), Patel et al.
“A Highly Available Replicated File System for Resource-Constrained Windows CE .Net Devices”, http://www.gsd.inesc-id.pt/˜jpbarreto/bib/HaddockFS—DotNetTechs05.pdf.
“Transaction-Safe Fat File System”, http://msdn.microsoft.com/library/default.asp?url=/library/en-us/wcemain4/html/cmcontransaction-safefatfilesystem.asp.
Otoo et al., “Non-shared disk cluster—a fault tolerant, commodity approach to hi-bandwidth data analysis”, http://scholar.google.com/scholar?hl=en&lr=&q=cache:rptl-5auhx0J:www.ihep.ac.cn/˜chep01/paper/4-026.pdf.
Sivathanu et al., “Life or Death at Block-Leve”, https://www.usenix.org/publications/library/proceedings/osdi04/tech/full—papers/sivathanu/sivathanu.pdf.
Microsoft Press Computer Dictionary Third Edition, “ fragmentation”, Microsoft Press, 1997, p. 206.
Microsoft Press Computer Dictionary Third Edition, “flush”, Microsoft Press, 1997, p. 202.
Jonge, “The Logical Disk: A New Approach to Improving File Systems”, In Proceedings of the 14th ACM Symposium on Operating Systems Principles, 1993.
Farr et al., “An Optimum Disc Organization for a Virtual Memory System”, Computer Design, Jun. 1971, pp. 49-54.
Lee, Chiung-San, “Server-Based Maintenance Approach for Computer Classroom Workstations”, IEICE Trans. Inf. & Syst., vol. E83-D, No. 4, Apr. 2000.
“Transactional file access”, Date: Jun. 2, 2005, http://jakarta.apache.org/commons/transaction/file/index.html.
“ZFS, Sun's Cutting-Edge File System (Part 1: Storage Integrity, Security, and Scalability)”, Date: Aug. 2006, http://www.sun.com/bigadmin/features/articles/zfs—part1.scalable.htm#transaction.
Chen, et al., “The Rio File Cache: Surviving Operating System Crashes”, http://www.cs.ucsd.edu/classes/wi01/cse221/chen,ng,rajamani,aycock.the—rio-file—cache.surviving—operating—system—crashes.pdf.
Kashyap,Aditya, “File System Extensibility and Reliability Using an in-Kernel Database”, Date: Dec. 2004, http://www.am-utils.org/docs/kbdbfs-msthesis/index.html.

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

Storage system format for transaction safe file system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Storage system format for transaction safe file system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storage system format for transaction safe file system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4224684

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