Optimal partitioning of randomly generated distributed programs
From MaRDI portal
Publication:3713587
DOI10.1109/TSE.1986.6312889zbMath0587.68025OpenAlexW1979229432MaRDI QIDQ3713587
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
Related Items (4)
An LC branch-and-bound algorithm for the module assignment problem ⋮ Unconstrained static scheduling with communication weights ⋮ A study of average-case speedup and scalability of parallel computations on static networks ⋮ Optimal task allocation in hyercube multiprocessor ensembles
This page was built for publication: Optimal partitioning of randomly generated distributed programs