Processor equivalence for daisy chain load sharing processors
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 29 (4) , 1216-1221
- https://doi.org/10.1109/7.259524
Abstract
A linear daisy chain of processors in which processor load is divisible and shared among the processors is examined. It is shown that two or more processors can be collapsed into a single equivalent processor. This equivalence allows a characterization of the nature of the minimal time solution, a simple method to determine when to distribute load for linear daisy chain networks of processors without front end communication subprocessors and closed form expressions for the equivalent processing speed of infinitely large daisy chains of processors.Keywords
This publication has 17 references indexed in Scilit:
- Bus-oriented load sharing for a network of sensor driven processorsIEEE Transactions on Systems, Man, and Cybernetics, 1991
- Load sharing in distributed real-time systems with state-change broadcastsIEEE Transactions on Computers, 1989
- Minimizing Schedule Length Subject to Minimum Flow TimeSIAM Journal on Computing, 1989
- Distributed scheduling of tasks with deadlines and resource requirementsIEEE Transactions on Computers, 1989
- GAMMON: a load balancing strategy for local computer systems with multiaccess networksIEEE Transactions on Computers, 1989
- Heuristic algorithms for task assignment in distributed systemsIEEE Transactions on Computers, 1988
- Assignment Problems in Parallel and Distributed ComputingPublished by Springer Nature ,1987
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Algorithms minimizing mean flow time: schedule-length propertiesActa Informatica, 1976