J4 ›› 2010, Vol. 07 ›› Issue (4): 631-635.

• 计算机科学 • 上一篇    下一篇

 基于任务量划分的紧嵌套循环自动并行化方法

闫昭, 刘磊   

  1. 吉林大学 计算机科学与技术学院, 长春 130012
  • 收稿日期:2009-08-25 出版日期:2010-07-26 发布日期:2011-06-14
  • 通讯作者: 刘磊 E-mail:liulei@jlu.edu.cn

An Automatic Parallelization Method for Tight Nested LoopsBased on Computation Decomposition by Workload

YAN Zhao, LIU Lei   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2009-08-25 Online:2010-07-26 Published:2011-06-14
  • Contact: LIU Lei E-mail:liulei@jlu.edu.cn

摘要:

采用计算任务量大小的方法, 解决了在紧嵌套循环自动并行化过程中存在循环并行化的并行粒度确定问题以及循环自动并行化中数据划分的数据访问局部性问题, 在多核系统中实现了紧嵌套循环自动并行化时的数据访问局部性方案和并行化方法, 从而构造了一个基于任务量划分的循环自动并行化模型, 降低了程序自动并行化中小任务量并行带来的开销.

关键词: 计算划分, 任务量, 数据划分, 数据访问局部性, 循环并行化

Abstract:

The authors proposed an automatic parallelization method on tight nested loops  that is running on multicore system. The method can be used to solve two problems according to the physical characteristics of multicore processors,  one is  data locality existing in data decomposition and the other is computation decomposition based on workload, and brought forward how to compute the workload of loop iteration that can be run in parallel. According to the size of  workload, we can determine the granularity of parallel loops so as  to reduce the parallel overhead brought by the parallel iteration of small workload. An automaticparallelization model based on workload can be constructed based on this method.

Key words: computation decomposition, workload, data decomposition, data locality, loop parallelization

中图分类号: 

  • TP311