Task allocation in distributed processing systems
From MaRDI portal
Distributed processing in computer networks is a powerful development emanating from technological advances in computer science and communications research. An important unresolved problem in distributed processing is how to optimally allocate jobs among interconnected processors. We develop a dynamic programming algorithm which incorporates many of the essential problem elements. Computational results are encouraging for problems of realistic size.
Recommendations
Cited in
(31)- Optimal task allocation in hyercube multiprocessor ensembles
- Optimal task assignment with precedence in distributed computing systems
- Assignment of a job load in a distributed system: A multicriteria design method
- Algorithms of distributed task allocation for cooperative agents
- Dynamic task allocation in distributed computing systems by heuristic algorithms
- Distribution of computer jobs in automatic control systems on the basis of infinite-valued logic
- Assigning chain-like tasks to a chain-like network
- scientific article; zbMATH DE number 3885290 (Why is no real title available?)
- Task assignment in distributed computing systems
- Design of an algorithm for task assignment in distributed parallel database system
- Optimum Allocation of Processes in a Distributed Environment: A Process-to-Process Approach
- scientific article; zbMATH DE number 4167812 (Why is no real title available?)
- The complexity of finding Nash equilibria
- Allocating Independent Subtasks on Parallel Processors
- Packet task processing in distributed computational environments with inalienable resources
- scientific article; zbMATH DE number 4080874 (Why is no real title available?)
- Task allocation model for distributed systems
- Placement de tâches dans un système distribué et dualité lagrangienne
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- scientific article; zbMATH DE number 519989 (Why is no real title available?)
- scientific article; zbMATH DE number 719225 (Why is no real title available?)
- scientific article; zbMATH DE number 194602 (Why is no real title available?)
- Modelling and optimization of data assignment in a distributed information system
- scientific article; zbMATH DE number 220154 (Why is no real title available?)
- scientific article; zbMATH DE number 1902275 (Why is no real title available?)
- scientific article; zbMATH DE number 1905094 (Why is no real title available?)
- scientific article; zbMATH DE number 882117 (Why is no real title available?)
- Dynamic Task Allocation in Asynchronous Shared Memory
- Distributed dispatching in the parallel server model
- Job distribution algorithms
- Efficient allocation of chain-like task on chain-like network computers
This page was built for publication: Task allocation in distributed processing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083382)