You have one supercomputer and ʼn normal computers on which you need to run n jobs. Each job i first spends s; time on the supercomputer and then n; time on the normal computer. A job can only start running on any of the normal computers after it has finished on the supercomputer. However, as soon as any job finishes on the supercomputer, it can immediately start on one of the free normal computers. The goal is to finish running all the jobs as soon as possible. Note that since there is only one supercomputer, you'll always have to wait 1 Si time so that the jobs finish running on the supercomputer. However, you can optimize when you run the jobs on the normal computers to try to finish running all the jobs as soon as possible. i=n Show that by executing jobs after sorting them in decreasing order by ni, you have an optimal schedule.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Subject -CSE
You have one supercomputer and n normal computers on which you need to run n jobs. Each
job i first spends s; time on the supercomputer and then ni time on the normal computer.
A job can only start running on any of the normal computers after it has finished on the
supercomputer. However, as soon as any job finishes on the supercomputer, it can immediately
start on one of the free normal computers. The goal is to finish running all the jobs as soon as
possible. Note that since there is only one supercomputer, you'll always have to wait si
time so that the jobs finish running on the supercomputer. However, you can optimize when you
run the jobs on the normal computers to try to finish running all the jobs as soon as possible.
i=n
Show that by executing jobs after sorting them in decreasing order by nį, you have an optimal
schedule.
Transcribed Image Text:You have one supercomputer and n normal computers on which you need to run n jobs. Each job i first spends s; time on the supercomputer and then ni time on the normal computer. A job can only start running on any of the normal computers after it has finished on the supercomputer. However, as soon as any job finishes on the supercomputer, it can immediately start on one of the free normal computers. The goal is to finish running all the jobs as soon as possible. Note that since there is only one supercomputer, you'll always have to wait si time so that the jobs finish running on the supercomputer. However, you can optimize when you run the jobs on the normal computers to try to finish running all the jobs as soon as possible. i=n Show that by executing jobs after sorting them in decreasing order by nį, you have an optimal schedule.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Probability Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education