Find link

language:

Find link is a tool written by Edward Betts.

searching for Random-access machine 26 found (71 total)

NC (complexity) (2,434 words) [view diff] exact match in snippet view article

parallel computer in the definition can be assumed to be a parallel, random-access machine (PRAM). That is a parallel computer with a central pool of memory

All nearest smaller values (1,334 words) [view diff] no match in snippet view article find links to article

programs, developed efficient algorithms to solve it in the Parallel Random Access Machine model; it may also be solved in linear time on a non-parallel computer

Bulk synchronous parallel (2,109 words) [view diff] no match in snippet view article find links to article

for designing parallel algorithms. It is similar to the parallel random access machine (PRAM) model, but unlike PRAM, BSP does not take communication and

Concurrency (computer science) (1,397 words) [view diff] exact match in snippet view article

concurrent systems have been developed, including: The parallel random-access machine The actor model Computational bridging models such as the bulk synchronous

Analysis of parallel algorithms (1,215 words) [view diff] exact match in snippet view article find links to article

presentation framework in the parallel algorithms books (for the parallel random-access machine PRAM model) and, as well as in the class notes . The overview below

Uzi Vishkin (1,782 words) [view diff] exact match in snippet view article find links to article

parallel random access machine (PRAM), which is a generalization for parallel computing of the standard serial computing model random-access machine (RAM)

Parallel programming model (1,205 words) [view diff] no match in snippet view article find links to article

machine Synchronous message passing Not specified None Parallel random access machine Shared memory Data Cilk, CUDA, OpenMP, Threading Building Blocks

Hardware acceleration (1,772 words) [view diff] exact match in snippet view article find links to article

processors, offering a possibility of implementing the parallel random-access machine (PRAM) model. It is common to build multicore and manycore processing

Abstract machine (2,703 words) [view diff] exact match in snippet view article find links to article

how an output of a function is computed given an input Parallel random-access machine – Abstract computer for designing parallel algorithmsPages displaying

XMTC (359 words) [view diff] exact match in snippet view article find links to article

that has the largest body of literature is called PRAM (parallel random-access machine ). This is not a coincidence, since PRAM is a natural way in which

Topological sorting (3,176 words) [view diff] exact match in snippet view article find links to article

been first described in print by Tarjan in 1976. On a parallel random-access machine, a topological ordering can be constructed in O((log n)2) time using

Computability (3,293 words) [view diff] exact match in snippet view article find links to article

based on concurrency have been developed, including the parallel random-access machine and the Petri net. These models of concurrent computation still

Computer science (6,669 words) [view diff] no match in snippet view article find links to article

computation including Petri nets, process calculi and the parallel random access machine model. When multiple computers are connected in a network while

Element distinctness problem (893 words) [view diff] exact match in snippet view article find links to article

real numbers, the decision-tree lower bound extends to the real random-access machine model with an instruction set that includes addition, subtraction

Time complexity (4,998 words) [view diff] exact match in snippet view article find links to article

chain ordering can be solved in polylogarithmic time on a parallel random-access machine, and a graph can be determined to be planar in a fully dynamic way

Prefix sum (5,242 words) [view diff] no match in snippet view article find links to article

the algorithm is O(n), and it can be implemented on a parallel random access machine with O(n/log n) processors without any asymptotic slowdown by assigning

Descriptive complexity theory (2,543 words) [view diff] no match in snippet view article find links to article

bounded depth, which equals the languages recognized by a concurrent random access machine in constant time. First-order logic augmented with symmetric or

Hidden-line removal (1,403 words) [view diff] exact match in snippet view article find links to article

problem under the concurrent read, exclusive write (CREW) parallel random-access machine (PRAM) model of computation. As the product of the processor number

Quantum programming (4,217 words) [view diff] no match in snippet view article find links to article

tightly connected with a model of quantum machine called Quantum Random Access Machine (QRAM). Scaffold is C-like language, that compiles to QASM and OpenQASM

Merge sort (6,727 words) [view diff] exact match in snippet view article find links to article

radix sort) that can operate in O(log n) time on a CRCW parallel random-access machine (PRAM) with n processors by performing partitioning implicitly.

Big O notation (8,416 words) [view diff] exact match in snippet view article find links to article

chain ordering can be solved in polylogarithmic time on a parallel random-access machine. O ( n c ) {\displaystyle O(n^{c})} 0 < c < 1 {\textstyle 0<c<1}

Quicksort (9,935 words) [view diff] exact match in snippet view article find links to article

on a CRCW (concurrent read and concurrent write) PRAM (parallel random-access machine) with n processors by performing partitioning implicitly. The most

Knapsack problem (7,559 words) [view diff] exact match in snippet view article find links to article

or rationals, the decision-tree lower bound extends to the real random-access machine model with an instruction set that includes addition, subtraction

Reduction operator (3,311 words) [view diff] no match in snippet view article find links to article

there are two main models of parallel computation, the parallel random access machine (PRAM) as an extension of the RAM with shared memory between processing

Parametric search (3,699 words) [view diff] exact match in snippet view article find links to article

by an efficient parallel algorithm, for instance in the parallel random-access machine (PRAM) model of parallel computation, where a collection of processors

Parallel breadth-first search (4,465 words) [view diff] no match in snippet view article find links to article

level + 1; As a simple and intuitive solution, the classic Parallel Random Access Machine (PRAM) approach is just an extension of the sequential algorithm