HPM: a hierarchical model for parallel computations Online publication date: Fri, 05-Aug-2005
by Xiangzhen Qiao, Shuqing Chen, Laurence Tianruo Yang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 1, No. 1/2/3, 2004
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook