Operations research: principles and practice, 2nd ed.
Operations research: principles and practice, 2nd ed.
Medusa: an experiment in distributed operating system structure
Communications of the ACM
Optimizing decision trees through heuristically guided search
Communications of the ACM
Dynamic Programming
A nonlinear multiprocessor scheduling problem.
A nonlinear multiprocessor scheduling problem.
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
Assignment of Tasks in a Distributed Processor System with Limited Memory
IEEE Transactions on Computers
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
Critical Load Factors in Two-Processor Distributed Systems
IEEE Transactions on Software Engineering
Dual Processor Scheduling with Dynamic Reassignment
IEEE Transactions on Software Engineering
Control of Distributed Processes
Computer
A Task Allocation Model for Distributed Computing Systems
IEEE Transactions on Computers
An improved partial solution to the task assignment and multiway cut problems
Operations Research Letters
An algorithm for the multiprocessor assignment problem
Operations Research Letters
| Hi-index | 0.00 |
The flexibility afforded by multiprocessor systems opens the question of how to assign computer program modules among functionally similar processors in a distributed computer network. In the model under consideration, the modules of a program are to be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. The problem is formalized as a zero-one quadratic programming problem, and a solution is sought through an iterative technique that performs a series of transformations on an assignment matrix. Convergence to a locally optimum assignment is guaranteed, and an easily testable condition is given for which this local optimum is also a global optimum. An illustration of this algorithm is provided, results of performance experiments are reported, and suggestions are made for further study.