Learn Before
Hybrid Cache State Transition
A system uses a two-level memory structure. The local memory holds the 4 most recent key-value pairs, and the compressed memory holds a summary of older pairs. Given the initial state below, what will be the state of the local memory and which key-value pair will be sent to the compression function after a new pair, K5/V5, is generated and added?
0
1
Tags
Ch.2 Generative Models - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Application in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
A memory system uses a two-level structure: a full, fixed-size local memory for recent items and a compressed memory for older items. When a new key-value pair is generated, several actions occur to update the system. Arrange the following actions in the correct chronological order.
Hybrid Cache State Transition
A memory system for handling long sequences uses a two-level cache: a fixed-size local memory for recent, high-fidelity items and a compressed memory for a summarized history of older items. When the local memory is full and a new key-value pair is added, the oldest pair is evicted. What is the immediate fate of this evicted key-value pair according to this design?