A Mathematical View of Our World. 1 st ed. Parks, Musser, Trimpe, Maurer, and Maurer. Chapter 7. Scheduling. Section 7.1 Basic Concepts of Scheduling. Goals Study project scheduling Study tasks Find finishing times Study weighted digraphs Study maximal paths Find critical times.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Parks, Musser, Trimpe, Maurer, and Maurer
Choose the list of tasks that has no preference relations.
a. bake the pizza, grate some cheese, make pizza sauce
b. fold some clothes, wash some clothes, hang clothes on the line to dry
c. bake the cake, toss the green salad, set the table
d. frost the cake, bake the cake, set the table
Identify all sources and sinks.
a. Sources: put on socks; Sinks: put on hat
b. Sources: put on hat, put on coat, strap on
snowboard; Sinks: put on socks, put on sweatshirt
c. Sources: put on hat; Sinks: put on socks
d. Sources: put on socks, put on sweatshirt;
Sinks: put on hat, put on coat, strap on snowboard
Which path listed below is not a maximal path?
a. put on hat
b. put on pants, put on boots
c. put on sweatshirt, put on coat
d. put on socks, put on pants, put on boots, strap on snowboard
Create the decreasing-time priority list for the project whose digraph is shown below.
Given the priority list
and the digraph for the project, which tasks will be assigned first if there are 3 processors?
a. Processor 1: Task 4; Processor 2: Task 1; Processor 3: Task 8
b. Processor 1: Task 1; Processor 2: Task 4; Processor 3: Task 6
c. Processor 4: Task 1; Processor 2: Task 1; Processor 3: Task 6
d. Processor 1: Task 1; Processor 2: Task 4; Processor 3: Task 8
Find the critical-path priority list for the project.
Suppose the critical-path algorithm is being used to schedule a project using 3 processors. The priority list is . At 2 minutes, the status is that Processors 1 and 2 are both working on task, while Processor 3 is idle. What should happen at this point?
a. Processor 3 is assigned
b. Processor 3 is assigned
c. Processor 3 is assigned
d. Processor 3 remains idle.