Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Ch11_ITE272_Part1
| Term | Definition |
|---|---|
| absolute addressing | using memory address operands that refer to actual physical memory locations; this method requires knowing process offsets |
| address mapping/address resolution | process of the CPU determining the physical memory address that corresponds to a memory reference |
| addressable memory | highest numbered storage byte that can be represented in a CPU or computer; usually determined by the number of bits used to represent an address |
| bare-metal hypervisor | hypervisors are installed much like an OS but provide only minimal OS-type functions, such as the capability to start and stop virtual machines |
| big endian | a CPU or memory architecture in which the most significant byte is stored at the lowest memory address. |
| blocked state | the state of an active thread that's been suspended by the OS and is waiting on the stack until interrupt processing has been completed |
| child process | a process created and controlled by the parent process that spawned it |
| command language or job control language (JLC) | a set of commands and syntax requirements for implementing an operating system's command layer via a text interface |
| command layer or shell | the operating system layer that serves as the user interface; via this layer, users can run applications and os utilities and manage system resources, such as files, folders, and I/O devices |
| compaction | the process of reallocating all programs in memory so that free partitions form a contiguous block in upper memory; used to address the problem of fragmentation |
| concurrent execution or interleaved execution | a method of sharing cpu control among threads by using time slices |
| contiguous | the condition of all protions of a program of the OS being loaded into sequential physical locations in memory |
| dispatching | giving CPU control to a thread in the ready state |
| explicit priority | priority based scheduling method that assigns a priority level to each thread and can dispatch the highest priority threads first or assign larger time slices to high priority threads |
| first come, first served (FCFS) | a priority based scheduling method in which the scheduler always dispatches the ready thread that has been waiting the longest. |
| fragmentation | the scattering of storage locations allocated to a single process of purpose throughout noncontinuous locations in physical memory or a secondary storage device |
| hypervisor | An OS that enables dividing a single physical computer or cluster into multiple virtual machines |
| indirect addressing or relative addressing | a method of computing physical memory addresses automatically; the CPU adds the process offset to all memory address operands before accessing memory |
| kernal | The OS layer that manages resources and interacts with hardware; includes a resource allocation layer and interface programs called device drivers |
| least significant byte | In storage bytes, the rightmost byte in a multiple-byte data item containing digits of the lowest weight |
| little endian | A CPU or memory architecture in which the least significant byte is stored at the lowest memory address |
| memory allocation | the assignment of specific memory addresses to system software, application programs, threads and processes, and data |
| most significant byte | in storage bytes, the leftmost byte in a multiple-byte data item containing digits of the highest weight |
| multitasking | an OS's support for running multiple programs simultaneously |
| multithreaded | a process or program divided into two or more threads, each of which can be scheduled and executed independently |
| non contiguous memory allocation | a memory allocation scheme in which portions of a process can be allocated to free partitions anywhere in memory; uses small fixed-size partitions |
| offset register | a register containing the process offset value; used in indirect addressing |
| page | a small fixed-size portion of a program, normally between 1 and 4 KB, swapped between primary and secondary storage |
| page fault | a reference to a page used in virtual memory management |
| page file or swap space or swap file | secondary storage region reserved for the task of holding pages not held in memory; it's divided into page frames in the same manner as memory |
| page frame | a memory page used in virtual memory management |
| page hit | a reference to a page held in main memory |
| page tables | Tables that store information about page locations, allocated page frames, and secondary storage space |
| parent process | the original process that initiates and controls execution of a child process |
Created by:
rteague2566