Newsgroups: comp.parallel
From: douglas-craig@CS.YALE.EDU (Craig Douglas)
Subject: Comparison Paper of C-Linda, P4, POSYBL, PVM, and TCGMSG
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
Date: 28 Aug 1993 07:52:54 -0400

Parallel Programming Systems for Workstation Clusters
Craig C. Douglas, Timothy G. Mattson, and Martin H. Schultz
Yale University Department of Computer Science Research Report
    YALEU/DCS/TR-975, August, 1993.

Abstract:

In this paper, we describe experiments comparing the communication
times for a number of different network programming environments on
isolated 2 and 4 node workstation networks.  In addition to simplified
benchmarks, a real application is used in one of these experiments.

From our results, it is clear that the cost of buffer management at
either end of the communication is more important than originally
expected.  Furthermore, as communication patterns become more complex,
the performance differences between these environments decreased
substantially.  When we compared timings for an actual application
program, the differences essentially disappeared.  This shows the
danger of relying solely on simplified benchmarks.


It is available through anonymous ftp on casper.cs.yale.edu in the file
pub/tr975.ps.