Consider a program containing ‘j’ instructions of which ‘k’ instructions are loop instructions. The program is executed on a system that contains cache. Instruction fetch from memory costs ‘l’ nano-second while that for cache costs ‘m’ nano-second. If loop is executed ‘n’ times and every other instruction is executed once only, a) derive an expression for the speedup due to use of cache (ratio of the program execution time without cache to the program execution time with cache). Assume, cache is empty initially and is large enough to hold the loop completely and all th
Consider a program containing ‘j’ instructions of which ‘k’ instructions are loop instructions. The program is executed on a system that contains cache. Instruction fetch from memory costs ‘l’ nano-second while that for cache costs ‘m’ nano-second. If loop is executed ‘n’ times and every other instruction is executed once only, a) derive an expression for the speedup due to use of cache (ratio of the program execution time without cache to the program execution time with cache). Assume, cache is empty initially and is large enough to hold the loop completely and all th
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
Related questions
Question
Consider a program containing ‘j’ instructions of which ‘k’ instructions are loop
instructions. The program is executed on a system that contains cache. Instruction fetch from memory
costs ‘l’ nano-second while that for cache costs ‘m’ nano-second. If loop is executed ‘n’ times and
every other instruction is executed once only,
a) derive an expression for the speedup due to use of cache (ratio of the program execution time
without cache to the program execution time with cache). Assume, cache is empty initially
and is large enough to hold the loop completely and all the data required by the program is
hard-coded in the program.
b) If j = 1500, k = (your registration number), l = 20 nano-seconds , m = 2 nano-seconds, and n =
100 calculate the speedup using your expression derived in ‘a’ part.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education