Exam 4: Processor Management

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

Each thread in a process is represented by a data structure called a ____ that contains basic information such as the thread's unique identification,state,and priority.

(Multiple Choice)
4.8/5
(32)

No movement between queues is a very simple policy that rewards those who have ____ jobs.

(Multiple Choice)
4.8/5
(39)

The control program that handles the interruption sequence of events is called the event scheduler.

(True/False)
4.9/5
(37)

The ____ is also called a high-level scheduler.

(Multiple Choice)
4.7/5
(31)

If one job monopolizes the system,the extent of its overall effect on system performance depends on the scheduling policy and whether the job is CPU-bound or I/O-bound.

(True/False)
4.9/5
(43)

A(n)____ is created by a process,and it can be scheduled and executed independently of its parent process.

(Multiple Choice)
4.8/5
(38)

____ is a dynamic-priority preemptive scheduling algorithm built to address the critical processing requirements of real-time systems and their pressing deadlines.

(Multiple Choice)
4.9/5
(39)

Dual core or quad core multi-core chips are larger than a single-processor chip but produce less current leakage and heat.

(True/False)
4.9/5
(43)

The Processor Manager is a composite of at least two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

(True/False)
4.8/5
(40)

A program is an active entity that requires a set of resources,including a processor and special registers,to perform its function.

(True/False)
4.8/5
(38)

When the operating system detects a nonrecoverable error,the following step is performed first by the interrupt handler: ____.

(Multiple Choice)
4.8/5
(35)

In Round Robin scheduling,if processing isn't finished when time expires,the job is preempted and put at the end of the READY queue and its information is saved in its Process Control Block.

(True/False)
4.9/5
(39)

The transition from ____ can be initiated by the Process Scheduler or the Job Scheduler.

(Multiple Choice)
4.8/5
(42)

Shortest job next (SJN)is a nonpreemptive scheduling algorithm (also known as shortest job first,or SJF)that handles jobs based on the length of their CPU cycle time.

(True/False)
4.9/5
(35)

The first-come,first-served (FCFS)algorithm is fine for most ____ systems.

(Multiple Choice)
4.8/5
(41)

Context switching is required by all preemptive algorithms.

(True/False)
4.8/5
(31)

A job's state moves from HOLD to WAITING when it's ready to run but is waiting for the CPU.

(True/False)
4.9/5
(40)

The transition from ____ is initiated by the Job Scheduler according to some predefined policy.At this point,the availability of enough main memory and any requested devices is checked.

(Multiple Choice)
4.8/5
(44)

Web browsers use multithreading routinely.For example,one thread can retrieve images while another sends and retrieves e-mail.

(True/False)
4.9/5
(38)

As a process moves through the system,its status changes.Possible process statuses include FINISHED,HOLD,READY,RUNNING,and WAITING.

(True/False)
4.7/5
(40)
Showing 21 - 40 of 40
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)