Koofers

TESTBANK•PROF RATINGS•GPA HISTORIES•FLASHCARDS•SCHEDULES•TEXTBOOKS•DEALS
Universities » Berea College » CSC - Computer Science » 435 - Computer Organization » Flash Cards

Ch 2 - Flashcards

Flashcard Deck Information

Class:CSC 435 - Computer Organization
Subject:Computer Science
University:Berea College
Term:Spring 2011
- of -
INCORRECT CORRECT
- INCORRECT     - CORRECT     - SKIPPED
Shuffle Remaining Cards Show Definitions First Take Quiz (NEW)
Hide Keyboard shortcuts
Next card
Previous card
Mark correct
Mark incorrect
Flip card
Start Over
Shuffle
      Mode:   CARDS LIST       ? pages   PRINT EXIT
basic block
A sequence of instructions without branches (except possibly at the 
end) and without branch targets or branch labels (except possibly at the beginning).
procedure frame
Also called activation record. The segment of the stack containing a procedure’s saved registers and local variables.
PC-relative addressing
An addressing regime in which the address is the sum of 
the program counter (PC) and a constant in the instruction.
Base or displacement addressing
Where the operand is at the memory location whose address is the sum of a register and a constant in the instruction. 
Generated by Koofers.com
Register Addressing where the operand is a register. 
Immediate Addressing where the address is a constant within the instruction.
Pseudodirect Addressing where the jump address is the 26 bits of the instruction concatenated with the upper 6 bits of the Program Counter. 
loop unrolling
A technique to get more performance from loops that access arrays, in which multiple copies of the loop body are made and instructions from different iterations are scheduled together
Generated by Koofers.com
linker / link editor
A systems program that combines independently assembled machine language programs and resolves all undefined labels into an executable file.
executable file
A functional program in the format of an object file that contains no 
unresolved references, relocation information, symbol table, or debugging information.
loader
 A systems program that places an object program in main memory so that it is ready to execute
Strength Reduction  optimization where complex operations are replaced with simpler ones. 
Generated by Koofers.com
Constant propagation find constant in code and propagate them
Copy Propagation propagates values that are simple copies, eliminating the need to reload vales and possibly enabling other optimizations. 
Dead Store Elimination finds stores to values that are never used again and eliminates the store. Its cousin dead code elimination finds code that is never used and eliminates it. 
Generated by Koofers.com

List View: Terms & Definitions

  Hide All 15 Print
 
Front
Back
 basic block
A sequence of instructions without branches (except possibly at the 
end) and without branch targets or branch labels (except possibly at the beginning).
 procedure frame
Also called activation record. The segment of the stack containing a procedure’s saved registers and local variables.
 PC-relative addressing
An addressing regime in which the address is the sum of 
the program counter (PC) and a constant in the instruction.
 Base or displacement addressing
Where the operand is at the memory location whose address is the sum of a register and a constant in the instruction. 
 Register Addressingwhere the operand is a register. 
 Immediate Addressingwhere the address is a constant within the instruction.
 Pseudodirect Addressingwhere the jump address is the 26 bits of the instruction concatenated with the upper 6 bits of the Program Counter. 
 loop unrolling
A technique to get more performance from loops that access arrays, in which multiple copies of the loop body are made and instructions from different iterations are scheduled together
 linker / link editor
A systems program that combines independently assembled machine language programs and resolves all undefined labels into an executable file.
 executable file
A functional program in the format of an object file that contains no 
unresolved references, relocation information, symbol table, or debugging information.
 loader
 A systems program that places an object program in main memory so that it is ready to execute
 Strength Reduction optimization where complex operations are replaced with simpler ones. 
 Constant propagationfind constant in code and propagate them
 Copy Propagationpropagates values that are simple copies, eliminating the need to reload vales and possibly enabling other optimizations. 
 Dead Store Eliminationfinds stores to values that are never used again and eliminates the store. Its cousin dead code elimination finds code that is never used and eliminates it. 
+0
Karma