OS / Linear Programming
Prof.Huda.Azizτ1 = (70, 26, 70), τ2 = (84, 31, 84), τ1 = (60, 11, 60) where t1, t2 and t3 are period, computation time and deadlines respectively. Find an arbitrary non-preemptive schedule of the tasks. To make the problem simple, it is assume that the first instance of the three tasks {τ1, τ2, τ3} are invoked at time zero. Try to use integer linear programming framework to find the schedule.
Hint: Find the LCM of all the periods and devise constraints for every deadline requirement within the LCM period.
- 9 years ago
- 13
Answer(1)
Purchase the answer to view it
- schedule.docx
Bids(1)
other Questions(10)
- ECO 500: Excel Assignment One
- Expected Value and Consumer Choices
- mathss
- bus 402
- ACCT 346 Discussions All Weeks - DeVry
- ACCT 346 Week 3 Quiz - DeVry
- GEN 480 Week 2 Learning Team Assignment Skills Assessment Paper (UOP Course)
- ACCT 346 Week 6 Quiz (2 Sets)
- LASA 2- Critiquing an Article
- Lean Inventory Management