15. A sequential algorithm is broken into three stagesSequential Algorithm TimeDownload stage: 1 minuteSorting stage: 6 minutesUpload stage 1 minuteA parallel version of the algorithm completes the sorting stage in parallel leading to a new set of timesParallel Algorithm TimeDownload stage: 1 minuteSorting stage: 2 minutesUpload stage: 1 minuteWhat is the speedup of the parallel solution?A. 6 minutesB. 4 minutesC. 2D. 30000

SEQUENTIAL ALGORITHM : Sequential algorithms are those algorithm in which the execution of…

Answered: What is the speedup of the parallel…

Engineering

Computer Science

What is the speedup of the parallel solution? A. 6 minutes B. 4 minutes ос 2 D. 3 0000

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

1. a.An algorithm can be specified in various ways. Identify and explain four ways in which an algorithm can be specified. b. (b). Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as follows:A = 2n7 + 100n4 + 26n + 50 B = 7n4 + 22n2 + nlogn + 200For very large values of n, which of the algorithms A or B will runin the shortest time to solve the problem and why? (c). Two Computer Science students, Priscilla and Julius, are discussing how to compare two algorithms for solving a given problem. Priscilla suggests that they should use the execution times of the algorithms as criterion; but Julius insists that they should use the number of statements the algorithms execute as criterion. (i). Discuss the reasons why both criteria they are considering are not good for comparing algorithms.(ii). Recommend an ideal solution/criterion that they should rather use for comparing algorithms
3. Design a dynamic programming algorithm for the Longest Alternating Subsequence problemdescribed below:Input: A sequence of n integersOutput: The longest subsequence where the numbers alternate between being larger and smaller thantheir predecessorThe algorithm must take O(n) time. You must also write and explain the recurrence.Example 1:Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4]Output: [3, 5, 4, 6, 5, 7, 3, 4]Example 2:Input: [4, 7, 2, 5, 8, 3, 8, 0, 4, 7, 8]Output: [4, 7, 2, 5, 3, 8, 0, 4] Write in Pseudocode, please
(Greedy Algorithms) Suppose you are given n tasks j={j1,j2,...jn}.Each task jl has two parts -a preprocessing phase which takes pl unites and a main phase which takes fl units of time. There are n machines that can esecute the main phase of the jobs in parallel. However, the preprocessing phases need to be execute sequentially on a special machine. The completion time of any schedule is the earliest time when all tasks have finished execution. Design a greedy algorithm which produces a schedule the minimizes the completion time. Here, you need to give formal proof of correctness
Suppose you are given n tasks J = {j1, j2, · · · jn}.Each task ji has two parts - a preprocessing phase which takes pi units and a main phase whichtakes fi units of time. There are n machines that can execute the main phases of the jobs in parallel.However, the preprocessing phases need to be executed sequentially on a special machine. Thecompletion time of any schedule is the earliest time when all tasks have finished execution. Designa greedy algorithm which produces a schedule that minimizes the completion time. Here, youneed to give formal proof of correctness. Your proof should not exceed one side of an A4 sheet.Anything more than that will not be considered by the evaluator. Provide only pseudocode.
Consider the following snippets of code. Then, identify and describe thesorting algorithm used.num scores[5] = 90,85,65,95,75sort()x = 1while x < SIZEtemp = scores[x]y = x – 1while y >= 0 AND scores[y]>tempscores[y+1] = scores[y]y = y – 1endwhilescores[y+1] = tempx = x + 1endwhilereturn
You are to create a program that enables you to measure the execution times of various sorting algorithms to better understand their efficiency characteristics. For each sorting algorithm, you are to measure and record the execution times for various lists of randomly generated integers. The list sizes used for the test cases should start at 10,000, and go up by 10,000 for each test until the execution time for the test exceeds 60 seconds. The algorithms for which you are to run the tests are: • Selection sort • Bubble sort • Merge sort
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overall completion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
repackage into a dynamic programming algorithm. The idea is to explicitly fill in the table of all values, using previously computed values to compute new values.
Which of the following DOES NOT correctly describe Big-Oh notation? Select one: A.It is used to measure the average performance or complexity of an algorithm B.It specifically describes the worst-case scenario of running an algorithm C.It measures the growth rates of resource requirement when size of input tends towards a particular value or infinity. D.It can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm
Assume that each of the following expressions indicates the number of operations performed by an algorithm for a problem size of n. Point out the dominant term of each algorithm and use big-O notation to classify it. 2n – 4n2 + 5n 3n2 + 6 n3 + n2 – n
An explanation of the operation of overclocking as well as its advantages and disadvantages. advantages and disadvantages of CPU overclocking Please respond to each and every query.
If we say a sorting algorithm sorts a list in-place, what does that mean? Group of answer choices 1. No auxiliary variables are created during the sorting process. 2. The sorting algorithm does not change the contents of the original list while sorting. 3. The sorting algorithm does not copy the items to a new sorted list as it is sorting. 4. If two items are equal, the first of those items will appear before the other in the sorted output.