CS 25000 Chapter Notes - Chapter 7: Linked List, Von Neumann Architecture, Stack Machine

• School: Purdue University
• Department: Computer Sciences
• Course: CS 25000
• Professor: Adams George

Document Summary

Introduction: this chapter focuses on two details related to instructions: the ways instructions are represented in memory and the ways that operands can be specified. Because fetching an arbitrary number of operands takes time, the processor will run slower than processor with a fixed number of operands. Zero operands per instruction: an architecture in which instructions have no operands is known as a 0-address architecture. That is, the location of the operands is already known. Chief disadvantage arises from the use of memory takes much longer to fetch operands from memory than from registers in the processor. 7. 4 one operand per instruction: an architecture that limits each instruction to a single operand is classified as a 1-address design. It relies on an implicit operand for each instruction: a special register known as an accumulator: one operand is in the instruction and the processor uses the value of the accumulator as a second operand.