Simulation studies on the performance of an organizational model for graph reduction

Abstract

This paper deals with the performance evaluation of an organizational model for parallel graph reduction, based on the de Bruijn interconnection scheme. For this machine, two scheduling policies, one of which is a static mechanism, and the other, a dynamic one based on the concept of diffusion scheduling, are considered. It is shown through simulations that the simple static scheduling policy does reasonably well and the performance cannot be significantly improved by the dynamic policy which is more complex and incurs higher overheads.