On module assignment in two-processor distributed systems

DOI10.1016/0020-0190(79)90050-4zbMath0416.68034OpenAlexW2070844878MaRDI QIDQ754638

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

distributed computingoptimal assignmentdata-base access costsmodular programmodule interactionnetwork flow algorithmsrunning coststree-structured interconnection graphtwo-processor systems

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

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