Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Unconstrained 0–1 optimization and Lagrangian relaxation
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs
IEEE Transactions on Parallel and Distributed Systems
Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Modeling Multicomputer Task Allocation as a Vector Packing Problem
ISSS '96 Proceedings of the 9th international symposium on System synthesis
The task allocation problem with constant communication
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
IEEE Transactions on Knowledge and Data Engineering
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Exact Solutions to Task Allocation Problems
Management Science
Journal of Computational and Applied Mathematics
Quantum evolutionary algorithm for multi-robot coalition formation
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
Optimizing task layout on the Blue Gene/L supercomputer
IBM Journal of Research and Development
The task allocation problem with constant communication
Discrete Applied Mathematics
How many threads to spawn during program multithreading?
LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing
Brief paper: An improved differential evolution algorithm for the task assignment problem
Engineering Applications of Artificial Intelligence
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Using xQx to model and solve the uncapacitated task allocation problem
Operations Research Letters
| Hi-index | 0.01 |
This paper presents an efficient algorithm to solve one of the task allocation problems. Task assignment in an heterogeneous multiple processors system is investigated. The cost function is formulated in order to measure the intertask communication and processing costs in an uncapacited network. A formulation of the problem in terms of the minimization of a submodular quadratic pseudo-Boolean function with assignment constraints is then presented. The use of a branch-and-bound algorithm using a Lagrangean relaxation of these constraints is proposed. The lower bound is the value of an approximate solution to the Lagrangean dual problem. A zero-duality gap, that is, a saddle point, is characterized by checking the consistency of a pseudo-Boolean equation. A solution is found for large-scale problems (e.g., 20 processors, 50 tasks, and 200 task communications or 10 processors, 100 tasks, and 300 task communications). Excellent experimental results were obtained which are due to the weak frequency of a duality gap and the efficient characterization of the zero-gap (for practical purposes, this is achieved in linear time). Moreover, from the saddle point, it is possible to derive the optimal task assignment.