Hierarchical parallelism control for multigrain parallel processing

17Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To improve effective performance and usability of shared memory multiprocessor systems, a multi-grain compilation scheme, which hierarchically exploits coarse grain parallelism among loops, subroutines and basic blocks, conventional loop parallelism and near fine grain parallelism among statements inside a basic block, is important. In order to efficiently use hierarchical parallelism of each nest level, or layer, in multigrain parallel processing, it is required to determine how many processors or groups of processors should be assigned to each layer, according to the parallelism of the layer. This paper proposes an automatic hierarchical parallelism control scheme to assign suitable number of processors to each layer so that the parallelism of each hierarchy can be used efficiently. Performance of the proposed scheme is evaluated on IBM RS6000 SMP server with 8 processors using 8 programs of SPEC95FP. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Obata, M., Shirako, J., Kaminaga, H., Ishizaka, K., & Kasahara, H. (2005). Hierarchical parallelism control for multigrain parallel processing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2481 LNCS, pp. 31–44). https://doi.org/10.1007/11596110_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free