Time-processor trade-offs for universal parallel computers
Various kinds of simulations among parallel computers are considered. We prove that it is not possible to simulate all parallel computers by one without an additional expense of time or of processors. Then we present a parallel computer which can simulate all parallel computers with n processors and which needs c·n2log(n) processors and extends the time only by a factor d·log log(n).
KeywordsTime Loss Random Access Machine Permutation Network Simulation Processor Pairwise Disjoint Pathes
Unable to display preview. Download preview PDF.