Excitement System for Dynamic Resource Block Prefetching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource access methods, such as simple read-ahead protocols, are inefficient as they fail to accurately predict which resource blocks to prefetch, leading to wasted resources and degraded performance due to fixed block prefetching independent of disk read speed.
Innovation Solution
The excitement system predicts future resource access by maintaining excitement values for resource blocks and using a threshold to determine which blocks to prefetch, allowing for dynamic and efficient caching based on expected usage patterns.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a fixed number of blocks are prefetched using simple read-ahead protocol, then cache space is allocated for prefetching, but resource access efficiency deteriorates because too many blocks are prefetched when read speed is slow, wasting cache space
Solution Approach 1:
The patent applies dynamics by making the prefetch block count variable rather than fixed. The system dynamically adjusts the number of blocks to prefetch based on the actual read speed of the disk. When read speed is high, more blocks are prefetched; when read speed is low, fewer blocks are prefetched. This dynamic adjustment resolves the contradiction by optimizing cache space utilization according to real-time performance conditions.
Solution Approach 2:
The patent implements feedback by monitoring the actual read speed of the disk and using this information to adjust the prefetch behavior. The system measures the read speed and feeds this information back to the prefetching mechanism, which then adjusts the number of blocks to prefetch accordingly. This closed-loop control resolves the contradiction by ensuring cache space is allocated efficiently based on actual performance feedback.
2Device complexity
If a fixed number of blocks are prefetched using simple read-ahead protocol, then prefetching is simplified, but resource access efficiency deteriorates because too few blocks are prefetched when read speed is high, degrading performance and throughput
Solution Approach 1:
The patent applies dynamics by making the prefetch block count variable rather than fixed. The system dynamically adjusts the number of blocks to prefetch based on the actual read speed of the disk. When read speed is high, more blocks are prefetched; when read speed is low, fewer blocks are prefetched. This dynamic adjustment resolves the contradiction by optimizing cache space utilization according to real-time performance conditions.
Solution Approach 2:
The patent implements feedback by monitoring the actual read speed of the disk and using this information to adjust the prefetch behavior. The system measures the read speed and feeds this information back to the prefetching mechanism, which then adjusts the number of blocks to prefetch accordingly. This closed-loop control resolves the contradiction by ensuring cache space is allocated efficiently based on actual performance feedback.
3Ease of manufacture
If simple read-ahead protocol is used with fixed block prefetching, then implementation is straightforward, but resource access efficiency deteriorates due to wasted resources from prefetching blocks that will never be used
Solution Approach 1:
The patent applies dynamics by making the prefetch block count variable rather than fixed. The system dynamically adjusts the number of blocks to prefetch based on the actual read speed of the disk. When read speed is high, more blocks are prefetched; when read speed is low, fewer blocks are prefetched. This dynamic adjustment resolves the contradiction by optimizing cache space utilization according to real-time performance conditions.
Solution Approach 2:
The patent implements feedback by monitoring the actual read speed of the disk and using this information to adjust the prefetch behavior. The system measures the read speed and feeds this information back to the prefetching mechanism, which then adjusts the number of blocks to prefetch accordingly. This closed-loop control resolves the contradiction by ensuring cache space is allocated efficiently based on actual performance feedback.
Data Source
AI summary
Systems and methods using an excitement protocol enable prediction of which blocks of a resource to prefetch and store in memory. The system maintains a set of excitement values corresponding to the resource being accessed. The system also maintains a threshold. As blocks of the resource are requested, the system updates the set of excitement values. The system compares the excitement level to the threshold to determine whether to prefetch the corresponding resource block.


