On module assignment in two-processor distributed systems

DOI10.1016/0020-0190(79)90050-4MaRDI QIDQ754638zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(79)90050-4

zbMATH Keywords

data-base access costsdistributed computingmodular programmodule interactionnetwork flow algorithmsoptimal assignmentrunning coststree-structured interconnection graphtwo-processor systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Deterministic network models in operations research (90B10)

Cites work

• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

Cited in

(4)

• A methodology for multicriteria network partitioning
• Analysis of the module assignment problem in distributed computing systems with limited storage
• An LC branch-and-bound algorithm for the module assignment problem
• Task allocation model for distributed systems

This page was built for publication: On module assignment in two-processor distributed systems

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