P = FS: Parallel is Just Fast Serial

10/02/2020
by   Neil J. Gunther, et al.
0

We prove that parallel processing with homogeneous processors is logically equivalent to fast serial processing. The reverse proposition can also be used to identify obscure opportunities for applying parallelism. To our knowledge, this theorem has not been previously reported in the queueing theory literature. A plausible explanation is offered for why this might be. The basic homogeneous theorem is also extended to optimizing the latency of heterogenous parallel arrays.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Parallelism Theorem and Derived Rules for Parallel Coherent Transformations

An Independent Parallelism Theorem is proven in the theory of adhesive H...
research
11/02/2018

Efficient Generation of Parallel Spin-images Using Dynamic Loop Scheduling

High performance computing (HPC) systems underwent a significant increas...
research
02/20/2019

Towards Work-Efficient Parallel Parameterized Algorithms

Parallel parameterized complexity theory studies how fixed-parameter tra...
research
02/06/2013

Exploring Parallelism in Learning Belief Networks

It has been shown that a class of probabilistic domain models cannot be ...
research
06/27/2022

A homogeneous Rayleigh quotient with applications in gradient methods

Given an approximate eigenvector, its (standard) Rayleigh quotient and h...
research
11/29/2019

Equivalence of the Hazard Rate and Usual Stochastic Orders for Parallel Systems

In this paper, we investigate stochastic comparisons of parallel systems...

Please sign up or login with your details

Forgot password? Click here to reset