Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often point out various language features that are designed to provide the programmer with a simple programming interface. However, virtually no data exists that quantitatively evaluates the relative ease of use of different parallel programming languages. The following paper borrows techniques from the software engineering field to quantify the complexity of three predominate programming models: shared memory, message passing and High-Performance Fortran. It is concluded that traditional software complexity metrics are effective indicators of the relative complexity of parallel programming languages. The impact of complexity on run-time performance is also discussed in the context of message-passing versus HPF on an IBM SP2.
|Original language||English (US)|
|Number of pages||10|
|State||Published - Jan 1 1997|
|Event||Proceedings of 1997 2nd International Workshop on High-Level Programming Models and Supportive Environments - Geneva, Switz|
Duration: Apr 1 1997 → Apr 1 1997
|Other||Proceedings of 1997 2nd International Workshop on High-Level Programming Models and Supportive Environments|
|Period||4/1/97 → 4/1/97|