Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
An efficient K-way graph partitioning algorithm for task allocation in parallel computing systems
ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Optimal Task Assignment in Linear Array Networks
IEEE Transactions on Computers
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Clustering and reassignment-based mapping strategy for message-passing architectures
Journal of Systems Architecture: the EUROMICRO Journal
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
Journal of Systems and Software
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
On the mapping between logical and physical topologies
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Smart distribution of bio-signal processing tasks in m-health
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
A marketplace for cloud resources
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Parallel programming with data driven model
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Scheduling large jobs by abstraction refinement
Proceedings of the sixth conference on Computer systems
HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
Mathematical and Computer Modelling: An International Journal
Power and task management in wireless body area network based medical monitoring systems
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part IV
On minimizing the resource consumption of cloud applications using process migrations
Journal of Parallel and Distributed Computing
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
Hi-index | 0.00 |
This paper considers the problem of assigning the tasks of a distributed application to the processors of a distributed system such that the sum of execution and communication costs is minimized. Previous work has shown this problem to be tractable for a system of two processors or a linear array of N processors, and for distributed programs of serial parallel structures. Here we focus on the assignment problem on a homogeneous network, which is composed of N functionally-identical processors, each with its own memory. Some processors in the network may have unique resources, such as data files or certain peripheral devices. Certain tasks may have to use these unique resources; they are called attached tasks. The tasks of a distributed program should therefore be assigned so as to make use of specific resources located at certain processors in the network while minimizing the amount of interprocessor communication. The assignment problem in such a homogeneous network is known to be NP-hard even for N = 3, thus making it intractable for a network with a medium to large number of processors. We therefore focus on task assignment in general array networks, such as linear arrays, meshes, hypercubes, and trees. We first develop a modeling technique that transforms the assignment problem in an array or tree into a minimum-cut maximum-flow problem. The assignment problem is then solved for a general array or tree network in polynomial time.