% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@article{faucris.106483784,
abstract = {A parallel processor network is called n-universal with slowdown s if it can simulate each computation of each constant-degree processor network with n processors with slowdown s. We prove the following lower bound tradeoff: for each constant-degree n-universal network of size m with slowdown s,m·s = Ω(n log m) holds. Our tradeoff holds for a very general model of simulations. It covers all previously considered models and all known techniques for simulations among networks. For m ≥ n, this improves a previous lower bound by a factor of log log n, proved for a weaker simulation model. For m ≥ n, this is the first nontrivial lower bound for this problem. In this case this lower bound is asymptotically tight.},
author = {Wanka, Rolf and Meyer auf der Heide, Friedhelm and Storch, Martin},
doi = {10.1007/s002240000071},
faupublication = {no},
journal = {Theory of Computing Systems},
pages = {627-644},
peerreviewed = {Yes},
title = {{Optimal} tradeoffs between size and slowdown for universal parallel networks},
volume = {30},
year = {1997}
}