Task assignment in distributed systems using network flow methods

DOI10.1007/3-540-61576-8_98MaRDI QIDQ6567698zbMATH OpenFDO

Authors Ioannis Milis

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61576-8_98

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Flows in graphs (05C21) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 553908
• An improved partial solution to the task assignment and multiway cut problems
• Task assignment in distributed computing systems
• Task allocation model for distributed systems
• An algorithm for the multiprocessor assignment problem

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Allocating programs containing branches and loops within a multiple processor system
• An LC branch-and-bound algorithm for the module assignment problem
• An algorithm for the multiprocessor assignment problem
• An efficient algorithm for a task allocation problem
• An improved partial solution to the task assignment and multiway cut problems
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Optimal task assignment in linear array networks

This page was built for publication: Task assignment in distributed systems using network flow methods

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