Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › System for scheduling readahead operations if new request is within a proximity of N last read requests wherein N is dependent on independent activities

System for scheduling readahead operations if new request is within a proximity of N last read requests wherein N is dependent on independent activities

US Patent 5483641 · Granted Jan 9, 1996

Estimated economic value: $18,350,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Method and system for removing contaminants from soil2025
Refreshing cache regions using a memory controller and multiple tables2025
Zero bits in L3 tags2024
Neural network unit that interrupts processing core upon condition2022
Neural network unit that interrupts processing core upon condition2022
Processor with memory controller including dynamically programmable functional u2021
Neural network unit with plurality of selectable output functions2020
Processor with selective data storage (of accelerator) operable as either victim2020
Neural network unit that performs convolutions using collective shift register a2020
Processor with an expandable instruction set architecture for dynamically config2020
Dynamic reconfiguration of multi-core processor2020
Processor with hybrid coprocessor/execution unit neural network unit2020