Reference library
Foundations
Explore concepts, laws, equations and methods, with clear explanations of their use and sources. Choose an area of study or find a specific entry.
More filters
Reference entries
Showing 181–204 of 204 reference entries
Fischer, Lynch and Paterson prove that a deterministic consensus protocol in their fully asynchronous message-passing model can have an admissible nondeciding run with at most one crash.
Mathematical statementInformationRaft log replication, durable state and livenessRaft uses term-numbered leader election, majority voting and log matching to replicate a state machine under crash faults.
MethodInformationLinearizability and real-time operationsA linearizable object admits a sequential explanation in which each completed operation appears to take effect between invocation and response, preserving real-time precedence of nonoverlapping operations.
DefinitionInformationCAP under partitions: a precise consistency tradeoffIn Gilbert and Lynch's asynchronous read/write model, an implementation cannot provide both atomic consistency and a terminating response to every request at every nonfailed node during arbitrary partitions.
Mathematical statementInformationByzantine agreement and authentication assumptionsIn the synchronous oral-message Byzantine-generals model, agreement with at most f faulty participants requires at least 3f+1 participants, with identifiable senders and reliable delivery but no unforgeable transferred signature chain.
Mathematical statementInformationTwo's-complement signed integersA signed interpretation assigns a negative weight to the highest bit.
DefinitionInformationOctets and multi-byte orderByte order describes the significance assigned to successive stored octets.
DefinitionInformationUnicode scalar values and UTF-8UTF-8 encodes scalar values with a variable number of octets.
DefinitionInformationText boundaries and Unicode normalizationText equality and character counts depend on the declared representation and convention.
MethodInformationIP addresses and datagram deliveryIP addresses identify network destinations; IP does not guarantee delivery.
DefinitionInformationUDP datagram serviceUDP exchanges addressed messages without adding reliable stream delivery.
DefinitionInformationDNS names, records and cachingDNS distributes typed resource records through a delegated naming hierarchy.
DefinitionInformationCombinational digital-circuit modelA combinational output depends on current valid inputs after a bounded settling delay.
ModelInformationBoolean gates and truth tablesLogic gates compute Boolean functions with truth values 0 and 1.
DefinitionInformationClocked storage and sequential stateSequential circuits retain state, so current inputs alone do not determine their behavior.
ModelInformationStored programs and instruction setsStored instructions control computation through a specified hardware/software interface.
ModelInformationProgram names, bindings and assignmentNames refer to values through an execution environment.
DefinitionInformationSequence, conditionals and loopsSelection and repetition determine which program statements execute.
DefinitionInformationFunction definitions, parameters and callsA call connects arguments with local parameter bindings.
DefinitionInformationRecursive procedures and base casesSelf-calls reduce a problem toward a terminating case.
MethodInformationData types and checkingTypes describe values and permitted operations; checks occur at different stages.
DefinitionInformationPrograms and processesAn operating system manages a program's execution as a process.
DefinitionInformationVirtual address spacesA process's address view is distinct from physical memory placement.
DefinitionInformationFiles, directories and persistenceFile contents, directory names and durable storage have distinct roles.
Definition