Issue No. 11 - November (1984 vol. 33)
D.A. Reed , Department of Computer Science, University of Illinois
Because a group of interconnected microcomputers may not share any globally addressable memory, it is crucial that a multimicrocomputer interconnection network capable of efficiently supporting message passing be found. Using task precedence graphs to represent the time varying behavior of parallel computations, both the behavior of interconnection networks under varying workloads and the feasibility of distributed scheduling are investigated.
simulation, Distributed scheduling, microcomputer networks, parallel systems, precedence graphs
D. Reed, "The Performance of Multimicrocomputer Networks Supporting Dynamic Workloads," in IEEE Transactions on Computers, vol. 33, no. , pp. 1045-1048, 1984.