|
CS 61C Formula Sheet
P&H Appendix B, page 76
propagation time The
time
required for an input to a flipflop
to propagate to the outputs
of the flip-flop.
P&H Appendix B, page 72
■ tprop
is the time for a signal to
propagate through a flip flop; it is also sometimes
called clock-to-Q.
■ tcombinational
is the longest delay for any
combinational logic (which by defi-
nition is surrounded by two flip-flops).
■ tsetup
is the time before the rising clock
edge that the input to a flip-flop
must be valid.
| Single Precision |
Object Represented |
What you should write into the buffer |
| Exponent |
Mantissa |
| 0 |
0 |
zero |
[-]0 |
| 0 |
nonzero |
± denormalized number |
[-]denorm |
| 1-254 |
anything |
± normalized number |
[-]mantissa_in_binaryb 2^([-]exponent_in_decimal) |
| 255 |
0 |
± infinity |
[-]Inf |
| 255 |
nonzero |
NaN (Not a Number) |
[-]NaN |
div $t0,$t1,$t2 is like t0 = t1 / t2;
rem $t0,$t1,$t2 is like t0 = t1 % t2;
Pseudoinstruction What it accomplishes Solution
--------------------------------------------------------
move $t5, $t3 $t5 = $t3 add $t5, $t3, $zero
clear $t5 $t5 = 0 add $t5, $zero, $zero
li $t5, small $t5 = small addi $t5, $zero, small
li $t5, big $t5 = big lui $t5, upper_half(big)
ori $t5, $t5, lower_half(big)
lw $t5, big($t3) $t5 = Mem[$t3 + big] li $at, big
add $at, $at, $t3
lw $t5, 0($at)
addi $t5, $t3, big $t5 = $t3 + big li $at, big
add $t5, $t3, $at
beq $t5, small, L if ($t5==small) goto L li $at, small
beq $t5, $at, L
beq $t5, big, L if ($t5==big) goto L li $at, big
beq $t5, $at, L
ble $t5, $t3, L if ($t5<=$t3) goto L slt $at, $t3, $t5
beq $at, $zero, L
bgt $t5, $t3, L if ($t5>$t3) goto L slt $at, $t3, $t5
bne $at, $zero, L
bge $t5, $t3, L if ($t5>=$t3) goto L slt $at, $t5, $t3
beq $at, $zero, L
double pow(double x, double y);
x raised to power y
%x
in hex
%o in octal
%d in decimal
unsigned int = 32-bits = biggest positive number = 2^31-1 = 2147483647
biggest negative number = -2^32 = -2147483648
short = 16-bits = -32,768 to 32,767
|
abstraction |
A model that renders lower-level details of computer systems temporarily
invisible in order to facilitate design of sophisticated systems. |
21 |
|
assembler |
a program that translates a symbolic version of instructions into the binary
version |
13 |
|
binary digit |
also called a bit. One of the two numbers in base 2 (0 or 1) that are the
components of information |
12 |
|
cache memory |
A small, fast memory that acts as a buffer for a slower, larger memory |
20 |
|
compiler |
Program that translates from a higher-level notation to assembly language |
38 |
|
control |
The component of the processor that commands the datapath, memory, and I/O
devices according to the instructions of the program |
20 |
|
CPU (central processor unit) |
Also called processor. The active part of the computer, which contains the
datapath and control and which adds numbers, tests numbers, signals I/O
devices to activate , and so on. |
20 |
|
datapath |
The component of the processor that performs arithmetic operations |
20 |
|
defect |
A microscopic flaw in a wafer or in patterning steps that can result in the
failure of the die containing that defect. |
30 |
|
desktop computer |
a computer designed for use by an individual, usually incorporating a
graphics display, keyboard, and mouse |
5 |
|
die |
The individual rectangular sections that are cut from a wafer, more
informally known as chips. |
30 |
|
DIMM (dual inline memory module) |
A small board that contains DRAM chips on both sides. SIMMs have DRAMs on
only one side. Both DIMMs and SIMMs are meant to be plugged into memory
slots, usually on a motherboard |
22 |
|
DRAM (dynamic random access memory) |
Memory built as an integrated circuit, it provides random access to any
location |
20 |
|
DVD (Digital Video Disk) |
Optical storage medium with a storage capacity of more than 4.7GB. It was
initially marketed for entertainment and later for computer users. |
38 |
|
embedded system |
Computer inside another device used for running one predetermined
application or collection of software |
38 |
|
instruction set architecture |
Also called architecture. An abstract interface between the hardware and the
lowest level software of a machine that encompasses all the information
necessary to write a machine language program that will run correctly,
including instructions, registers, memory access, I/O, and so on. |
22 |
|
integrated circuit |
Also called chip. A device combining dozens to millions of transistors. |
20 |
|
LAN (local area network) |
a network designed to carry data within a geographically confined area,
typically within a single building. |
26 |
|
memory |
The storage area in which programs are kept when they are running and that
contains the data needed by the running programs |
20 |
|
operating system |
Supervising program that manages the resources of a cmoputer for the benefit
of the programs that run on that machine |
11 |
|
server |
a computer used for running larger programs for multiple users often
simutaneously and typically accessed only via a network |
5 |
|
super computer |
a class of computers with the highest performance and cost; they are
configured as servers and typically cost millions of dollars |
5 |
|
systems software |
Software that provides services that are commonly useful, including
operating systems, compilers, and assemblers. |
11 |
|
transistor |
an on/off switch controlled by an electric signal |
27 |
|
VLSI (very large scale integrated circuit) |
a device containing hundreds of thousands to millions of transistors |
28 |
|
wafer |
A slice from a silicon ingot no more than 0.1 inch thick, used to create
chips. |
29 |
|
WAN (wide area network) |
a network extended over hundreds of kilometers which can span a continent |
26 |
|
yield |
The percentage of good dies from the total number of dies on the wafer |
30 |
|
