Work-preserving emulations of fixed-connection networks

DOI10.1145/256292.256299zbMath0883.68011OpenAlexW2021670981MaRDI QIDQ4371700

Eric J. Schwabe, Arnold L. Rosenberg, Satish B. Rao, Richard R. Koch, Bruce M. Maggs, Frank Thompson Leighton

Publication date: 22 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

work-preserving emulations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

Related Items (9)

Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram ⋮ Efficient out-of-core algorithms for linear relaxation using blocking covers ⋮ Real-time emulations of bounded-degree networks ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ A complexity theory of efficient parallel algorithms ⋮ New graph decompositions with applications to emulations ⋮ Efficient automatic simulation of parallel computation on networks of workstations ⋮ Exposing graph uniformities via algebraic specification

This page was built for publication: Work-preserving emulations of fixed-connection networks