Patent US5394382A successfully refreshed from Google Patents.
US5394382A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for the organization of data on a CD-ROM
Assignee: International Business Machines Corp
•
Filing: 1993-02-11
•
Granted: 1995-02-28
•
Expires: 2013-02-11
Abstract
Abstract A data placement organization method that reduces the average seek time and the probability of maximum distance seeks of CD-ROM disks by a combination of symmetric structuring, frequency-based data placement, and data replication. The technique for fabricating a CD-ROM, including the data placement organization stage of the present invention includes a first stage wherein the data is designed, authored and prepared on a data processor or personal computer and stored on the hard disk memory. The data is then transferred from the hard disk temporary storage onto tape storage or optical disk storage. The data on the tape storage is then used as input to a CD-ROM mastering stage wherein, based on the content of the tape, holes are burned in a master CD mold which is used to press a large quantity of CDs. A data placement optimization stage is provided between the first processor stage 3 and the tape storage stage. The data placement optimization stage determines the best placement of the data received from the processor stage base on directory frequency statistics, and sends this forward to the tape storage stage so that a CD-ROM can be mastered wherein the seek time for data retrieval and the seek distances that must be travelled on the CD-ROM disc between the retrieval of data on different locations on the disc are minimized. Data replication is also to minimize retrieval distances and time.
Inventors
- 👤 Limin Hu
- 👤 Shauchi Ong
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 04:38
CPC Classifications
G; G11; G11B; G11B27/00; G11B27/10; G11B27/102; G11B27/105; G11B20/00; G11B20/10; G11B20/12; G11B20/1217; G11B20/1258; G11B27/02; G11B27/031; G11B27/034; G11B27/19; G11B27/28; G11B27/32; G11B27/327; G11B27/329; G11B2020/10916; G11B2220/00; G11B2220/20; G11B2220/21; G11B2220/213; G11B2220/25; G11B2220/2537; G11B2220/2545; G11B2220/90
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
298 words
A method for placing data on a compact disk of the type wherein data is stored on the disk surface in concentric tracks of equal capacity comprising the steps of: Step 1) compiling in a first storage means a quantity of data in the form of data files arranged in directories including path data and data specifying the allocation of the files within the directories, Step 2) transferring said compiled data from said first storage means to a data placement optimization stage, Step 3) determining, in said data optimization stage, placement assignments of said data on said concentric tracks of said compact disk based on directory frequency statistics including the frequency at which said directories of said data are user accessed and rearranging said data in accordance with said placement assignments, assigning a quantity of most frequently accessed directory data, path data and file allocation data to the track locations at the center of said compact disk substantially midway in distance between the first and last track locations on said compact disk, said track locations at said center of said compact disk being referred to herein as the hot spot, assigning a selected amount of the next most frequently user accessed data to track locations proximate to one side of said hot spot tracks and the step of assigning a selected amount of the still next most frequently accessed data to track locations on the other side of said hot spot tracks, Step 4) transferring said data rearranged in accordance with said placement assignments from said data optimization stage to a second storage means, Step 5) and transferring said rearranged data from said second storage means to a compact disk mastering and copying means for placing said data on said compact disk in accordance with said placement assignments.
Claim 2
Independent Claim
298 words
A method for placing data on a compact disk of the type wherein data is stored on the disk surface in concentric tracks of equal capacity comprising the steps of: Step 1) compiling in a first storage means a quantity of data in the form of data files arranged in directories including path data and data specifying the allocation of the files within the directories, Step 2) transferring said compiled data from said first storage means to a data placement optimization stage, Step 3) determining, in said data optimization stage, placement assignments of said data on said concentric tracks of said compact disk based on directory frequency statistics including the frequency at which said directories of said data are user accessed and rearranging said data in accordance with said placement assignments, assigning a quantity of most frequently accessed directory data, path data and file allocation data to the track locations at the center of said compact disk substantially midway in distance between the first and last track locations on said compact disk, said track locations at said center of said compact disk being referred to herein as the hot spot, assigning a selected amount of the next most frequently user accessed data to track locations proximate to one side of said hot spot tracks and the step of assigning a selected amount of the still next most frequently accessed data to track locations on the other side of said hot spot tracks, Step 4) transferring said data rearranged in accordance with said placement assignments from said data optimization stage to a second storage means, Step 5) and transferring said rearranged data from said second storage means to a compact disk mastering and copying means for placing said data on said compact disk in accordance with said placement assignments.
Claim 3
Dependent Claim
86 words
A method for placing data on the tracks of a compact disk according to claim 1 wherein said step 3 still further includes the steps of assigning the remaining of said data compiled in Step 1 and placement optimized in Step 3 to tracks of said compact disk, said remaining data of said quantity of data of Step 1 being assigned to tracks on successive alternate sides of said hot spot at distances from said hot spot related to the user access frequencies of said data.
Claim 4
Dependent Claim
80 words
A method for placing data on the tracks of a compact disk according to claim 2 wherein said step 3 further includes the step of determining whether available tracks remain on said disk that do not have data assigned thereto after said quantity of compiled data has been completely assigned to tracks, and the step of again assigning said quantity of compiled data to said remaining available tracks to replicate said assignment of said compiled data on said compact disk.
Claim 5
Dependent Claim
110 words
A method for placing data on the tracks of a compact disk according to claim 3 wherein, in step 3, there are a total of N tracks on said compact disk, wherein said quantity of compiled data has been assigned to M tracks where M is a number less than N, wherein said available remaining tracks are A in number where A=N-M, and wherein A is a number less than M/2 and wherein said quantity of compiled data again assigned to said A remaining available tracks are assigned beginning with the least frequently accessed data being assigned to the next tracks of said A tracks adjacent to said M tracks.
Claim 6
Dependent Claim
109 words
A method for placing data on the tracks of a compact disk according to claim 3 wherein, in step 3, there area total of N tracks on said compact disk, wherein said quantity of compiled data has been assigned to M tracks where M is a number less than N, wherein said available remaining tracks are A in number where A=N-M, and wherein A is a number between M/2 and M and wherein said quantity of compiled data again assigned to said A remaining available tracks are assigned beginning with the least frequently accessed data being assigned to the next of said A tracks adjacent to said M tracks.
Claim 7
Dependent Claim
111 words
A method for placing data on the tracks of a compact disk according to claim 3 wherein, in step 1, there are a total of N tracks on said compact disk, wherein said quantity of compiled data has been assigned to M tracks where M is a number less than N, wherein said available remaining tracks are A in number where A=N-M, and wherein A is a number equal to M/2 and wherein said quantity of compiled data again assigned to said A remaining available tracks are assigned beginning with the most frequently accessed hot spot data being assigned to the next of said A tracks adjacent to said M tracks.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-02-27 | 1998-08-29 | 1999-02-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-02-27 | 2002-08-29 | 2003-02-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-02-27 | 2006-08-29 | 2007-02-28 | $7700.00 | Window Closed / Lapsed |