Degree of parallelism

The degree of parallelism (DOP) is a metric which indicates how many operations can be or are being simultaneously executed by a computer. It is used as an indicator of the complexity of algorithms, and is especially useful for describing the performance of parallel programs and multi-processor systems.^[1]

A program running on a parallel computer may utilize different numbers of processors at different times. For each time period, the number of processors used to execute a program is defined as the degree of parallelism. The plot of the DOP as a function of time for a given program is called the parallelism profile.^[2]

References

^ Deprettere, Ed F.; Takala, Jarmo; Leupers, Rainer; Bhattacharyya, Shuvra S., eds. (13 October 2018). Handbook of Signal Processing Systems. Springer International Publishing. p. 552. ISBN 9783319917344. Retrieved 12 April 2023.
^ Wagner, Thomas D.; Carlson, Brian M. (20 April 1994). An Algorithm for Off-Line Detection of Phases in Execution Profiles. ISBN 9783540580218. Retrieved 12 April 2023.

This computer science article is a stub. You can help Wikipedia by expanding it.

[handbook-1] Deprettere, Ed F.; Takala, Jarmo; Leupers, Rainer; Bhattacharyya, Shuvra S., eds. (13 October 2018). Handbook of Signal Processing Systems. Springer International Publishing. p. 552. ISBN 9783319917344. Retrieved 12 April 2023.

[wagnercarlson-2] Wagner, Thomas D.; Carlson, Brian M. (20 April 1994). An Algorithm for Off-Line Detection of Phases in Execution Profiles. ISBN 9783540580218. Retrieved 12 April 2023.

[1]

[2]

v t e Parallel computing
General	Distributed computing Parallel computing Massively parallel Cloud computing High-performance computing Multiprocessing Manycore processor GPGPU Computer network Systolic array
Levels	Bit Instruction Thread Task Data Memory Loop Pipeline
Multithreading	Temporal Simultaneous (SMT) Simultaneous and heterogenous Speculative (SpMT) Preemptive Cooperative Clustered multi-thread (CMT) Hardware scout
Theory	PRAM model PEM model Analysis of parallel algorithms Amdahl's law Gustafson's law Cost efficiency Karp–Flatt metric Slowdown Speedup
Elements	Process Thread Fiber Instruction window Array
Coordination	Multiprocessing Memory coherence Cache coherence Cache invalidation Barrier Synchronization Application checkpointing
Programming	Stream processing Dataflow programming Models Implicit parallelism Explicit parallelism Concurrency Non-blocking algorithm
Hardware	Flynn's taxonomy SISD SIMD Array processing (SIMT) Pipelined processing Associative processing MISD MIMD Dataflow architecture Pipelined processor Superscalar processor Vector processor Multiprocessor symmetric asymmetric Memory shared distributed distributed shared UMA NUMA COMA Massively parallel computer Computer cluster Beowulf cluster Grid computer Hardware acceleration
APIs	Ateji PX Boost Chapel HPX Charm++ Cilk Coarray Fortran CUDA Dryad C++ AMP Global Arrays GPUOpen MPI OpenMP OpenCL OpenHMPP OpenACC Parallel Extensions PVM pthreads RaftLib ROCm UPC TBB ZPL
Problems	Automatic parallelization Deadlock Deterministic algorithm Embarrassingly parallel Parallel slowdown Race condition Software lockout Scalability Starvation
Category: Parallel computing

See also

References