- Information
- AI Chat
1n2quizlet - quiz
Operating Systems (CSG1102)
Edith Cowan University
Recommended for you
Preview text
- ___ allows for faster turnaround of CPU- bound jobs
variable time quantum per queue
2.___ allows separate partitions of a single server to support different operating systems
virtualization
3 compacting and relocating, the memory manager optimizes the use of memory and improves throughput. However, it requires more ___ than the other memory allocation schemes discussed in this chapter
overhead
4 memory is divided into blocks of equal size called ___
slots
5 ____ chip holds software that is used to start the computer
ROM
6 ___ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts
belady anomaly
- A disadvantage of segmented memory allocation is ___
external fragmentation
8 thread in a process is represented by a data structure called a ___ that contains basic information such as a threads unique identification, state, and priority
Thread Control Block
- each thread in a process is represented by a data structure called a ___ that contains basic information such as the threads unuique identification, state, and priority
thread control block
10.___ effectively removes restrictions on maximum program size
virtual memory
11 first-come first-serve algorithm is fine for most ___ systems
batch
12 fixed partition scheme works well when all jobs are of similar size
13 four memory management techniques presented in this chapter share the requirement that the entire program being executed must be _____
loaded into memory
14 goal of the ___ memory algorith is to find the smallest block of memory into which a job will fit
best-fit
15 hybrid system is a combination of ____and ____ systems
batch and interractive
16 ____ in a busy list occurs when a memory block between two other busy memory blocks is returned to the free list.
null entry
- In a paged memory allocation scheme, a simple ___ has one entry for each page frame that shows its location and its free/busy status
memory map table
18 a paged memory allocation scheme, the ___ contains two values for each active job: the size of the job and the memory location where its page map table is stored
job table
19 a relocatable dynamic partition scheme, the ___ ensures that, during execution, a program wont try to access memory locations that dont belong to it
bounds register
20 a single user system, jobs are processed ____
sequentially
21 demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ___
working set
22 demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ___
thrashing
23 paged memory allocation scheme, a page size that is too small will generate ___
very long Page Map Tables 24 the fixed-partition memory management scheme, the table that the memory manager uses to keep track of jobs is composed of the
partition size, memory address, access, and status 25 I/O request in called a ___ wait in multi programming environmets
natural
26.___ is a dynamic-priority preemptive scheduling algorithm built to address the critical processing requirements f real-time systems and their pressing deadlines
earliest deadline first
27 ___ is created by a process, and it can be scheduled and executed independently of its parent process
thread
28 job scheduler seeks to ___ when scheduling jobs
balance CPU and I/O intensive jobs 29.___ means that several logical records are grouped within one physical record
blocking
30 ___ method keeps the free/busy lists organized by memory locations, from low- order memory to high-order memory
first-fit memory allocation
Operating Systems Lessons 1 and 2
Study online at quizlet/_wbd5l
31 most common mechanism for introducing multiprogramming was the introduction of the ____ concept, whereby the CPU was notified of events needing operating system services.
interrupt
32 name for the core portion of an operating system is the ____
kernel
33 movement between queues is a very simple policy that rewards those who have ___ jobs
high priority
34.____ of memory is performed by the operating system to reclaim fragmented sections of memory space
Compaction
35 of the most important innovations of demand paging is that it makes ___ feasible
virtual memory
36 ___ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest
FIFO
37 phenomenon of less-than- complete use of memory space in a fixed partition is called____
internal fragmentation
38 primary advantage of storing programs in non-contiguous locations is that ________
main memory is used more efficiently
39 process scheduler assigns the CPU to execute the processes for those jobs placed on the ___ queue by the job schedular
ready
40 purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time. This purpose is similar to that of the ____ of a web browser
bookmark file
41.___ requires that the processor be allocated to each job or to each process for a period of time and de- allocated at an appropriate moment
Multiprogramming
42 systems use a strategy known as ___ to increase the priority of all jobs that have been in the system for an unusually long time in order to expedite their exit
aging
43 in the 1950's, to reduce discrepency between the I/O and the CPU, and interface called the____ was placed between them to act as a buffer.
control unit
44 system with ___ divides programs into parts and keeps them in secondary storage, bringing each part into memory only as it is needed
virtual memory
45___ is often very different from one operating system to the next, sometimes even between different versions of the same operating system
user interface
46 transition from ___ can be initiated by the process scheduler and the job scheduler
Running and finished 47 transition from ____ to ___ can be initiated by the process scheduler or the job scheduler.
Running to finished 48 transition from ___ to ___ is initiated by the Job scheduler according to some predefined policy. At this point, the availibility of enough main memorty and any requested devices is checked
hold to ready
49 ___ uniquely identifies each resource, starts its operation, monitors its progress, and, finally deallocates it, making the operating system availible to the next waiting process
device manager
50 variation of the LRU page replacement algorithm known as the ___ replacement policy is implemented with a circular queue
clock page
51 a job is accepted by the system, its put on ____ and placed in a queue
hold
52 reading an instruction, the operating system can tell the ___ of each group of digits by its location i the line and the operation code
function
53 ___ operating systems, users can think they are working with a system using one processor, when in fact they are connected to a cluster of many processors working closely together
distributed
54 segmented memory allocation, each job is divided into several ___ of different sizes, one for each module that contains pieces that perform related functions
segments
55 the developement of ___ technology, a single chip was equipped with two or more processor cores.
multicore
56 word ___ is used to indicate that a program is permanently held in ROM, as opposed to being held in secondary storage
firmware
1n2quizlet - quiz
Course: Operating Systems (CSG1102)
University: Edith Cowan University
