Optimal trade-offs between size and slowdown for universal parallel networks
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Meyer auf der Heide, FriedhelmLibreCat;
Storch, Martin;
Wanka, Rolf
Publishing Year
Proceedings Title
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95
ISBN
LibreCat-ID
Cite this
Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95. ; 1995. doi:10.1145/215399.215430
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95. https://doi.org/10.1145/215399.215430
@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430}, booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}, year={1995} }
Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995. https://doi.org/10.1145/215399.215430.
F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95, 1995.
Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995, doi:10.1145/215399.215430.