HPM: a hierarchical model for parallel computations

Authors:
Xiangzhen Qiao;Shuqing Chen;Laurence Tianruo Yang
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100080, PR China.;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100080, PR China.;Department of Computer Science, St. Francis Xavier University, Antigonish, NS B2G 2W5, Canada.
Venue:
International Journal of High Performance Computing and Networking
Year:
2004

Citing 9
Cited 1

A bridging model for parallel computation

Communications of the ACM
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Introduction to parallel algorithms

Introduction to parallel algorithms
What's next in high-performance computing?

Communications of the ACM - Ontology: different ways of representing the same concept
Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches

Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches
Parallel Computer Architecture: A Hardware/Software Approach

Parallel Computer Architecture: A Hardware/Software Approach
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Optimization of Parallel Algorithms on Cluster of SMP's

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hierarchical model for parallel computations is introduced and evaluated in this paper. This model describes the general homogeneous parallel computer systems with Hierarchical Parallelism and hierarchical Memories (named as HPM). The HPM model consists of a hierarchy of ERAMs that cooperate with each other. A parallel function HP describes the multi-level parallelism of the system. The memory function Hm shows the characteristics of the hierarchical memories. The organisation for implementing the memory accesses or data communication in a computer system is known by a joint name: generalised hierarchical memories. The binding relation HB gives the relation connecting parallelism and hierarchical memories. The HB defines the organisation of synchronisation between the subsystems, and forms the hierarchy relation tree. The performance of HPM algorithms is discussed. The 'generalised locality' and 'memory consistency' are proposed to analyse the algorithm performance. Their usage and examples are also given.