Say in a scheduling scenario you are given a number of jobs, each with a start time and a finish time. Two jobs conflict if they overlap in time, i.e., one of them starts between the start and finish times of the other. Your goal is to select a maximum-size subset of jobs that have no conflicts. Example: Three jobs consuming the intervals [0, 3], [2, 5], and [4, 7]. The optimal solution in this case would consist of the first and third ones. Design and describe a greedy algorithm that computes an optimal solution to this problem. Informally argue why the solution is likely to be optimal and demonstrate on an example. You may assume that there are no ties.

Say in a scheduling scenario you are given a number of jobs, each with a start time and a finish time. Two jobs conflict if they overlap in time, i.e., one of them starts between the start and finish times of the other. Your goal is to select a maximum-size subset of jobs that have no conflicts. Example: Three jobs consuming the intervals [0, 3], [2, 5], and [4, 7]. The optimal solution in this case would consist of the first and third ones. Design and describe a greedy algorithm that computes an optimal solution to this problem. Informally argue why the solution is likely to be optimal and demonstrate on an example. You may assume that there are no ties.

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

A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?
A popular masseuse receives a sequence of back-to-back appointment requestsand is debating which ones to accept. She needs a 15-minute break between appointments andtherefore she cannot accept any adjacent requests. Given a sequence of back-to-back appointment requests (all multiples of 15 minutes, none overlap, and none can be moved), find the optimal(highest total booked minutes) set the masseuse can honor. Return the number of minutes.EXAMPLEInput: {30, 15, 60, 75, 45, 15, 15, 45}Output180 minutes ({30, 60, 45, 45})
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example Consider a computer system with has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
Classes are scheduled at a school. Once students have submitted their course requests, a computer algorithm can determine the optimal schedule for everyone. The school has concluded that it will take too long to determine the best schedule. Instead, they resort to a less sophisticated method that produces a serviceable if not ideal timetable. Which guiding concept is represented here?
We consider the following scheduling problem: INPUT: A collection of jobs J1, ··· , Jn. The size of job Ji is xi, which is a non-negative integer. An integer m. OUTPUT: A nonpreemptive feasible schedule for these jobs on m processor that minimizes the total n completion time Pn i=1 Ci . A schedule specifies for each unit time interval and for each processor, the unique job that that is run during that time interval on that processor. In a feasible schedule, every job Ji has to be run for exactly xi time units after time 0. In a nonpreemptive schedule, once a job starts running on a particular processor, it has to be run to completion on that particular processor. The completion time Ci for job Ji is the earliest time when Ji has been run for xi time units. So for example if m = 2 jobs of size 1, 4, 3 are run in that order on the first processor, and jobs of size 7, 10 are run on the second processor in that order, then the total completion time would be 1 + 5 + 8 + 7 + 17…
In the sequence alignment problem, suppose you knew that the input strings were relatively similar, in the sense that there is an optimal alignment that uses at most k gaps, where k is much smaller than the lengths m and n of the strings. Show how to compute the NW score in O((m+n)k) time.
Consider the following version of Knapsack. Given are two weight limits Wi and W2, where WW2. Given are also n items (wi, ci), (W2, C2)..... (Wn, Cn), where w, is the weight and c the cost of the i-th item. We want to find a subset of these items of the highest cost, where the subset weights at least W₁ and at most W2. Give an O(nW₂) algorithm for this problem. (Recall that the cost (respectively weight) of a subset is the sum of the costs (respectively weights) of the items in the subset.)
Consider a set of n independent tasks. All tasks arrive at t = 0. Each task Ti is characterized by its computation time Ci and deadline Di. Prove that EDF is optimal for both preemptive AND non-preemptive cases. please type the answers
Given references to the following pages by a program,4, 2, 3, 9, 3, 2, 5, 4, 6, 3, 5, 4, 9, 3, 6, 9, 4, 6, 3, 1, 6, 1, 2, 1. Question: Determine the number of page faults if the program has 4 frames available to it and uses: a. FIFO = b. OPTIMAL = c. LRU = d. LFU = e. MFU =
Determine whether there is a feasible schedule for the following NONPREEMPTABLE task sets. = p1 = 8 T1 (periodic): c1 = 2, d1 d2 = 6, p2 = 7 T2 (sporadic): c2 = 1, T3 (sporadic): c3 = 1, d3 =p3 = 10
a. Given n items, where each item has a weight and a value, and a knapsack that can carry at most W You are expected to fill in the knapsack with a subset of items in order to maximize the total value without exceeding the weight limit. For instance, if n = 6 and items = {(A, 10, 40), (B, 50, 30), (C, 40, 80), (D, 20, 60), (E, 40, 10), (F, 10, 60)} where each entry is represented as (itemIdi, weighti, valuei). Use greedy algorithm to solve the fractional knapsack problem. b. Given an array of n numbers, write a java or python program to find the k largest numbers using a comparison-based algorithm. We are not interested in the relative order of the k numbers and assuming that (i) k is a small constant (e.g., k = 5) independent of n, and (ii) k is a constant fraction of n (e.g., k = n/4). Provide the Big-Oh characterization of your algorithm.
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