Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The assignment of computational tasks among processors in a distributed system
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Approximating the Minimum Chain Completion problem
Information Processing Letters
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
Ordered optimal solutions and parametric minimum cut problems
Discrete Optimization
On minimizing the resource consumption of cloud applications using process migrations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In a two-processor distributed computer network, prior research showed that a maximum flow algorithm can be used to find optimal program-module-to-processor assignments to maximize the performance of distributed programs. This paper examines the sequence of optimal assignments found as the load on one processor is held fixed and the load on the other is varied. For every program module M there exists a critical load factor fM such that when the load on the processor with variable load is below fM, M is assigned to that processor by an optimal assignment, and is otherwise assigned to the other processor. This characteristic opens the possibility of doing optimal dynamic assignments in real-time.