Please use the info to solve part c Consider two different machines A and B, with two different instruction sets. Machine A has aclock rate of 200 MHz while Machine B has a clock rate of 4 GHz.Assume a given program of 4 million instructions is being executed on both machines A and B.The program consists of four major types of instructions. The instruction mix and the CPI foreach instruction type are given below:MachineABInstruction TypeLogic and ArithmeticBranchLoad/Store with cache hitMemory reference with cache missLogic and ArithmeticBranchLoad/Store with cache hitMemory reference with cache missCPI248161248Instruction Mix (%)6018121010121860 c. Now assume that the program can be executed in 4 parallel tasks or threads with roughlyequal number of instructions executed in each task. In another words, as the program isparallelized to run over multiple cores, the number of instructions per processor is dividedby the number of cores. Execution is on a quadcore system with each core (processor)having the same performance as the single processor originally used for Machine B.Coordination and synchronization between the parts adds an extra 50,000 instructionexecutions to each task. Assume the same instruction mix as for Machine B for each task,but increase the CPI for memory reference with cache miss to 10 cycles due to contentionfor memory.Fill out the table below for Machine C.MachineBCInstruction TypeLogic and ArithmeticBranchLoad/Store with cache hitMemory reference with cache missLogic and ArithmeticBranchLoad/Store with cache hitMemory reference with cache missCPI148Instruction Mix (%)10121860

Answer is explained below in detail

c. Now assume that the program can be executed in 4 parallel tasks or threads with roug equal number of instructions executed in each task. In another words, as the program parallelized to run over multiple cores, the number of instructions per processor is divid by the number of cores. Execution is on a quadcore system with each core (processc having the same performance as the single processor originally used for Machine Coordination and synchronization between the parts adds an extra 50,000 instructic executions to each task. Assume the same instruction mix as for Machine B for each tas but increase the CPI for memory reference with cache miss to 10 cycles due to contentio. for memory.

c. Now assume that the program can be executed in 4 parallel tasks or threads with roug equal number of instructions executed in each task. In another words, as the program parallelized to run over multiple cores, the number of instructions per processor is divid by the number of cores. Execution is on a quadcore system with each core (processc having the same performance as the single processor originally used for Machine Coordination and synchronization between the parts adds an extra 50,000 instructic executions to each task. Assume the same instruction mix as for Machine B for each tas but increase the CPI for memory reference with cache miss to 10 cycles due to contentio. for memory.

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

Question 7 A video store stocks movie DVDs. Consider the ERD below. Assume COPY 187654 is a valid copy. What can you determine about the statement "COPY 187654 contains the first three Star Wars movies". MOVIE Has Contains COPY This statement could be true based on the ERD. This statement could NOT be true based on the ERD.
Problem 2 Show that there is no algorithm that, given a relational algebra query, returns an equivalent query with a minimum number of joins.
Specify the various types of constraints.
Hello, can you provide the functions for the solution please?
Lab Exercise Consider the following emp table given below and perform the given below operations. Oracle 5Q Plus sOL) select from enp; EPHO ENAE JOn HGR MIREDATE SAL CO CLERK SALESHAN SALESHAH 7982 17-0EC-80 7698 20-FEB-81 7698 22-FEB-81 7839 2-APR-1 7698 28-SEP-81 7839 01-HAY-81 7839 09-JUH-81 7566 19-APR-87 17-HOV-81 7698 -SEP-81 7788 23-HAY-87 7698 03-DEC-81 7566 03-DEC-81 782 23-JAH-82 7369 SHITH 7499 ALLEN 7521 MARD 1600 1250 2975 1258 2850 2450 3000 300 500 7566 JONES 7654 HARTIN HANAGER 7698 BLAKE 7782 CLARK 7788 SCOTT 7839 KING 78A TURNER 7876 ADAMS 7900 JAHES 7902 FORD 7934 HILLER SALESHAN PANAGER HANAGER ANALYST PRESIDENT SALESHAN CLERK CLERK ANALYST CLERK 1580 1180 950 3000 1300 rows selected. SOL> I 4. Drop the COMM column 5. Rename the table as Employees. 6. Check that the SAL column value is between 500 and 10000 7. Delete all records from the table. - For each step screenshot the SQL code you wrote + screenshot the table showing the changes done. - Upload your work to…
A well-known masseuse is considering which appointment requests to accept after receiving many back-to-back ones. She cannot take any neighbouring requests as she requires a 15-minute break in between sessions. Find the best (highest total booked minutes) set of appointment requests the masseuse can honour from a series of consecutive requests (all multiples of 15 minutes, no overlap, and none may be changed). Give me the time in minutes.Enter the following data: 30, 15, 60, 75, 45, 15, 15, 45.180 minutes of output (30, 60, 45, 45).
Alternative Assignment 2 Task: Create a protected user account database.using PHP and SQL Detail: Create a protected user account database where is security identify a user is allow them to access to the system (Home page), based on the following requirements: You suppose to implement secure registration form using regular expression and proper validation, login page with username and password-based authenticated using the following mandatory: Must allow the creation, deletion of user accounts Must provide a demonstration application that grants user access when provide a valid username/password pair The passwords must be protected. No administrator who has access to the underlying file system should be able to see clear text passwords (cryptographic hashing). The password file itself should be protected from tampering Reject any attempts to provide invalid data. Each user account required a validation Password must be protected using cryptography hashing such as md5, sha1,…
15. b). Team c) Dragons Carp Bay Stars Marines Ham Fighters Lions Tigers Swallows d) Opponent Tigers Swallows 5 14 2 5 Buffaloes 1 Golden Eagles 8 Dragons 3 Carp 6 Bay Stars 1 Marines 3 Ham Fighters 6 12 Giants Hawks Giants Hawks Buffaloes Golden Eagles Lions RunsFor RunsAgainst Marines Golden Eagles Tigers Considering the above table, what is the result of the following query? SELECT Team, Opponent FROM Scores WHERE Team LIKE '%%' OR Opponent LIKE ¹_i%' Identify in the list below a row of the result. a) Buffaloes Ham Fighters Hawks 3 Lions 6 1 3 Dragons 6 12 15 4 2 5 1 8
What does a TRC query mean? More precisely, what is the set of answer tuples for a given TRC query? The answer to a TRC query {T| p(T)}, as we noted earlier, is the set of all tuples t for which the formula p(T) evaluates to true with variable T assigned the tuple value t. To complete this definition, we must state which assignments of tuple values to the free variables in a formula make the formula evaluate to true.
Please answer question correctly
For the following Relational Algebra / SQL statements, specify the output of each query. (do not explain how each query will be executed, but specify the output to be obtained when the query is executed). (c) R1: ACTORS WHERE YearOfBirth < 1940 OR Gender = 'female' R2(SSNo, FName, LName): R1 [ SSNo, FName, LName ] R3: R2 NATURAL-JOIN ACTEDIN OVER SSNo C: R3 [ LName, Character ] (d) SELECT A1.FName, A1.LName, A1.YearOfBirth FROM ACTORS A1, ACTORS A2 WHERE A1.YearOfBirth = A2.YearOfBirth AND A1.SSNo != A2.SSNo (e) R1: ACTEDIN [ FilmNo, SSNo ] R2: FILMS WHERE FilmTitle = 'Unforgiven' [ FilmNo ] R3: ACTEDIN NATURAL-JOIN R2 OVER FilmNo [ SSNo ] R4: ACTORS NATURAL-JOIN R3 OVER SSNo [ SSNo, FName, LName ] R5: ( R1.SSNo ÷ R4.SSNo ) [ FilmNo ] C: ACTEDIN NATURAL-JOIN R5 OVER FilmNo [ FilmTitle ] (f) SELECT A.FName, A.LName, COUNT(*) FROM ACTORS A, ACTEDIN AI WHERE A.SSNo = AI.SSNo GROUP BY A.SSNo, A.FName, A.LName HAVING count(*) > 2 OR count(*) = 0
Propose and explain good indices (tree, hash, cluster, etc.) to support the following query. You do not need to write the SQL statements. SELECT D.DName, S.SName FROM Students S, Departments D WHERE S.Did = D.Did %3D