Computers and Technology, 05.11.2020 18:50, 713073

Assume a computer with three parallel processors CPU1, CPU2 and CPU3. A sequence of jobs J is submitted to this computer where J[i] is the time it takes to execute job i in miliseconds (suppose the performance of each processor is equal). Given a sequence of jobs J ={10, 3, 11, 18, 6, 14, 5, 20, 15} what will be the earliest finish time of all jobs in J when: A) Jobs are distributed to whichever processor is available in arrival order.
B) Jobs are distributed to whichever processor is available by selecting the shortest job first each time.
C) Jobs are distributed to whichever processor is available by selecting the longest job first each time.
D) Compare finish times you computed in 2A through 2C. Can you propose a better algorithm? How? Please explain and compute the earliest finish time of your proposed solution
Note: While assigning jobs, always consider the processors in the order first CPU, then CPU2 and then CPU3.

Answers: 3

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 22.06.2019 05:00, 420420blazee

Are special characters that allow you to search for multiple words at the same time.

Answers: 2

continue

Computers and Technology, 22.06.2019 16:30, sayedaly2096

What type of file does a cookie place on web site visitors' computers so that web site managers can customize their sites to their visitors' preferences?

Answers: 1

continue

Computers and Technology, 22.06.2019 18:30, cascyrio2002

What is outfitting a workplace with video in a technology

Answers: 2

continue

Computers and Technology, 23.06.2019 09:30, shadowsnake

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab

Answers: 2

continue

Do you know the correct answer?

Assume a computer with three parallel processors CPU1, CPU2 and CPU3. A sequence of jobs J is submit...