Job Scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, ..., tn, for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?

Job Scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, ..., tn, for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?

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

Similar questions

AN EXAMPLE OF THE Dynamic Partitioning Memory Allocation Algorithm using First Fit is PRESENTED in the following table. Example for First-Fit TASK 1 2 3 4 5 BEST FIT SIZE STATE 50 EXECUTION 30 EXECUTION 120 WAIT 80 WATI 25 EXECUTION WORST FIT BLOCK SAWNP 1 2 3 4 5 P.D. EXPLAIN STEP AND CALCULATION TO DO THIS SIZE STATE 120 BUSY 80 BUSY 40 BUSY 50 FREE 30 FREE TASK 1 2 5 SIZE T. Then under the previous format and the same data is to perform the following two algorithms 50 30 25 WASTE 70 50 15 50 30 215 fragmentation FRAGMENTATION CALCULATIONS 元 50 15 70 135
ans in 15 min
Answer the following questions about Monte Carlo problems and pseudo-random number generators (PRNGs). Pick the best answer for each item. A PRNG will always eventually repeat itself - this is called A method of creating PRNG for parallel applications is for each task to take only every Pth random number (P is the number of processors). A PRNG that has only one work of state is A matrix whose diagonal elements sre an order of magnitude higher than the rest We want to be able to rerun with the exact same random numbers - we care about The theory behind Monte Carlo methods Reproducibility [Choose ] [Choose] Linear Congruential Reproducibility Diagonally Dominant Leapfrog Method Uniform distribution cycles Lagged Fibonaci Mean Value Theorem Sequence Splitting Method Manager Worker Method Uncorrelated [Choose] [Choose]
A medical Centre can have many doctors. A doctor can be scheduled for many appointments but may not have any scheduled appointment at all. A patient can schedule request for one or more appointments. However, every appointment is about only one patient. As a result of every appointment, there must be a bill. One payment is applied to exactly 1 bill, and 1 bill can be paid off over time by several payments. A bill can be outstanding, having nothing yet paid on it at all. One patient can make many payments, but a single payment is made by only 1 patient. Some patients are insured by an insurance company. If they are insured, they can only carry insurance with one company. An insurance company can have many patients carry their policies. For patients that carry insurance, the insurance company will make payments, each single payment is made by exactly 1 insurance company. (Hint: final ERD must include 7 tables.) a) Identify the entities with attributes and keys (primary and foreign keys).…
The city of BeeOS has a sightseeing tour which departs from a bus stop, takes a city tour and arrives at the same bus stop. There is only one bus that takes these tours indefinitely. The city visitors wait at the bus stop to board the bus, which can hold maximum N people. Each visitor should queue up at the bus stop and not get on until the bus starts its engine. The bus should wait until N visitors have boarded before departing. The bus can start its tour only when it is full. Once the bus has finished the trip, the visitors should get off after the bus stops its engine. All visitors should leave before the bus starts again. The process codes to be run by the bus and visitors are given below without any synchronization. Note that ‘Visitor’ code will be called by each visitor separately.Bus{loop{start_engine();take_tour();stop_engine();}}Visitor{get_on();get_off();}Rewrite the Bus and Visitor codes, with convenient mutex and/or semaphore operations, such that all synchronization…
Merge sort is an efficient sorting algorithm with a time complexity of O(n log n). This means that as the number of elements (chocolates or students) increases significantly, the efficiency of merge sort remains relatively stable compared to other sorting algorithms. Merge sort achieves this efficiency by recursively dividing the input array into smaller sub-arrays, sorting them individually, and then merging them back together. The efficiency of merge sort is primarily determined by its time complexity, which is , where n is the number of elements in the array. This time complexity indicates that the time taken by merge sort grows logarithmically with the size of the input array. Therefore, even as the number of chocolates or students increases significantly, merge sort maintains its relatively efficient performance. Regarding the distribution of a given set of x to y using iterative and recursive functions, the complexity analysis depends on the specific implementation of each…
The ColumnChoice problem takes as input a two-dimensional array A[1..m, 1..n] of Os and 1s with m rows and n columns along with a non-negative integer k < n. It asks whether there exists a subset SC {1, ..., n} of k columns such that for each row i e {1,..., m} there exists at least one column j e S where A[i, j] = 1. Prove that ColumnChoice is NP- complete.
Suppose that a manufacturing company builds n different types of robots, sayrobots 1, 2, . . . , n. These robots are made from a common set of m types of materials, saymaterials 1, 2, . . . , m. The company has only a limited supply of materials for each year,the amount of materials 1, 2, . . . , m are limited by the numbers b1, b2, . . . , bm, respectively.Building robot i requires an aij amount from material j. For example, building robot 1requires a11 from material 1, a12 from material 2, etc. Suppose the profit made by sellingrobot i is pi. Write an integer linear program for maximizing the annual profit for thecompany
write a C++ program to Given a matrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 whichhas the following meaning:0: Empty cell1: Cells have fresh oranges2: Cells have rotten orangesSo we have to determine what is the minimum time required so that all the oranges becomerotten. A rotten orange at index [i,j] can rot other fresh orange at indexes [i-1,j], [i+1,j], [i,j-1],[i,j+1] (up, down, left and right). If it is impossible to rot every orange then simply return -1.Examples:Input: arr[][C] = { {2, 1, 0, 2, 1},{1, 0, 1, 2, 1},{1, 0, 0, 2, 1}};Output:All oranges can become rotten in 2 time frames.Input: arr[][C] = { {2, 1, 0, 2, 1},Tahir Iqbal Department of Computer Sciences. BULC{0, 0, 1, 2, 1},{1, 0, 0, 2, 1}};Output:All oranges cannot be rotten.Below is algorithm.1) Create an empty Q.2) Find all rotten oranges and enqueue them to Q. Also enqueuea delimiter to indicate beginning of next time frame.3) While Q is not empty do following3.a) While delimiter in…
use the Process object of the multiprocessing module to make Python implement row-partitioning for parallel matrix multiplication. Each of the three processes receives its row and matrix B from the master process and multiplies them to create the row of the output matrix C. The input matrices A and B are tiny 33 matrices. The associated row of matrixC from a worker is then sent to the master. For this algorithm, we must take the following into account: The data of the parent process is entirely present in the process when it is launched using the Process module, but any changes it makes are not reflected in the parent process.We must utilise the Manager object of the multiprocessing module and declare C as an array to be shared from this object in order to distribute the product matrix C amongst the processes. Each worker process multiplies and records the outcome in the corresponding row entry of matrix C.
Task(2): Write a MATLAB code that generates Unit Step Function. Task(3): Write a MATLAB code that generates Real valued Exponential Function.x(n) = an (In MATLAB array operator ” . ^" is required to implement a real exponential sequenceAssume a=0.9) Task(4): Create x[n] = exp (j*n/3) for some range and see its real and imaginary parts separately x[n] = exp (j*n/3) hey please perform all the task on matlab give me code at matlab and output
Compute time complexity of the given program. The complexity computation should be for the complete program. Map it on its relevant standard function. Computation should be clear. void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } // A function to implement bubble sort void bubbleSort(int arr[], int n) { int i, j; for (i = 0; i < n-1; i++) // Last i elements are already in place for (j = 0; j < n-i-1; j++) if (arr[j] > arr[j+1]) swap(&arr[j], &arr[j+1]); } /* Function to print an array */ void printArray(int arr[], int size) { int i; for (i = 0; i < size; i++) cout << arr[i] << " "; cout << endl; }