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. =n i=1 Show that by executing jobs after sorting them in decreasing order by nį, you have an optimal schedule.

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. =n i=1 Show that by executing jobs after sorting them in decreasing order by nį, 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

See similar textbooks

Related questions

Q: You are planning an outing with some friends and need to calculate the total price of the tickets. A…

A: Given data, Write a program in a file named tickets.py Some of the friends planning an outing and…

Q: Can you please give an example of a Java code using the recursion method to call a method named…

A: Define a function calculateProduct that takes an integer n as its parameter.Check if n is equal to…

Q: Exercise 2 Write a Java application that computes the sum of even numbers and the product of odd…

A: Even numbers are those numbers that yield 0 as the remainder when divided by 2. Odd numbers are…

Q: Given the sequence, S2 = 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, … Write a RECURSIVE method called…

A: note: since the question only has details for sequence2. so only that is implemented here public…

Q: JAVA Program For this program you should not use a while loop. Instead try to write a recursive…

A: I have provided JAVA CODE along with CODE SCREENSHOT and OUTPUT SCREENSHOT...

Q: 1-)Optic Cup Segmentation

A: Optic cup segmentation:- CODE:- import os import numpy as np import time import sys import pandas…

Q: 7. Variation of the nine tails problem) In the nine tails problem, when you flip a coin, the…

A: Step-1) First, import the Random library and set the size of the grid n=5. Step-2) Then,…

Q: You have to take a list of non negative integers, print an integer list of the rightmost digits.…

A: Required:- You have to make a list of non-negative integers, print an integer list of the rightmost…

Q: We come across lots of people daily. We make acquaintances and friends. We get their contacts to…

A: Python Phone book Program uses files to provide the following functions: You can add new contact…

Q: Write factorial1 function in python 3.8 follow the directions provided below, don't need anything…

A: Given : Function: factorial1 The function implements an iterative factorial. It takes an…

Q: 1. Consider the following code segment: for (int i = 200; i > 0; i /= 3) { } if (i % 2 == 0)…

A: Answer: Option C: 200 66 22 2

Q: Practice these steps again and then solve the set of loop problems. These problems are more…

A: Here, we have used for loop and if-else statements to implement the required functions. For loop is…

Q: Write a recursive solution to the problem below. You MUST use only one method, and that method must…

A: I have done the code using Java language, make sure you are on latest version of java. I have…

Question

You need to write how you would implement your algorithm

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 si
i=1
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.

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions

Write this program in Java using a custom method. Implementation details You will implement this program in a specific way in order to gain some experience with loops, arrays and array lists. Use an array of strings to store the 4 strings listed in the description. Use a do-while loop for your 'game engine'. This means the game starts once the user enters money. The decision to stop occurs at the bottom of the loop. The do-while loop keeps going until the user quits, or there is no money left. The pseudocode for this 'game engine' is shown below: determine the fruits to display (step 3 below) and print them determine if there are 3 or 4 of the same image display the results update the customer balance as necessary prompt to play or quit continue loop if customer wants to play and there's money for another game. Use the Random class to generate a random number between 0 and 3. This random number will be an index into the array of strings. Add the string at that index to an…
Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…
Java program I need help creating a program that creates a Christmas tree. It has a method that accepts two parameters (one for the number of segments and one for the height of each segment). The left tree has 3 segments with a height of 4 and the right one has two segments with a height of 5. Can you explain how the for loops would work?
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Question: Your task is to find the number of ways that you can put those brackets in such a way that they will be always balanced after taking the n pair of brackets from the user in Java Language.
Please explain the questions related to the code below: //1. Why is 20 printed 3 times and why does it start with 1, but end with 2? //2. What is the base case for this recursive method and why? //3. How would you implement this using a loop? //4. What is each if statement checking? //5. Would a solution to this using loops require more or less code and would it be more or less effecient? //6. Why is recursion a good choice to solve this problem? //7. How can recursion become infinite? //8. When is recursion appropriate? /* Load the code below into a cloud compiler and run each method one at a time by removing the comments for the method. Walk through the code as a group and explore how the code works. Submit the answers to the numbered questions for credit. */ public class DemoRecur { //Simple statement designed to show control flow in recursion public static void printDemo(int x, int max) {…
JAVA: Which is/are correct statement(s) about the Recursion? (Select all that apply) We can use for loop and while loop in recursion. We solve a problem that depends on solving smaller occurrences of the same problem. We have high performance while using recursion rather than iteration. We have high performance while using iteration rather than recursion. Easy to implement the algorithm while using recursion but hard to find the time complexity. Easy to implement the algorithm while using iteration but hard to find the time complexity. Base case is a simple occurrence that cannot be answered directly. Recursive case is a more complex occurrence of the problem that cannot be directly answered, but can instead be described in terms of smaller occurrences of the same problem. We must have exact one base case and one recursive case. We must have at least one base case. We must have at least one recursive case.