1333
Comment:
|
2793
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AddressingModes * AmdahlsLaw |
|
Line 4: | Line 6: |
* AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm * BoothsAlgorithm * CaChe * CacheBlock * CacheCoherenceProtocols * CacheLine |
|
Line 6: | Line 17: |
* CpuTime * CriticalSection * CyclesPerInstruction (CPI) * DataPath * ["Decidable"] and SemiDecidable * DelayBandwidthProduct * DelayedBranch |
|
Line 10: | Line 28: |
* DynamicSetOperations * ExecutionTime * ExpectedValue * FileSystem (Free BSD) |
|
Line 12: | Line 34: |
* FiveClassicPartsOfaComputer * FixedPoint * FloatingPointRepresentation (IEEE 754) |
|
Line 13: | Line 38: |
* FrameBuffer * FreeBooleanAlgebra * GeometricMean * GraphTheoryPage |
|
Line 14: | Line 43: |
* GroundBooleanTerm * HammingCode * HardwareDesignPrinciples |
|
Line 15: | Line 47: |
* InformationRetrieval | |
Line 20: | Line 53: |
* InstructionSetArchitecture (ISA) * InvertedFile |
|
Line 21: | Line 56: |
* LogicalMemory | |
Line 22: | Line 58: |
* ["Latency"] * LeastFixedPoint |
|
Line 23: | Line 61: |
* LinkerSteps | |
Line 25: | Line 64: |
* MemoryHierarchy * MemoryStallClockCycles |
|
Line 27: | Line 68: |
* MultiProtocolLabelSwitching (MPLS) | * MonotoneBooleanTerm * ObjectFile |
Line 30: | Line 72: |
* PageTable * ["Performance"] * PipeLine * PostingsFile |
|
Line 31: | Line 77: |
* PresburgerArithmetic | |
Line 33: | Line 80: |
* ["Processor"] or CPU * QueuingTheory * RaceCondition * RecursivelyEnumerableSets * ["Register"] (MIPS register) * RelationallyComplete * ResponseTime |
|
Line 38: | Line 92: |
* SemiDecidable and ["Decidable"] | |
Line 40: | Line 95: |
* SpatialExtent * SpeedUp * SuperScalar |
|
Line 41: | Line 99: |
* ["taxonomy"] * TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 42: | Line 104: |
* ["taxonomy"] | * TreeStructures |
Line 46: | Line 108: |
* 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"]
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