P = FS: Parallel is Just Fast Serial
Performance
2020-10-05 v1 Distributed, Parallel, and Cluster Computing
Networking and Internet Architecture
Abstract
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.
Cite
@article{arxiv.2010.00754,
title = {P = FS: Parallel is Just Fast Serial},
author = {Neil J. Gunther},
journal= {arXiv preprint arXiv:2010.00754},
year = {2020}
}
Comments
7 pages, 3 figures, 1 Table