Understanding Operating Systems chapter 2

Study online at quizlet.com/_7z5lcm

1. Address A number that designates a location in 15. Relocatable A memory allocation scheme in which the
memory. dynamic system relocates programs in memory to
partitions gather all of the empty blocks are compacted
2. Best fit A memory allocation scheme that considers
into one block large enough to accommodate
memory all free blocks of memory and selects the
one or all of the jobs waiting for memory.
allocation one that will result in the least amount of
wasted space. 16. Relocation (1) The process of moving programs from one
area of memory to another or (2) process of
3. Bound A register used to store the highest memory
adjusting address reference in a program using
register location legally accessible by a program.
software of hardware, so that a program
4. Compaction The process of collecting available executes correctly when loaded into different
fragments of memory into continuous blocks areas of memory.
by moving programs and data in computer's
17. Relocation A register that contains the value that must be
memory or disk. Also known as garbage
register added to an address referenced by a program
collection.
so that it will be able to access the correct
5. De-allocation The process of freeing an allocated memory address after relocation.
resources whether memory space, files, a
18. Static Another name for fixed partitions.
CPU or a device.
partition
6. Dynamic A main memory allocation scheme where
memory jobs are given as much space as the request
allocation when they are loaded for processing,
thereby creating their own partition in main
memory.
7. External A situation where dynamic allocation of
fragmentation memory creates unusable fragments of free
space in between busy or allocated blocks
of memory.
8. first-come, A non-preemptive process scheduling policy
first-served that handles jobs according to their arrival
(FCFS) time; the first job in the READY queue is
processed first.
9. First-fit A memory allocation scheme that searches
memory from the beginning of the free blocks list and
selects for allocation the first block large
enough to satisfy the request.
10. Fixed sized A memory allocation scheme where
partitions memory is sectioned, with portions assigned
to each program.
11. Internal A situation where a fixed sized partition is
Fragmentation only partially used by the program. The
remaining space within the partition is
unavailable to other programs and is
therefore wasted.
12. Kilobyte A unit of memory or storage space equal to
1024 or 2 ^ 10 bytes.
13. Main memory The unit that works directly with the CPU
and in which instructions and data must
reside so they can be processed. Also
known as random access memory (RAM),
primary storage and internal memory.
14. Null Entry An empty entry in a list.