Operating system Exercise, trying to figure out which term matches with the defi
ID: 3760018 • Letter: O
Question
Operating system Exercise, trying to figure out which term matches with the definitions provided bellow and There are 18 definitions and 18 terms. You should use each answer exactly once.
Terms:
Definitions:
Low latency associative memory that stores memory address mappings.
High-speed volatile storage that stores copies of memory stored in DRAM.
A variable-sized unit of process memory (base and bound are variable) generally used to organize memory usage.
A fixed-sized unit of process memory (base is variable, bound is fixed to one of a small number of values).
A mechanism for providing exclusive access to a shared resource.
When multiple computations run at the same time and can interact with each other.
The property of only allowing a single computation access to a set of code at any given time, even though multiple computations may attempt to run that code at the same time.
A small computation that cannot be interrupted.
When a concurrent computation produces different results because of differing rates of execution.
A design principle/conceptual model of computer architecture in which information moves between large pools of persistent but slow storage to smaller, faster memory stores.
The memory addresses that are used by processes.
The memory addresses that refer to actual memory locations in RAM.
The time between a request and that request being fulfilled.
The rate of data transfer.
A system call for mapping byte ranges in a file to byte ranges in a process's address space.
Programs tend to exhibit patterns in their code and data memory accesses. Nearby memory is accessed more frequently than distant memory, and memory accessed in the past is often accessed again in the future.
The upper bits of a physical address along with metadata bits. It is cached in the TLB.
The data structure that maps virtual addresses to physical addresses.
Explanation / Answer
atomic operation:A small computation that cannot be interrupted bandwidth:The rate of data transfer. latency:The time between a request and that request being fulfilled. concurrency:When multiple computations run at the same time and can interact with each other. page table entry :The data structure that maps virtual addresses to physical addresses. Lock:A mechanism for providing exclusive access to a shared resource. segment:A variable-sized unit of process memory (base and bound are variable) generally used to organize memory usage. level 1 cache: High-speed volatile storage that stores copies of memory stored in DRAM. virtual address:The memory addresses that are used by processes physical address:The memory addresses that refer to actual memory locations in RAM. memory hierarchy:A design principle/conceptual model of computer architecture in which information moves between large pools of persistent but slow storage to smaller, faster memory stores page:A fixed-sized unit of process memory (base is variable, bound is fixed to one of a small number of values). mmap:A system call for mapping byte ranges in a file to byte ranges in a process's address space. mutual exclusion: The property of only allowing a single computation access to a set of code at any given time, even though multiple computations may attempt to run that code at the same time. Locality of reference:Programs tend to exhibit patterns in their code and data memory accesses. Page table: The upper bits of a physical address along with metadata bits. It is cached in the TLB TLB :Nearby memory is accessed more frequently than distant memory, and memory accessed in the concurrency Race condition:- When a concurrent computation produces different results because of differing rates of execution.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.