n
(computing) A loader that places absolute code into main memory beginning with the initial address assigned by the assembler. No address manipulation is performed.
n
(computing) The time interval between the issuing of a request to read data from or write data to a storage device and the completion of this action.
n
(programming) A register or variable used for holding the intermediate results of a computation or data transfer.
n
(computing) The process of sampling signals that measure real world physical conditions and converting these signals into digital numeric values that can be manipulated by a computer.
n
(computing) Any of several methods of locating and accessing information within storage
n
(computing) Synonym of cluster (“data storage unit”)
n
(computing) An interrupt vector representing a priority level, from which the processor determines the actual target address.
n
(computing) The execution of a subsidiary operation by a computer while the user works with another application.
n
(computing) An address serving as a point of reference for calculating other addresses.
v
(transitive, computing) To handle a set of input data or requests as a batch process.
n
(computing) A series of commands or programs that are executed without human intervention; the execution of such a series.
n
A manufacturing technique in which the product is created stage by stage over a series of workstations, and in different batches.
n
The size of (number of items in) a batch
n
(computing) A logical data storage unit containing one or more physical sectors (see cluster).
n
(computing) The length (in bytes, characters, etc.) of a block of data.
n
(computing) The size of a block of data (in a file or a transmission)
n
(computing) A digital circuit that tries to predict which way a branch structure will go, so as to improve the flow in the instruction pipeline.
n
The register in a CPU which contains the address of the next instruction to be executed or of an instruction to be branched to under certain circumstances
n
(computer science) A data structure containing buckets used in a hashing algorithm.
n
(computing theory) A form of memory allocation that divides memory into partitions to try to satisfy a memory request as suitably as possible.
n
(computing) A behavioural design pattern that consists of a source of command objects and a series of processing objects.
n
(computing) Alternative form of chain code [(computing) A program that compresses a monochrome image]
n
(computing) A discrete segment of a file, stream, etc. (especially one that represents audiovisual media); a block.
n
(computing) The time between two adjacent pulses of the oscillator that regulates the tempo of the computer processor.
n
(computing) A logical data storage unit containing one or more physical sectors (see block).
n
(software engineering) a computer model
n
(software engineering) a computer model
adj
Having undergone computerisation.
n
The study of computers and computer programming.
adj
(computing, of code) Designed to run independently, rather than sequentially, using various mechanisms, such as threads, event loops or time-slicing.
n
(computing, informal) Configuration.
n
(systems theory) A function that controls the recording, processing, transmission, or interpretation of data.
n
(computer graphics) Any of a series of points defining the shape of a curve etc.
n
(computing) A process that explicitly yields control to other processes or to the operating system.
n
(computing) An automated task that runs at specific intervals.
n
(computing) A general technique that binds together two data sources (or two separate representations of the same data) and keeps them synchronized.
n
Alternative spelling of datamine [The act or result of datamining.]
n
Alternative spelling of datasource [(computing) A source of data; typically a database]
n
(data management, slang) The process of transforming and mapping data from one raw data form into another format with the intent of making it more appropriate for a variety of downstream purposes such as visualization and analytics.
n
(computing) Synonym of stamp coupling
n
Alternative spelling of data flow [(computing) The route between origin, via nodes, to a destination taken by a packet of data]
n
(computing) A two-dimensional array of data items, rather like a spreadsheet.
adj
Obtained by data mining
n
(computing) Auxiliary data embedded in a datafile for subsequent identification and verification of the file.
n
(computing) Synonym of random access
n
(computer graphics) A sequence of commands that define a graphical output.
n
The process of aggregating the power of several computers to collaboratively run a single computational task in a transparent and coherent way.
n
(computing) Such a region used as a data storage element in a bubble memory.
n
(computing) An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail).
n
(programming) Part of a system that serves as a hook, allowing third-party code to intercept and modify behaviour at that point.
n
(computing) Synonym of instruction cycle
n
(computing, countable) An automatic switch to a secondary system on failure of the primary system, such as a means for ensuring high availability of some critical resource (such as a computer system), involving a parallel backup system which is kept running at all times, so that, upon detected failure of the primary system, processing can be automatically shifted over to the backup.
n
(computing) The use of femtocaches
n
(computer science) A variable or memory location that stores a true-or-false, yes-or-no value, typically either recording the fact that a certain event has occurred or requesting that a certain optional action take place.
n
(computing) One floating-point operation per second, a unit of measure of processor speed.
n
(programming) A dynamic array that allows efficient insertion and deletion operations clustered near the same location.
n
Alternative form of hashrate [(computing, cryptocurrencies) The number of proof of work hashes that a mining computer can make in a given period of time, usually a second.]
n
(computing, cryptocurrencies) The number of proof of work hashes that a mining computer can make in a given period of time, usually a second.
n
Alternative spelling of hash table [(programming) An associative array implemented as a vector, the indexes into which are the result of applying a hash function to the key.]
n
(computing) Synonym of fat client
adj
(computing) Implemented within a hypervisor
n
(computing) A form of microprocessor parallelization where each physical processor is treated as two virtual processors.
n
(computing) A unit of time defined by the frequency of its basic timer – historically, and by convention, 0.01 of a second, but some computer operating systems use other values.
n
(computing theory) A kind of sorted linked list with additional pointers to connect data items that are various distances apart.
n
(computing) Any of the parallel slots in which values can be stored in a SIMD architecture.
n
(computing theory) A counter or variable that is incremented whenever an event of interest occurs, and also periodically decremented; used in algorithms to check whether events will gradually overflow the system's capacity, for example in a telecommunication network.
n
(programming) Data that looks random, as when outputting a binary file as text.
n
(computing, often attributive) The point at which a program is put into an executable state.
n
(computing) Code written using macros.
n
(computing, mathematics) An applet written in the computer algebra system Maple.
n
(computing, electronics) A software or hardware component that performs a mapping.
n
(computing) A memory access as part of processing.
n
(computing) computing by means of a memcomputer
n
(computing) The use of a metapipeline.
n
A programmer who develops microprograms.
n
(computing) a computer program that simulates a physical system
n
A self-contained component of a system, often interchangeable, which has a well-defined interface to the other components.
adj
(computing) single-platform
n
(computing) Running a single program at a time within a single address space
n
Alternative form of multitasking [(computing) The simultaneous execution of multiple tasks (programs) under the control of an interrupt-driven operating system.]
adj
Alternative form of multiuser [(computing, telecommunications) Of a operating system, etc., having capabilities for serving many users simultaneously.]
n
(computing) The availability of different addresses at the same network endpoint.
adj
(computing) Having several operating systems available, such that any of them can be selected each time the computer is booted.
n
(computing) The use of more than one buffer.
n
(computing) A technique to increase the reliability of a network connection by means of additional, alternative network interfaces or IP addresses.
n
(computing) A licence to have the same software on multiple devices
n
(telecommunications) A form of inverse multiplexing.
n
(computing, dated) A piece of software that multiloads.
n
Computation using more than one processor.
n
(computing) The allocation of computing resources to more than one concurrent application, job, or user.
v
(computing) To operate multiple simultaneous sessions, for example allowing many users to be active at one time.
v
(computing) To schedule and execute multiple tasks (program) simultaneously; control being passed from one to the other using interrupts.
n
(computing) The situation in which a single instance of software, running in a server, serves multiple tenants
n
(computing) The use of multithreaded code.
n
(computing) multiuser capability; the ability of a computer system to process requests from multiple users at the same time
adj
(computing, telecommunications) Of a operating system, etc., having capabilities for serving many users simultaneously.
n
(computing) multiuser capability; the ability of a computer system to process requests from multiple users at the same time
n
Alternative form of page table [(computing) A data structure used by a virtual memory implementation to store the mappings between physical and virtual addresses.]
n
(computing) The separation of data into batches, so that it can be retrieved with a number of smaller requests.
n
(historical) Any of the early calculating machines devised by Blaise Pascal
n
(computing) A human-readable specification for a location within a hierarchical or tree-like structure, such as a file system or as part of a URL.
n
(computing) The rule of thumb that there should be at least one CPU for each user of a system.
n
The act of retrieving, storing, classifying, manipulating, transmitting etc. data, especially via computer techniques.
n
(computing) A software program that measures the performance of different portions of another program in order to locate bottlenecks.
n
A calculator that allows the user to write programs.
n
(computing) The execution of parallel processes on a unicore system.
n
(computing) Processing of a specific set of instructions for extracting particular data.
n
(computing) The maximum number of requests in a given timeframe that are able to be made to a server that uses rate limiting.
n
(computing) A piece of software that performs rate limiting.
n
(computing) The duration required by a computer system to complete a particular task.
n
(computing) The highest directory of a directory structure which may contain both files and subdirectories.
n
(computing) The amount of time during which a program is executing.
n
(computer hardware) fixed-sized unit (traditionally 512 bytes) of sequential data stored on a track of a digital medium (compare to block)
n
(computing) A region of memory or a fragment of an executable file designated to contain a particular part of a program.
n
(computing) A pointer to a structure describing a segment of memory.
adj
(computing) Of a operating system, etc., only capable of execution of one task (program or app) at a time, not many tasks simultaneously.
n
(computing) The amount by which a cache can grow or shrink, used in memory allocation.
n
(programming) A contiguous portion of an array.
n
(computing) A software interrupt request.
n
(computing) The time required to execute a parallel algorithm on an infinite number of processors, i.e. the shortest distance across a directed acyclic graph representing the computation steps.
n
(computing) The function of a front-end software system which processes input in the form of spoken language into a sequence of phonemes or characters, or into electronic commands for a computing system.
n
(chiefly computing) The relationship between time taken and number of processors used.
n
(computing) The use of spreadsheets.
n
(computer science) A part of a real or virtual machine which acts as a machine in its own right.
n
(computing, graphical user interface) A secondary or subsidiary view.
n
(computing) The design and use of supercomputers.
n
(computing) A technique for improving the performance of a processor by splitting instructions into many separate "pipelines" that can be executed more or less in parallel.
n
(computing) In parallel computer architectures, a homogeneous network of tightly coupled data processing units (DPUs), each of which independently computes a partial result as a function of the data received from its upstream neighbors, stores the result within itself, and passes it downstream.
n
(computing) A process or execution of a program.
n
(computing) A unit of execution, lighter in weight than a process, usually sharing memory and other resources with other threads executing concurrently.
n
(computing) A pool of threads of execution created to perform a number of tasks.
n
(computing) The period of time for which a process is allowed to run in a preemptive multitasking system.
n
(computing) A set of tools for software development, often used in sequence so that the output of one tool comprises the input of the next.
n
A logical construction modelling the operation of the network switch, just as in theoretical computer science a Turing machine models the operation of a computer.
n
(computing) The actual amount of time taken from the start to the end of an operation, as opposed to CPU time, which only includes the periods of time during which the CPU was processing instructions.
n
(computing) The use of workgroups.
n
(computing theory) The amount of memory required by a process in a given time interval.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 7 letters and means "No longer existing; died out." Can you find it?