Abstract: A method and device for mapping an inherently defective sectors or newly-identified defective sectors in a disc drive to a good sector in the disc drive in such a way that data fragmentation is minimized and that speed efficiency in accessing the data stored in the disc drive is improved due to minimized seek time and latency delays. In a disc drive data storage area of sectors, user spare sectors are located not at the end of a track, a cylinder, or a segment but at the end of the data storage area. Any defective user data sector is slipped to the next closest good sector over the full volume of the data storage area. That is, the data that would have been stored in the defective sector is pushed down to the next good sector, as each of the subsequent sectors are slipped sequentially to the next good sector in the full volume of the data storage area. A user sector slip list is generated to access the full volume slipped data storage area.

Abstract: Optimal command nodes are selected in a computing device having multiple command node queues by a method which identifies a command node in a first queue and determines if the identified command node collides with a command node in a second queue. If a collision between the identified command node and a command node in the second queue is determined, the collision is corrected and the identified command node then may be moved into the second queue. The second queue is then sorted according to a predetermined routine to select the optimal command node.

Abstract: A skip mask mechanism is implemented in a disc drive in order to increase performance by minimizing the number of necessary disc rotations required while executing a set of pseudo-sequential commands. The drive includes an interface between the host computer and the drive, a read/write channel between the interface and the transducer/head, a formatter between the interface and the read/write channel for timing when data is transferred between the interface and the read/write channel, and a skip mask mechanism interposed between a target calculator and the formatter that provides a masked input to the formatter for controlling passage of data between the interface and the read/write channel.

Abstract: A read-on-arrival scheme for reading data stored on a track of a data storage disc is disclosed. The track is divided into a plurality of sequentially arranged data sectors. Each data sector stores a block of data. A host computer issues a read command requesting retrieval of a segment of data blocks stored on a plurality of the data sectors. The segment may include a target data segment as well as a pre-fetch and post-fetch data segment. The read command specifies a target sector that a transducer is to initially access on the track. Upon receipt of the read command, components of a disc drive move the transducer to the track for access of the segment requested in the command. The disc drive components enable the transfer of data regardless of whether the transducer first accesses a sector located in sequential order prior to or following the target sector.

Abstract: A data storage device control module for controlling operational processes in a data storage device comprises a number of preemptive modules, a number of non-preemptive modules, and a scheduler module operable to schedule the execution of the non-preemptive modules only in the data storage device control module. Preferably included as one of the non-preemptive modules is a queue processor module operable to manage the position and movement of command nodes in multiple command node queues.

Abstract: A method and system for determining data sector splits across servo bursts in a disc drive having a data disc with an embedded servo configuration. The disc drive includes a data transducer selectively positionable over the data disc for transferring data to and from the data disc, and the data disc includes a plurality of zones of predefined tracks. The method includes locating one or more frame table parameters based on a new zone position, creating a plurality of new frame table entries, while the disc drive is in operation, based on the frame table parameters, and moving the data transducer from a past zone position to the new zone position. The disc drive includes parameter memory and frame table memory. The parameter memory contains a plurality of zone records, with the zone records containing a plurality of zone table parameters. The frame table memory is utilized to store a frame table.

Abstract: A read-on-arrival scheme for reading data stored on a track of a data storage disc is disclosed. The track is divided into a plurality of sequentially arranged data sectors. Each data sector stores a block of data. A host computer issues a read command requesting retrieval of a segment of data blocks stored on a plurality of the data sectors. The segment may include a target data segment as well as a pre-fetch and post-fetch data segment. The read command specifies a target sector that a transducer is to initially access on the track. Upon receipt of the read command, components of a disc drive move the transducer to the track for access of the segment requested in the command. The disc drive components enable the transfer of data regardless of whether the transducer first accesses a sector located in sequential order prior to or following the target sector.

Abstract: Methods and associated apparatus are disclosed that convert a logical block address value for a data storage disc location to a physical cylinder, physical head, and the physical sector or logical sector. The method and associated apparatus permit the spare sectors to be pooled at the end of the disc drive's volume, if desired, rather than always being included on each track. The methods and apparatus involve computing parameters and/or looking up parameters in a defect list stored in memory. Various steps are involved such as finding a target physical block address from a number of slipped (i.e., defective) sectors, finding an offset into the zone of interest, finding an offset into the track of interest, and finding a total cylinder and head skew up to the target physical block address.

Abstract: A data storage device control module for controlling operational processes in a data storage device comprises a number of preemptive modules, a number of non-preemptive modules, and a scheduler module operable to schedule the execution of the non-preemptive modules only in the data storage device control module. Preferably included as one of the non-preemptive modules is a queue processor module operable to manage the position and movement of command nodes in multiple command node queues.

Abstract: A method and system for determining data sector splits across servo bursts in a disc drive having a data disc with an embedded servo configuration. The disc drive includes a data transducer selectively positionable over the data disc for transferring data to and from the data disc, and the data disc includes a plurality of zones of predefined tracks. The method includes locating one or more frame table parameters based on a new zone position, creating a plurality of new frame table entries, while the disc drive is in operation, based on the frame table parameters, and moving the data transducer from a past zone position to the new zone position. The disc drive includes parameter memory and frame table memory. The parameter memory contains a plurality of zone records, with the zone records containing a plurality of zone table parameters. The frame table memory is utilized to store a frame table.

Abstract: A method and device for mapping an inherently defective sectors or newly-identified defective sectors in a disc drive to a good sector in the disc drive in such a way that data fragmentation is minimized and that speed efficiency in accessing the data stored in the disc drive is improved due to minimized seek time and latency delays. In a disc drive data storage area of sectors, user spare sectors are located not at the end of a track, a cylinder, or a segment but at the end of the data storage area. Any defective user data sector is slipped to the next closest good sector over the full volume of the data storage area. That is, the data that would have been stored in the defective sector is pushed down to the next good sector, as each of the subsequent sectors are slipped sequentially to the next good sector in the full volume of the data storage area. A user sector slip list is generated to access the full volume slipped data storage area.

Abstract: Dynamically scheduling the launch of tasks, each task comprising one or more associated executable actions, each task having an associated next action indicator and an associated next task indicator. Wherein, a first task is launched, an action indicated by the next action indicator associated with the first task is executed, and a task indicated by the next task indicator associated with the first task is launched.

Abstract: A skip mask mechanism is implemented in a disc drive in order to increase performance by minimizing the number of necessary disc rotations required while executing a set of pseudo-sequential commands. The drive includes an interface between the host computer and the drive, a read/write channel between the interface and the transducer/head, a formatter between the interface and the read/write channel for timing when data is transferred between the interface and the read/write channel, and a skip mask mechanism interposed between a target calculator and the formatter that provides a masked input to the formatter for controlling passage of data between the interface and the read/write channel.

Abstract: Optimal command nodes are selected in a computing device having multiple command node queues by a method which identifies a command node in a first queue and determines if the identified command node collides with a command node in a second queue. If a collision between the identified command node and a command node in the second queue is determined, the collision is corrected and the identified command node then may be moved into the second queue. The second queue is then sorted according to a predetermined routine to select the optimal command node.