Complexity analysis of new task allocation problem using network flow method on multicore clusters

DOI10.1155/2014/723497zbMath1407.90096OpenAlexW2070026487WikidataQ59071676 ScholiaQ59071676MaRDI QIDQ1719030

Jixiang Yang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/723497

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• The task allocation problem with constant communication.
• Exact Solutions to Task Allocation Problems
• Allocating programs containing branches and loops within a multiple processor system
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Optimal task assignment in linear array networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of new task allocation problem using network flow method on multicore clusters