Disc Space Allocation for Shortest Seek Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional file systems fail to optimize disc space allocation for files distributed across multiple blocks, leading to suboptimal seek times due to the method's reliance on distance from the reference point rather than actual seek time considerations.
Innovation Solution
A method and apparatus that detect and allocate empty disc sections based on their size relative to the data, prioritizing the allocation of the largest sections within and outside a predetermined range from the reference point to minimize seek time, with algorithms to iteratively adjust the reference point and data size as needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If empty blocks are allocated sequentially from the reference point based on distance, then the allocation process is simple, but the seek time is not optimized for files distributed across multiple blocks
Solution Approach 1:
The patent changes the allocation parameter from simple distance-based sequential allocation to seek-time-optimized allocation. It introduces a seek curve that models actual seek time as a function of distance, and uses this to evaluate and select block allocation sequences that minimize total seek time for multi-block files, rather than simply allocating the nearest available blocks
Solution Approach 2:
The patent makes the allocation process dynamic by considering the specific access patterns and seek time characteristics of the file system. It evaluates multiple possible allocation sequences and selects the optimal one based on the seek curve, rather than using a fixed sequential allocation rule
2Ease of manufacture
If blocks are allocated to minimize distance from reference point, then allocation is straightforward, but actual seek time is not minimized due to non-proportional relationship between distance and seek time
Solution Approach 1:
The patent replaces the mechanical distance-based allocation approach with a seek-time-based evaluation system. It introduces a seek curve that captures the non-linear relationship between physical distance and actual seek time, allowing the system to predict and optimize for real performance rather than relying on simple geometric distance metrics
Data Source
AI summary
A method and apparatus for allocating disc space for recording files, the method including: detecting one or more first sets, each comprising one or more empty sections of the disc that are larger than a predetermined reference value; detecting one or more second sets, each comprising one or more empty sections that are equal to or larger than a size of the data when combined; and allocating, to the data, an optimum set that results in a shortest seek time from a predetermined reference point. Accordingly, it is possible to effectively allocate empty disc space in consideration of both the distances of empty disc sections to a reference point and seek time, thus reducing the time taken to seek target data compared to methods of allocating disc space that only consider the distances of empty disc sections to a reference point.