Problem 4. Suppose a program for a racing drone consists of a purely sequential part which takes 25 cycles to execute, and an iterated loop which takes 100 cycles per iteration. Assume the loop iterations are independent and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (compared to a single processor)?

Problem 4. Suppose a program for a racing drone consists of a purely sequential part which takes 25 cycles to execute, and an iterated loop which takes 100 cycles per iteration. Assume the loop iterations are independent and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (compared to a single processor)?

Name: Problem 4. Suppose a program for a racing droneconsists of a purely s
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Problem 4. Suppose a program for a racing droneconsists of a purely sequential part which takes 25 cyclesto execute, and an iterated loop which takes 100 cyclesper iteration.independent and cannot be further parallelized. If theloop is to be execute

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

Consider that the process of baking a cake is analogous to the process of calculating three iterations of a loop on a parallel computer. Find and explain instances of parallelism at both the data level and the task level in the cake-making loop.
Consider that three iterations of a loop on a parallel computer are equivalent to baking a cake. Identify and describe instances of data-level and task-level parallelism in the cake-making procedure.
Imagine that three loop iterations on a parallel computer are the same as making a cake. In the process of baking a cake, identify and describe instances of parallelism at both the data and task levels.
Think of the process of baking a cake as being comparable to running a loop three times on a parallel computer. Find and describe instances of task- and data-level parallelism in the cake-making loop.
Consider baking a cake to be the same as running three loops on a computer in parallel. Find and explain examples of data-level parallelism and task-level parallelism in the loop that makes the cake, then talk about them.
p% of a program is perfectly parallelizable. We wish to run it on a multiprocessor. Assume we have an unlimited number of processing elements. If the maximum speedup achievable on this program is 100, what is p?
Think of baking a cake as being like doing three iterations of a parallel computer's loop calculation three times over. In the cake-making loop, find and describe examples of data-level parallelism and task-level parallelism.
Modiflow y the beprogram given to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n); for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0]; for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}
Modiflow y the beprogram given to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n);for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0];for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}
Completing three iterations of a loop on a parallel computer is comparable to constructing a cake. In the cake-making loop, look for data-level parallelism and task-level parallelism.
Imagine that three loop iterations on a parallel computer are the same as making a cake. In the cake-making process, identify and describe instances of data-level and task-level parallelism.
Consider a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP instructions, 55 seconds for INT operations, 85 seconds for load/save operations, and 40 seconds for branch instructions. By how much is the time for INT operations reduced if the total time is reduced by 20%?