|
Size: 1893
Comment:
|
Size: 2890
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AddressingModes * AmdahlsLaw |
|
| Line 8: | Line 10: |
| * BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine |
|
| Line 11: | Line 18: |
| * CriticalSection * CyclesPerInstruction (CPI) * DataPath |
|
| Line 12: | Line 22: |
| * DelayBandwidthProduct * DelayedBranch |
|
| Line 14: | Line 26: |
| * DelayBandwidthProduct | |
| Line 17: | Line 28: |
| * DynamicSetOperations | |
| Line 18: | Line 30: |
| * ExpectedValue * FileSystem (Free BSD) |
|
| Line 20: | Line 34: |
| * FirstOrderTheory * FiveClassicPartsOfaComputer |
|
| Line 21: | Line 37: |
| * FloatingPointRepresentation (IEEE 754) | |
| Line 22: | Line 39: |
| * FrameBuffer | |
| Line 24: | Line 42: |
| * GraphTheoryPage | |
| Line 26: | Line 45: |
| * HammingCode * HardwareDesignPrinciples |
|
| Line 27: | Line 48: |
| * InformationRetrieval | |
| Line 32: | Line 54: |
| * InstructionSetArchitecture (ISA) * InvertedFile |
|
| Line 33: | Line 57: |
| * LogicalMemory | |
| Line 35: | Line 60: |
| * LeastFixedPoint | |
| Line 36: | Line 62: |
| * LinkerSteps | |
| Line 38: | Line 65: |
| * MemoryHierarchy * MemoryStallClockCycles |
|
| Line 41: | Line 70: |
| * ObjectFile | |
| Line 43: | Line 73: |
| * PageTable | |
| Line 44: | Line 75: |
| * PipeLine * PostingsFile |
|
| Line 45: | Line 78: |
| * PresburgerArithmetic | |
| Line 47: | Line 81: |
| * ["Processor"] or CPU | |
| Line 48: | Line 83: |
| * RaceCondition | |
| Line 49: | Line 85: |
| * ["Register"] (MIPS register) | |
| Line 56: | Line 93: |
| * SemiAlgebraicSets | |
| Line 57: | Line 95: |
| * SemiLinearSets | |
| Line 61: | Line 100: |
| * SuperScalar | |
| Line 62: | Line 102: |
| * ["taxonomy"] | |
| Line 66: | Line 107: |
| * ["taxonomy"] | * TreeStructures |
| Line 69: | Line 110: |
| * UninterpretedFunctions | |
| Line 70: | Line 112: |
| * VirtualMemory |
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"]
FileSystem (Free BSD)
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