Exam 4: Processor Management

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

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.

Free
(Multiple Choice)
4.9/5
(36)
Correct Answer:
Verified

D

Some systems use a strategy known as ____ to increase the priority of jobs that have been in the system for an unusually long time in order to expedite their exit.

Free
(Multiple Choice)
4.9/5
(32)
Correct Answer:
Verified

B

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

Free
(Multiple Choice)
4.9/5
(40)
Correct Answer:
Verified

A

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

(Multiple Choice)
4.8/5
(40)

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

(Multiple Choice)
4.7/5
(27)

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

(Multiple Choice)
4.8/5
(40)

Assume that four jobs,A-D,are in the READY queue at Time 0 and require the CPU cycles listed below.Using the SJN algorithm,the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4

(Multiple Choice)
4.7/5
(37)

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
(36)

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
(39)

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

(Multiple Choice)
4.9/5
(34)

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

(Multiple Choice)
5.0/5
(35)

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
(41)

An I/O request is called a(n)____ wait in multiprogramming environments.

(Multiple Choice)
4.8/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.8/5
(34)

When using a multiple-level queue strategy,aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

(True/False)
4.8/5
(29)

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

(True/False)
4.9/5
(38)

When using priority scheduling,priorities are assigned to jobs by the owner of the job (the user).

(True/False)
4.8/5
(37)

When a job is accepted by the system,it's put on ____ and placed in a queue.

(Multiple Choice)
4.7/5
(32)

A general rule of thumb for selecting a proper time quantum in Round Robin scheduling is that it should be long enough to allow ____ percent of the CPU cycles to run to completion.

(Multiple Choice)
4.9/5
(38)

Assume that jobs A-D arrive in the READY queue in quick succession and have the CPU cycle requirements listed below.Using the SRT algorithm,the average turnaround time is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 6 3 1 4

(Multiple Choice)
4.9/5
(35)
Showing 1 - 20 of 40
close modal

Filters

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