A Hyperbolic Model for Communications in Layered Parallel Processing Environments

We introduce a model for communication costs in parallel processing environments, called the hyperbolic model, which generalizes two-parameter dedicated-link models in an analytically simple way. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes and internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. ACBis characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. Rules are given for reducing a communication graph consisting of manyCBs to an equivalent two-parameter form, while maintaining a good approximation for the service time. We demonstrate a tight fit of the estimates of the cost of communication based on the model with actual measurements of the communication and synchronization time between end processes. We compare the hyperbolic model with other two-parameter models and, in appropriate limits, show its compatibility with the LogP model.

[1]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[2]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[3]  Chris R. Jesshope,et al.  Parallel Computers 2: Architecture, Programming and Algorithms , 1981 .

[4]  William Stallings,et al.  Data and Computer Communications , 1985 .

[5]  William Stallings,et al.  Data and computer communications (2nd ed.) , 1988 .

[6]  Roger W. Hockney,et al.  F1/2: a Parameter to Characterize Memory and Communication Bottlenecks , 1989, Parallel Comput..

[7]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.

[8]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[9]  Thomas H. Dunigan,et al.  Performance of the Intel iPSC/860 and Ncube 6400 hypercubes , 1991, Parallel Comput..

[10]  Roger W. Hockney,et al.  Performance parameters and benchmarking of supercomputers , 1991, Parallel Comput..

[11]  David E. Keyes,et al.  Domain Decomposition: A Bridge between Nature and Parallel Computers , 1992 .

[12]  K. K. Ramakrishnan,et al.  Performance Issues in Designing Network Interfaces: A Case Study , 1992, HPN.

[13]  Kurt Maly,et al.  Parallel Communications: An Experimental Study , 1993 .

[14]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[15]  Louis H. Turcotte,et al.  A Survey of Software Environments for Exploiting Networked Computing Resources , 1993 .

[16]  S. T. Leutenegger,et al.  Distributed computing feasibility in a non-dedicated homogeneous distributed system , 1993, Supercomputing '93.

[17]  Ewing L. Lusk,et al.  Monitors, Messages, and Clusters: The p4 Parallel Programming System , 1994, Parallel Comput..

[18]  Robert Cypher,et al.  The semantics of blocking and nonblocking send and receive primitives , 1994, Proceedings of 8th International Parallel Processing Symposium.

[19]  David E. Keyes,et al.  A SIMPLE HYPERBOLIC MODEL FOR COMMUNICATION IN PARALLEL PROCESSING ENVIRONMENT , 1994 .

[20]  Chris J. Scheiman,et al.  LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation , 1995, SPAA '95.

[21]  David E. Keyes,et al.  Modeling Communication in Cluster Computing , 1995, PPSC.

[22]  David E. Keyes,et al.  Evaluating the Hyperbolic Model on a Variety of Architectures , 1996, Euro-Par, Vol. II.

[23]  Chris J. Scheiman,et al.  LogGP: Incorporating Long Messages into the LogP Model for Parallel Computation , 1997, J. Parallel Distributed Comput..

[24]  David Clark,et al.  An analysis of TCP processing overhead , 1989 .