Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Question 1 You are to write an IAS program to compute the results of the following equation. Y = Ex X=1 Assume that the computation does not result in an arithmetic overflow and that X, Y, and N are positive integers with N > 1. Note: The IAS did not have assembly language, only machine language. N(N + 1) Sum(Y) i. Use the equation 2 when writing the IAS program. ii. Do it the "hard way," without using the equation from part (i).

Question 1 You are to write an IAS program to compute the results of the following equation. Y = Ex X=1 Assume that the computation does not result in an arithmetic overflow and that X, Y, and N are positive integers with N > 1. Note: The IAS did not have assembly language, only machine language. N(N + 1) Sum(Y) i. Use the equation 2 when writing the IAS program. ii. Do it the "hard way," without using the equation from part (i).

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%
DCIT 207 Computer Organization and Architecture Assignment 2 Question 1 You are to write an IAS program to compute the results of the following equation. Y = Ex Assume that the computation does not result in an arithmetic overflow and that X, Y, and N are positive integers with N > 1. Note: The IAS did not have assembly language, only machine language. N(N + 1) Sum(Y) i. Use the equation 2 when writing the IAS program. ii. Do it the “hard way," without using the equation from part (i). Question 2 a. On the IAS, what would the machine code instruction look like to load the contents of memory address 2 to the accumulator? b. How many trips to memory does the CPU need to make to complete this instruction during the instruction cycle? Question 3 Table 1.1: Execution times Benchmark Processor Y 1 20 10 40 | 2 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results.
Transcribed Image Text:DCIT 207 Computer Organization and Architecture Assignment 2 Question 1 You are to write an IAS program to compute the results of the following equation. Y = Ex Assume that the computation does not result in an arithmetic overflow and that X, Y, and N are positive integers with N > 1. Note: The IAS did not have assembly language, only machine language. N(N + 1) Sum(Y) i. Use the equation 2 when writing the IAS program. ii. Do it the “hard way," without using the equation from part (i). Question 2 a. On the IAS, what would the machine code instruction look like to load the contents of memory address 2 to the accumulator? b. How many trips to memory does the CPU need to make to complete this instruction during the instruction cycle? Question 3 Table 1.1: Execution times Benchmark Processor Y 1 20 10 40 | 2 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results.
Question 3 Table 1.1: Execution times Benchmark Processor X Y 20 10 40 2 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean. Question 4 i. Consider an L1 cache with an access time of 1 ns and a hit ratio of Suppose that we can change the cache design (size of cache, cache organization) such that we increase H to 0.97, but increase access time to 1.5 ns. What conditions must be met for this change to result in improved performance? ii. Explain why this result makes intuitive sense. 1 Question 5 i. List some reasons why it is worthwhile to study assembly language programming. ii. Section 15.4 includes a C program that calculates the greatest common divisor of two integers. Describe the algorithm in words and show how the program does implement the Euclid algorithm approach to calculating the greatest common divisor.
Transcribed Image Text:Question 3 Table 1.1: Execution times Benchmark Processor X Y 20 10 40 2 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean. Question 4 i. Consider an L1 cache with an access time of 1 ns and a hit ratio of Suppose that we can change the cache design (size of cache, cache organization) such that we increase H to 0.97, but increase access time to 1.5 ns. What conditions must be met for this change to result in improved performance? ii. Explain why this result makes intuitive sense. 1 Question 5 i. List some reasons why it is worthwhile to study assembly language programming. ii. Section 15.4 includes a C program that calculates the greatest common divisor of two integers. Describe the algorithm in words and show how the program does implement the Euclid algorithm approach to calculating the greatest common divisor.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 10 steps with 14 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS