Part (a) Above is the assembly code for the function declared as: tomato(int array[], int x, int y). Assume that “myarray” is an array of 500 integers, and the function is called as tomato(myarray, 5, 21). (i) How many times is the “slt” instruction executed? Justify your answer to receive credit. ( (ii) How many times is the “lw” instruction executed? Justify your answer to receive credit. ?

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

Part (a) Above is the assembly code for the function declared as: tomato(int array[], int x, int y). Assume that
“myarray” is an array of 500 integers, and the function is called as tomato(myarray, 5, 21).
(i) How many times is the “slt” instruction executed? Justify your answer to receive credit. (
(ii) How many times is the “lw” instruction executed? Justify your answer to receive credit. ?
Part (b) Calculate the total number of cycles it takes to execute tomato(myarray, 5, 21). Show your work ?
Part (c) What is the execution time in milliseconds for the tomato(myarray, 5, 21) function if the processor operates at
60KHz? Show your work
Part (d) Your manager claims that it is possible to achieve an overall speedup of 2.2x by optimizing the data memory
access time. Is this claim correct? If so how much speed up is necessary for the data memory accesses to achieve an
overall speedup of 2.2x?

tomato:
slt
beg
sll
$t0, $al, $a2
$t0, $zero, orange
$t1, $al, 2
add
$t1, $a0, $t1
sll
$t2, $a2, 2
add
$t2, $a0, $t2
add $t5, $al, Szero
andi $t5, $t5, 1
beg
1w
add
SW
SW
potato: addi
addi
j
orange: jr
$t5, $zero, potato
$t3, 0 ($t1)
$t4, $t3 $t3
$t3,
0 ($t2)
$t4, 0 ($t1)
Şal, $al, 1
$a2, $a2, -1
tomato
$ra
Instruction Type
Arithmetic
Logical
Loads
Stores
Cycles
2
1
8
6
3
Conditional branches
Unconditional jumps
1
Table 1. Number of clock cycles for
each type of instruction
Transcribed Image Text:tomato: slt beg sll $t0, $al, $a2 $t0, $zero, orange $t1, $al, 2 add $t1, $a0, $t1 sll $t2, $a2, 2 add $t2, $a0, $t2 add $t5, $al, Szero andi $t5, $t5, 1 beg 1w add SW SW potato: addi addi j orange: jr $t5, $zero, potato $t3, 0 ($t1) $t4, $t3 $t3 $t3, 0 ($t2) $t4, 0 ($t1) Şal, $al, 1 $a2, $a2, -1 tomato $ra Instruction Type Arithmetic Logical Loads Stores Cycles 2 1 8 6 3 Conditional branches Unconditional jumps 1 Table 1. Number of clock cycles for each type of instruction
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Assembly Language
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.
Similar questions
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