Integrating Memory And Network Accesses : A Flexible Processor-network Interface For Efficient Application Execution

It has been shown that the large communication overhead in current multicomputer systems can be reduced greatly by using proper communication mechanisms [l] and processornetwork interfaces [4]. A good processor-network interface design is highly dependent on application characteristics, programming model, memory interface, and routing characteristics of the network. Unfortunately, these issues are not exploited fully in the previous work. In this paper, we address these issues from the perspective of application performance and propose a processor-network interface architecture that to optimize the system performance. Through such a design, not only the processor and network are tightly coupled, also are memory operation and message passing. As a result, high-level operations such as gather and scatter can be supported easily instead of using low level operations proposed previously.

[1]  Seth Copen Goldstein,et al.  Active Messages: A Mechanism for Integrated Communication and Computation , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[2]  Michael D. Noakes,et al.  The J-machine multicomputer: an architectural evaluation , 1993, ISCA '93.

[3]  Ken Kennedy,et al.  Fortran D Language Specification , 1990 .

[4]  Dana S. Henry,et al.  A tightly-coupled processor-network interface , 1992, ASPLOS V.

[5]  Seth Copen Goldstein,et al.  Active messages: a mechanism for integrating communication and computation , 1998, ISCA '98.

[6]  John L. Gustafson,et al.  Programming and performance on a cube-connected architecture , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[7]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[8]  Jenq Kuen Lee,et al.  Object oriented parallel programming: experiments and results , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).