1n2quizlet - quiz PDF

Preview

Summary

quiz...

Description

Operating Systems Lessons 1 and 2 Study online at quizlet.com/_wbd5l 1.

___ allows for faster turnaround of CPUbound jobs

variable time quantum per queue

2.

___ allows separate partitions of a single server to support different operating systems

virtualization

By 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

Cache memory is divided into blocks of equal size called ___

slots

A ____ chip holds software that is used to start the computer

ROM

3.

4.

5.

6.

The ___ demonstrates that when using a FIFO belady policy, in rare cases, adding more memory anomaly to a system can cause an increase in page interrupts

7.

A disadvantage of segmented memory allocation is ___

8.

each thread in a process is represented by a Thread Control Block data structure called a ___ that contains basic information such as a threads unique identification, state, and priority

17.

In a paged memory allocation scheme, a simple ___ has one entry for each page frame that shows its location and its free/busy status

18.

In a paged memory allocation scheme, the ___ job table contains two values for each active job: the size of the job and the memory location where its page map table is stored

19.

bounds In a relocatable dynamic partition scheme, register the ___ ensures that, during execution, a program wont try to access memory locations that dont belong to it

20.

in a single user system, jobs are processed ____

sequentially

21.

In 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.

In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ___

thrashing

23.

in paged memory allocation scheme, a page size that is too small will generate ___

very long Page Map Tables

24.

In 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.

an 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

external fragmentation

memory map table

9.

each thread in a process is represented by a thread data structure called a ___ that contains control block basic information such as the threads unuique identification, state, and priority

10.

___ effectively removes restrictions on maximum program size

virtual memory

11.

The first-come first-serve algorithm is fine for most ___ systems

batch

12.

the fixed partition scheme works well when

all jobs are of similar size

13.

the four memory management techniques presented in this chapter share the requirement that the entire program being executed must be _____

loaded into memory

27.

A ___ is created by a process, and it can be thread scheduled and executed independently of its parent process

14.

The goal of the ___ memory algorith is to find the smallest block of memory into which a job will fit

best-fit

28.

The job scheduler seeks to ___ when scheduling jobs

15.

A hybrid system is a combination of ____and ____ systems

batch and interractive

balance CPU and I/O intensive jobs

16.

A ____ in a busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

null entry

29.

___ means that several logical records are grouped within one physical record

blocking

30.

The ___ method keeps the free/busy lists organized by memory locations, from loworder memory to high-order memory

first-fit memory allocation

31.

interrupt The most common mechanism for introducing multiprogramming was the introduction of the ____ concept, whereby the CPU was notified of events needing operating system services.

44.

A 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.

The___ is often very different from one operating system to the next, sometimes even between different versions of the same operating system

user interface

32.

The name for the core portion of an operating system is the ____

kernel

33.

no movement between queues is a very simple policy that rewards those who have ___ jobs

high priority

46.

The transition from ___ can be initiated by the process scheduler and the job scheduler

Running and finished

34.

____ of memory is performed by the operating system to reclaim fragmented sections of memory space

Compaction

47.

the transition from ____ to ___ can be initiated by the process scheduler or the job scheduler.

Running to finished

48.

35.

One of the most important innovations of demand paging is that it makes ___ feasible

virtual memory

hold to ready

36.

The ___ 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

The 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

49.

device manager

The phenomenon of less-thancomplete use of memory space in a fixed partition is called____

internal fragmentation

The ___ uniquely identifies each resource, starts its operation, monitors its progress, and, finally deallocates it, making the operating system availible to the next waiting process

50.

clock page

The primary advantage of storing programs in non-contiguous locations is that ________

main memory is used more efficiently

A variation of the LRU page replacement algorithm known as the ___ replacement policy is implemented with a circular queue

51.

When a job is accepted by the system, its put on ____ and placed in a queue

hold

39.

The process scheduler assigns the CPU to execute the processes for those jobs placed on the ___ queue by the job schedular

ready

52.

When reading an instruction, the operating function system can tell the ___ of each group of digits by its location i the line and the operation code

53.

The 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

with ___ 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

40.

54.

segments

___ requires that the processor be allocated to each job or to each process for a period of time and deallocated at an appropriate moment

Multiprogramming

With segmented memory allocation, each job is divided into several ___ of different sizes, one for each module that contains pieces that perform related functions

55.

multicore

Some 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

With the developement of ___ technology, a single chip was equipped with two or more processor cores.

56.

The word ___ is used to indicate that a program is permanently held in ROM, as opposed to being held in secondary storage

firmware

Starting 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

37.

38.

41.

42.

43....