Message scheduling for array re-decomposition on distributed memory systems

  • Authors:

  • Jue Wang;Changjun Hu;Jilin Zhang;Jianjiang Li

  • Affiliations:

  • Department of Computer Science and Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China;Department of Computer Science and Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China;Department of Computer Science and Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China;Department of Computer Science and Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

For many parallel applications on distributed memory systems, array re-decomposition is usually required to enhance data locality and reduce the communication overheads. How to effectively schedule messages to improve the performance of array re-decomposition has received much attention in recent years. This paper is devoted to develop efficient scheduling algorithms using the compiling information provided by array distribution patterns, array alignment patterns and the periodic property of array accesses. Our algorithms not only avoid inter-processor contention, but also reduces real communication cost and communication generation time. The experimental results show that the performance of array redecomposition can be significantly improved using our algorithms