Chp 3 - CGS3263

CPU-bound jobs (such as printing a series of documents) have many brief CPU cycles and long I/O cycles.

False

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

False

____ 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

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

Natural

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler.

READY

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

Thread

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.

Thread Control Block

A processor is also known as a CPU.

True

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

True

Context switching is required by all preemptive algorithms.

True

It is possible to minimize response time by running only interactive jobs and letting batch jobs wait until the interactive load ceases.

True

Most computer programs alternate between CPU cycles and I/O cycles.

True

The Job Scheduler seeks to ____ when scheduling jobs.

balance CPU and I/O intensive jobs

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

Answer: 6.25

Assume that four jobs, A-D, require the CPU cycles listed below. Using the SJN algorithm, the average turnaround time is ____. Job: A B C D CPU cycle: 5 2 6 4

Answer: 9.0

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

Answer: B

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

Earliest Deadline First

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

False

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

False

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.

HOLD to READY