Multiprocessor Scheduling with the Aid of Network Flow Algorithms

In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive interprocessor communication while taking advantage of specific efficiencies of some processors in executing some program modules. In this paper we show that this program...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on software engineering 1977-01, Vol.SE-3 (1), p.85-93
Main Author:	Stone, H.S.
Format:	Article
Language:	eng
Subjects:	ARPANET Commodities Computer networks Costs cutsets distributed computers Distributed computing Fasteners Ford-Fulkerson algorithm load balancing Load management maximum flows Microprocessors Process design Processor scheduling Scheduling algorithm
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive interprocessor communication while taking advantage of specific efficiencies of some processors in executing some program modules. In this paper we show that this program module assignment problem can be solved efficiently by making use of the well-known Ford-Fulkerson algorithm for finding maximum flows in commodity networks as modified by Edmonds and Karp, Dinic, and Karzanov. A solution to the two-processor problem is given, and extensions to three and n-processors are considered with partial results given without a complete efficient solution.
ISSN:	0098-5589 1939-3520