Comparing communication in two languages employing buffered message-passing
Abstract Parallel programming languages are usually compared informally. Such informal comparisons have led to considerable disagreement and debate about the relationship between various parallel programming languages and features. This article presents a model that permits more precise comparisons for a particular class of parallel programming languages: those in which the communication between the parallel processes is via a first-in, first-out queue of messages. This model was developed to assist with the detailed comparisons between the communication aspect of various parallel programming languages, required as part of the design of a new parallel programming language. The model is illustrated by describing interprocess communication in two buffered message-passing languages: the language of Kahn and MacQueen, and the language Cospol.