Optimal partitioning of randomly generated distributed programs

DOI10.1109/TSE.1986.6312889MaRDI QIDQ3713587zbMATH OpenOpenAlexFDO

Authors Bipin Indurkhya, Harold S. Stone, Xicheng Lu

Publication date 1986

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1986.6312889

zbMATH Keywords

distributed computer systemdistributed programoptimal task-assignment

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(4)

• Optimal task allocation in hyercube multiprocessor ensembles
• A study of average-case speedup and scalability of parallel computations on static networks
• An LC branch-and-bound algorithm for the module assignment problem
• Unconstrained static scheduling with communication weights

This page was built for publication: Optimal partitioning of randomly generated distributed programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713587)