Analytical Modeling of Task Scheduling for Master-Slave Super- Hypercube Architecture

Abstract

This paper highlights the analytical modeling of task scheduling for a subclass of message passing architecture which is categorized as Master-Slave Super-Hypercube (MSSHP) topology. To establish this analytical modeling, its foundation based on Hypercube (HP) and Super-Hypercube architectures is first laid down and it is then expanded to include the MSSHP architecture. In order to highlight the advantages of the proposed modeling scheme, graphical presentations are introduced and compared. This comparison underlines the relationship between the time complexity for the HP and the new version for the MSSHP architecture. The outcome of this study reveals that the completion time for matrix product on the MSSHP is more favorable than Hypercube architecture.