Interlaced magnetic recording band isolation
Methods and apparatus for allocating logical sectors and bands to store data on interlaced magnetic recording tracks. The systems and methods include formatting a data storage medium to include a plurality of bands, each band of the plurality of bands including a plurality of tracks, the plurality of tracks including a subset of top tracks interlaced with a subset of bottom tracks, and each track of the plurality of tracks including a number of sectors, formatting a first band of the plurality of bands, determining an isolation region of the first band, and formatting a second band of the plurality of bands responsive to determining the isolation region of the first band.
1. A data storage formatting method comprising:
filling, with supposed data, a subset of bottom tracks comprising sectors interlaced with a subset of top tracks comprising sectors;
iteratively moving supposed data from a sector of the subset of bottom tracks to a sector of the subset of top tracks until a number of empty top tracks inward from an end non-empty bottom track is zero; and
assigning an isolation region responsive to a determination that the subset of bottom tracks has a non-full track, assigning that portion of the non-full track as a first portion of the isolation region, and assigning a corresponding portion of an adjacent top track as a second portion of the isolation region, or,
responsive to a determination that the subset of bottom tracks does not have a non-full track, assigning no more than an entire adjacent top track as the isolation region.
2. The method of claim 1 , wherein prior to filling the subset of bottom tracks, determining defective sectors of the subset of bottom tracks, and filling the sectors of the subset of bottom tracks avoiding the defective sectors.
3. The method of claim 1 , wherein prior to iteratively moving supposed data, determining defective sectors of the subset of top tracks, and filling the sectors of the subset of top tracks avoiding the defective sectors.
4. The method of claim 1 , comprising:
filling the subset of bottom tracks left to right with supposed data;
iteratively moving and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the left-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assigning the isolation region responsive to a determination if the right-most bottom track is a non-full track, assigning that portion of the non-full track as a first portion of the isolation region, and assigning a circumferentially complementary portion of an adjacent top track as a second portion of the isolation region.
5. The method of claim 1 , comprising:
filling the subset of bottom tracks left to right with supposed data;
iteratively moving and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the left-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assigning the isolation region responsive to a determination if the right-most bottom track is not a non-full track, assigning an adjacent top track as the isolation region.
6. The method of claim 1 , further comprising after assigning an isolation region:
filling a next subset of bottom tracks with second supposed data;
iteratively moving second supposed data from a sector of the next subset of bottom tracks to a sector of a next subset of top tracks, until the number of empty top tracks inward from the end non-empty bottom track is zero; and
assigning a next isolation region responsive to a determination if the next subset of bottom tracks has a non-full track, assigning that portion of the non-full track as a first portion of the next isolation region, and assigning a corresponding portion of an adjacent top track as a second portion of the next isolation region, or, if the next subset of bottom tracks does not have a non-full track, assigning an adjacent top track as the next isolation region.
7. The method of claim 6 , wherein prior to filling the next subset of bottom tracks, determining defective sectors of the next subset of bottom tracks, and filling the sectors of the next subset of bottom tracks avoiding the defective sectors.
8. The method of claim 6 , wherein prior to iteratively moving second supposed data, determining defective sectors of the next subset of top tracks, and filling the sectors of the next subset of top tracks avoiding the defective sectors.
9. A controller for a disc drive assembly configured to format a data storage medium of the assembly, the controller configured to:
fill a subset of bottom tracks comprising sectors interlaced with a subset of top tracks comprising sectors with supposed data;
iteratively move supposed data from a sector of the subset of bottom tracks to a sector of the subset of top tracks, until a number of empty top tracks inward from an end non-empty bottom track is zero; and
assign an isolation region responsive to a determination that the subset of bottom tracks has a non-full track, assign that portion of the non-full track as a first portion of the isolation region, and assign a corresponding portion of an adjacent top track as a second portion of the isolation region, or if the subset of bottom tracks does not have a non-full track, assign no more than an entire adjacent top track as the isolation region.
10. The controller of claim 9 configured to, prior to filling the subset of bottom tracks, determine defective sectors of the subset of bottom tracks, and fill the sectors of the subset of bottom tracks avoiding the defective sectors.
11. The controller of claim 9 configured to, prior to iteratively moving supposed data, determine defective sectors of the subset of top tracks, and fill the sectors of the subset of top tracks avoiding the defective sectors.
12. The controller of claim 9 further configured to:
fill the subset of bottom tracks left to right with supposed data;
iteratively move and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the right-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assign an isolation region responsive to a determination if the right-most bottom track is a non-full track, assign that portion of the non-full track as a first portion of the isolation region, and assign a circumferentially complementary portion of an adjacent top track as a second portion of the isolation region.
13. The controller of claim 9 further configured to:
fill the subset of bottom tracks left to right with supposed data;
iteratively move and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the right-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assign an isolation region responsive to a determination if the right-most bottom track is not a non-full track, assign an adjacent top track as the isolation region.
14. The controller of claim 9 further configured to, after assigning an isolation region:
fill a next subset of bottom tracks with second supposed data;
iteratively move second supposed data from a sector of the next subset of bottom tracks to a sector of a next subset of top tracks, until the number of empty top tracks inward from the end non-empty bottom track is zero; and
assign a next isolation region responsive to a determination if the next subset of bottom tracks has a non-full track, assign that portion of the non-full track as a first portion of the next isolation region, and assign a corresponding portion of an adjacent top track as a second portion of the next isolation region, or if the next subset of bottom tracks does not have a non-full track, assign an adjacent top track as the next isolation region.
15. A controller for a disc drive assembly configured to format a data storage medium of the assembly, the controller comprising:
means to fill a subset of bottom tracks comprising sectors interlaced with a subset of top tracks comprising sectors with supposed data;
means to iteratively move supposed data from a sector of the subset of bottom tracks to a sector of the subset of top tracks, until a number of empty top tracks inward from an end non-empty bottom track is zero; and
means to, responsive to a determination that the subset of bottom tracks has a non-full track:
assign an isolation region,
assign that portion of the non-full track as a first portion of the isolation region, and
assign a corresponding portion of an adjacent top track as a second portion of the isolation region, or
means to, responsive to a determination that the subset of bottom tracks does not have a non-full track, assign no more than an entire adjacent top track as the isolation region.
16. The controller of claim 15 configured to, prior to filling the subset of bottom tracks, determine defective sectors of the subset of bottom tracks, and fill the sectors of the subset of bottom tracks avoiding the defective sectors.
17. The controller of claim 15 configured to, prior to iteratively moving supposed data, determine defective sectors of the subset of top tracks, and fill the sectors of the subset of top tracks avoiding the defective sectors.
18. The controller of claim 15 further configured to:
fill the subset of bottom tracks left to right with supposed data;
iteratively move and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the right-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assign an isolation region responsive to a determination if the right-most bottom track is a non-full track, assign that portion of the non-full track as a first portion of the isolation region, and assign a circumferentially complementary portion of an adjacent top track as a second portion of the isolation region.
19. The controller of claim 15 further configured to:
fill the subset of bottom tracks left to right with supposed data;
iteratively move and filling supposed data from a sector of a right-most bottom track of the subset of bottom tracks to a sector of the right-most track of the subset of top tracks, until N=0 or 1, where N is the number of empty top tracks to the left of the right-most non-empty bottom track; and
assign an isolation region responsive to a determination if the right-most bottom track is not a non-full track, assign an adjacent top track as the isolation region.
20. The controller of claim 15 further configured to, after assigning an isolation region:
fill a next subset of bottom tracks with second supposed data;
iteratively move second supposed data from a sector of the next subset of bottom tracks to a sector of a next subset of top tracks, until the number of empty top tracks inward from the end non-empty bottom track is zero; and
assign a next isolation region responsive to a determination if the next subset of bottom tracks has a non-full track, assign that portion of the non-full track as a first portion of the next isolation region, and assign a corresponding portion of an adjacent top track as a second portion of the next isolation region, or if the next subset of bottom tracks does not have a non-full track, assign an adjacent top track as the next isolation region.