Consider a task set consisting of eight jobs J = J1, J2, ..., J8, sorted by decreasing has the highest priority, J8 the lowest). The jobs are subject to precedence constraints ribed in the diagram below. Computation times are indicated in outside of each node.
Consider a task set consisting of eight jobs J = J1, J2, ..., J8, sorted by decreasing has the highest priority, J8 the lowest). The jobs are subject to precedence constraints ribed in the diagram below. Computation times are indicated in outside of each node.
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
Related questions
Question
Asap please
![Section Consider a task set consisting of eight jobs J = J1, J2,
J8, sorted by decreasing
priorities (J1 has the highest priority, J8 the lowest). The jobs are subject to precedence constraints
that are described in the diagram below. Computation times are indicated in outside of each node.
1
1
2
J1
J2
2
J3
J4
1
2
1
J5
J6
J7
1
➜ J8
Assume this task set is executed on a parallel machine with two processors, where the highest priority
task is assigned to the first available processor.
(a) Draw out the resulting schedule.
(b) What is the global completion time of the scheduled tasks?
(c) Choose and indicate one of the following to modify: number of processors, precedence relationship,
task completion time(s). Describe how you modified one of these items and then (be as specific as
possible), reschedule the tasks.
(d) How does your new completion time of all of the tasks compare to the previous completion time?
(e) Did you discover/find an anomaly or not? If so, what was it.
(f) Does real-time mean fast? [Yes/No/Maybe]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0a997a6f-a222-4716-adb9-ab223c542cab%2Fb60896fc-8505-4624-82be-b47ba3e967b5%2Fe6hwkyi_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Section Consider a task set consisting of eight jobs J = J1, J2,
J8, sorted by decreasing
priorities (J1 has the highest priority, J8 the lowest). The jobs are subject to precedence constraints
that are described in the diagram below. Computation times are indicated in outside of each node.
1
1
2
J1
J2
2
J3
J4
1
2
1
J5
J6
J7
1
➜ J8
Assume this task set is executed on a parallel machine with two processors, where the highest priority
task is assigned to the first available processor.
(a) Draw out the resulting schedule.
(b) What is the global completion time of the scheduled tasks?
(c) Choose and indicate one of the following to modify: number of processors, precedence relationship,
task completion time(s). Describe how you modified one of these items and then (be as specific as
possible), reschedule the tasks.
(d) How does your new completion time of all of the tasks compare to the previous completion time?
(e) Did you discover/find an anomaly or not? If so, what was it.
(f) Does real-time mean fast? [Yes/No/Maybe]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Step 1: Introduction on parallel processing of tasks
VIEWStep 2: a) Resulting schedule
VIEWStep 3: b) Global completion time of scheduled tasks
VIEWStep 4: c) Reschedule the tasks using task completion time(s)
VIEWStep 5: d) New completion time
VIEWStep 6: e) Anomaly-Yes or No
VIEWStep 7: f) Real-time mean
VIEWSolution
VIEW
Trending now
This is a popular solution!
Step by step
Solved in 8 steps with 9 images
Recommended textbooks for you
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.