Compiler technology for parallel scientific computation
Scientific Programming
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Improved Distribution Algorithm for Shortest Paths Problem
IEEE Transactions on Computers
Automated application component placement in data centers using mathematical programming
International Journal of Network Management
The task allocation problem with constant communication
Discrete Applied Mathematics
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Reassortment Networks for Investigating the Evolution of Segmented Viruses
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An operator placement algorithm for complex in-network processing
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
An improved partial solution to the task assignment and multiway cut problems
Operations Research Letters
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
Operations Research Letters
An algorithm for the multiprocessor assignment problem
Operations Research Letters
Adaptive distributed composite event detection
Proceedings of the 11th International Workshop on Adaptive and Reflective Middleware
The von Neumann architecture is due for retirement
HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems
| Hi-index | 0.01 |
The problem of optimally assigning the modules of a program over the processors of an inhomogeneous distributed processor system is analyzed. The objective is to assign modules, wherever possible, to the processors on which they execute most rapidly while taking into account the overhead of interprocessor communication. Factors contributing to the cost of an assignment are 1) the amount of computation required by each module, 2) the amount of data transmitted between each pair of modules, 3) the speed of each processor, and 4) the speed of the communication link between each pair of processors.