1735
Comment:
|
2377
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw |
|
Line 4: | Line 6: |
* AverageNormalizedExecutionTime | |
Line 7: | Line 10: |
* BoothsAlgorithm | |
Line 9: | Line 13: |
* CpuTime * CyclesPerInstruction (CPI) * DataPath |
|
Line 13: | Line 20: |
* DelayedBranch | |
Line 15: | Line 23: |
* ExecutionTime | |
Line 17: | Line 26: |
* FiveClassicPartsOfaComputer | |
Line 18: | Line 28: |
* FloatingPointRepresentation (IEEE 754) | |
Line 19: | Line 30: |
* FrameBuffer | |
Line 20: | Line 32: |
* GeometricMean | |
Line 22: | Line 35: |
* HammingCode * HardwareDesignPrinciples |
|
Line 28: | Line 43: |
* InstructionSetArchitecture (ISA) | |
Line 29: | Line 45: |
* LogicalMemory | |
Line 30: | Line 47: |
* ["Latency"] | |
Line 31: | Line 49: |
* LinkerSteps | |
Line 35: | Line 54: |
* MultiProtocolLabelSwitching (MPLS) | |
Line 37: | Line 55: |
* ObjectFile | |
Line 40: | Line 59: |
* PipeLine | |
Line 43: | Line 63: |
* ["Processor"] or CPU * QueuingTheory |
|
Line 44: | Line 66: |
* ["Register"] (MIPS register) | |
Line 45: | Line 68: |
* ResponseTime | |
Line 54: | Line 78: |
* SpeedUp * SuperScalar |
|
Line 57: | Line 83: |
* ThroughPut | |
Line 62: | Line 89: |
* VirtualMemory * WallClockTime |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
CyclesPerInstruction (CPI)
["Decidable"] and SemiDecidable
- ["Dichotomy"]
FloatingPointRepresentation (IEEE 754)
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication (|= symbol and also
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Processor"] or CPU
- ["Register"] (MIPS register)
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula