Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal partitioning of randomly generated distributed programs

From MaRDI portal
Publication:3713587
Jump to:navigation, search

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


zbMATH Keywords

distributed computer systemdistributed programoptimal task-assignment


Mathematics Subject Classification ID

Theory of operating systems (68N25)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3713587&oldid=17213087"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 09:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki