alculate the speed up factor provided by Machine C over Mach

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
icon
Related questions
Question
Calculate the speed up factor provided by Machine C over Machine B
c. Now assume that the program can be executed in 4 parallel tasks or threads with roughly
equal number of instructions executed in each task. In another words, as the program is
parallelized to run over multiple cores, the number of instructions per processor is divided
by 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 instruction
executions 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 contention
for memory.
Fill out the table below for Machine C.
Machine
B
Instruction Type
Logic and Arithmetic
Branch
Load Store with cache hit
Memory reference with cache miSS
Logic and Arithmetic
Load/Store with cache hit
Memory reference with cache miss
1
1
8
Instruction Mix (9)
10
60
Transcribed Image Text:c. Now assume that the program can be executed in 4 parallel tasks or threads with roughly equal number of instructions executed in each task. In another words, as the program is parallelized to run over multiple cores, the number of instructions per processor is divided by 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 instruction executions 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 contention for memory. Fill out the table below for Machine C. Machine B Instruction Type Logic and Arithmetic Branch Load Store with cache hit Memory reference with cache miSS Logic and Arithmetic Load/Store with cache hit Memory reference with cache miss 1 1 8 Instruction Mix (9) 10 60
Expert Solution
Step 1: Given

Answer is given below with all calculation

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education