Critical Load Factors in Two-Processor Distributed Systems
- 1 May 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-4 (3), 254-258
- https://doi.org/10.1109/tse.1978.231502
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Assignment of Tasks in a Distributed Processor System with Limited MemoryIEEE Transactions on Computers, 1979
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- Experience with distributed processing on a host/satellite graphics systemPublished by Association for Computing Machinery (ACM) ,1976
- Intelligent satellites for interactive graphicsProceedings of the IEEE, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970