Essentials of Computer Organization and Architecture
Essentials of Computer Organization and Architecture
5th Edition
ISBN: 9781284123036
Author: Linda Null
Publisher: Jones & Bartlett Learning
Expert Solution & Answer
Book Icon
Chapter 11, Problem 17E

Explanation of Solution

Analysis of the sidebar:

  • System performance is considered as one of main factor of a processor.
  • It is used to determine the speed a problem can be solved.
  • It is also used to determine the factors such as number of problems that can be allocated at particular amount of time and also the number of problems that can be handled by the processor.
  • The speed of the CPU is a key factor that often decides the performance of the system.
  • But this factor speed is applied only to identical architecture and which will be misled at many cases.
  • A detailed analysis is made to arrive at a detailed decision for different architecture.
  • The efficiency that is employed with the architecture plays an important role when considering the performance.
  • The performance can be improved based on the way the code is written.

Guidelines to improve the performance by writing the efficient code:

  • The branches that are not required necessarily are being removed.
    • It is used to indicate the implication of organizational and architectural.
    • It indicates the way how the branches are processed or being pipelined but it is being related to the code aspect in a higher order.
    • Any branching instruction that is given the work of the processor is to guess the predicted outcome and based on that the process is being added to the pipeline.
    • In case the output is not as predicted it could be a loss in overall efficiency.
  • The iteration is considered to be over recursive.
    • It is related with aspect of coding
    • Recursion involves the procedure call greatly.
    • The process involved will be storing it with the instruction and then with the program counter stored on to the stack and by shifting the control of the address to new procedure call.
    • This type of process may require high time to process but may not require huge storage capacity...

Blurred answer
Students have asked these similar questions
Abstract classes & Interfaces (Ch13) 5. See the code below and solve the following. class Circle { protected double radius; // Default constructor public Circle() ( } this(1.0); // Construct circle with specified radius public Circle(double radius) { } this.radius radius; // Getter method for radius public double getRadius() { } return radius; // Setter method for radius public void setRadius(double radius) { } this.radius = radius; // Implement the findArea method defined in GeometricObject public double findArea() { } return radius* radius * Math. PI; // Implement the find Perimeter method defined in GeometricObject public double findPerimeter() { } return 2*radius*Math.PI; // Override the equals() method defined in the Object class public boolean equals(Circlel circle) { } return this.radius == circle.getRadius(); // Override the toString() method defined in the Object class public String toString() { } } return "[Circle] radius = " + radius; 5-1. Define a class name…
6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]
Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education