Optimising the time cost of multiple groups of parallel branches with two communication nodes within parallel structure

  • Authors:

  • Ali I. El-dousky;Hesham A. Ali

  • Affiliations:

  • Computer and Control Department, Faculty of Engineering, Mansoura Reda A. Ammar University, Egypt.;Computer Science Department, University of Connecticut, Storrs, CT 06269-3155, USA

  • Venue:
  • International Journal of Computer Applications in Technology
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finding the optimal accessing order to the critical section within a parallel structure will result in saving time cost of the overall execution time of the parallel program. A parallel computation model is used to represent the detailed time cost of the parallel structure (portion of the program). Most of the previous research considered the parallel structure with one communication node and few of the researches considered a parallel structure with two communication nodes. The extension of these efforts considered a parallel structure with more than one group; one such extension was developed solely for the parallel structure with one communication node. In this paper another extension of the problem is proposed, that is, a parallel structure with two communication nodes. The main objective of this paper is to introduce (a) optimisation of the time cost for such parallel structure; (b) allocation and scheduling techniques for solving the problem associated with parallel structure (number of groups is less than the number of shared memory modules, and/or the number of processors is less than the degree of parallelism).