Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Method and means for dynamically partitioning cache into a global and data type subcache hierarchy from a real time reference trace

Method and means for dynamically partitioning cache into a global and data type subcache hierarchy from a real time reference trace

US Patent 5434992 · Granted Jul 18, 1995

Estimated economic value: $10,455,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Dynamic queue prioritization by modifying priority value based on queue's level 1999
Method and apparatus for dynamic segment allocation in log structured arrays1998
Log-structured disk array with garbage collection regrouping of tracks to preser1998
Method for managing a cache hierarchy having a least recently used (LRU) global 1998
System for managing log structured array (LSA) of DASDS by managing segment spac1996
Destaging modified data blocks from cache memory1996
Method and system for minimizing seek affinity and enhancing write sensitivity i1995
Method and means for encoding and rebuilding data contents of up to two unavaila1993
Method and means for managing DASD array accesses when operating in degraded mod1993
Method and means for distributed sparing in DASD arrays1993
Communication for version management in a distributed information service1987
Impact calculation for version management in a distributed information service1987