Skip to main content\(\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 2.3 CPU Scheduling
Practice 2.3.1.
This chapter will be making a series of assumptions about the workload required of the system. Select all that apply.
All the jobs appear in the system at the same time.
-
All the jobs are requested from the same user.
No the users don’t matter for this book section at all
We know ahead of time how long a process will take to complete.
-
All the jobs involve some I/O.
In fact the assumption is no I/O.
Jobs are not to be interrupted once they start.
-
Jobs all take the same amount of time to run.
-
Practice 2.3.2.
Practice 2.3.3.
What type of metric is
turnaround time?
A fairness metric.
-
A performance metric.
-
A security metric.
-
Read section 7.3 about the first-come-first-served scheduling approach.
Practice 2.3.4.
Which of the following workloads would result in poor average turnaround times?
A large job arrives first, followed by a number of small jobs.
-
Some small jobs arrive first, followed by large job.
-
Many jobs of the same size arrive at once.
-
Read section 7.4, about the shortest-job-first scheduling.
Practice 2.3.5.
Read section 7.5, about the shortest-to-completion-first scheduling approach, and relaxing the "job runs to completion" assumption.
Practice 2.3.6.
Read sections 7.6 and 7.7 about the
response time metric and the
round robin scheduling approach.
Practice 2.3.7.
Read the rest of chapter.
