Exercises 29 through 32 refer to a project consisting of 11 tasks (A through K) with the following processing times (in hours): A ( 10 ) , B ( 7 ) , C ( 11 ) , D ( 8 ) , E ( 9 ) , F ( 5 ) , G ( 3 ) , H ( 6 ) , I ( 4 ) , J ( 7 ) , K ( 5 ) . a. Explain why a schedule with N = 10 processors must have finishing time Fin ≥ 11 hours. b. Explain why it doesn’t make sense to put more than 10 processors on this project.
Exercises 29 through 32 refer to a project consisting of 11 tasks (A through K) with the following processing times (in hours): A ( 10 ) , B ( 7 ) , C ( 11 ) , D ( 8 ) , E ( 9 ) , F ( 5 ) , G ( 3 ) , H ( 6 ) , I ( 4 ) , J ( 7 ) , K ( 5 ) . a. Explain why a schedule with N = 10 processors must have finishing time Fin ≥ 11 hours. b. Explain why it doesn’t make sense to put more than 10 processors on this project.
Solution Summary: The author explains that a schedule with N=10 processors must have finishing time for the given tasks because the task C requires 11 hours to complete.
Exercises 29through 32 refer to a project consisting of 11 tasks (A through K) with the following processing times (in hours):
A
(
10
)
,
B
(
7
)
,
C
(
11
)
,
D
(
8
)
,
E
(
9
)
,
F
(
5
)
,
G
(
3
)
,
H
(
6
)
,
I
(
4
)
,
J
(
7
)
,
K
(
5
)
.
a. Explain why a schedule with
N
=
10
processors must have finishing time
Fin
≥
11
hours.
b. Explain why it doesn’t make sense to put more than 10 processors on this project.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning