I&C SCI 51 Lecture Notes - Lecture 5: Endianness, Operand, Complex Instruction Set Computing
5 Oct 2016
School
Department
Course
Professor
Document Summary
Computer equation = cpu + memory + i/o. How to speed up the processor: pipelining/ alternative architectures: Pipelining is overlapping work (like the laundry example) Circuits recognize and use values that represent the voltage levels. Stores large number of bits m x n: m cells of n bits each k = log2(m) address input signals or m = 2^k cells k-bits to address one n-bit cell eg. , 4096 x 8 memory: 4096 => 4 decimal digits for each address. Big-endian stores the most significant byte of a word in the smallest address and the least significant byte in the largest address (mainframe computers and the internet) Little-endian systems store the least significant byte in the smallest address (intel x86) Create a layered approach to memory; memory hierarchy. On a read: the slower the memory, the greater the # of cycles the cpu will have to wait. Fast memory is very expensive, slow is cheap.
