subject
Computers and Technology, 16.03.2020 19:23 ezy53

There are n tasks to complete. Each task first needs to be preprocessed on a supercomputer and then finished on one of n processors. Task i requires pi seconds of preprocessing on the supercomputer followed by fi seconds on some processor to complete. Note that tasks are fed to the supercomputer sequentially but can be executed in parallel on different processors once they have been preprocessed. The process terminates when all tasks have been completed. The duration of the process is the total time until termination. Give an efficient algorithm that determines an ordering of the tasks for the supercomputer that minimizes the duration of the process, as well as the minimum duration.

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 23.06.2019 07:00
Why is investing in a mutual fund less risky than investing in a particular company's stock? a. mutual funds only invest in blue-chip stocks. b. investments in mutual funds are more liquid. c. mutual funds hold a diversified portfolio of stocks. d. investments in mutual funds offer a higher rate of return.
Answers: 2
question
Computers and Technology, 24.06.2019 02:30
Which option completes the explanation for conflict of interest in an organization
Answers: 1
question
Computers and Technology, 24.06.2019 21:50
Maddie is traveling to india and would like to document her trip for friends and family to access online. what tool would be best? app blog listserver web page
Answers: 1
question
Computers and Technology, 25.06.2019 15:00
Most lo/to hazards occur under the following circumstances, except: a) regular operation b) maintenance c) cleaning d) repair
Answers: 2
You know the right answer?
There are n tasks to complete. Each task first needs to be preprocessed on a supercomputer and then...
Questions
question
Biology, 22.05.2020 23:08
question
Biology, 22.05.2020 23:08
question
Biology, 22.05.2020 23:08
question
Biology, 22.05.2020 23:08
question
Mathematics, 22.05.2020 23:08
Questions on the website: 13722367