A comparative analysis of parallel programming language complexity and performance

✍ Scribed by Vanderwiel, Steven P.; Nathanson, Daphna; Lilja, David J.

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 136 KB
• Volume: 10
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(19980825)10:10<807::aid-cpe376>3.0.co;2-2

✦ Synopsis

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 exist that quantitatively evaluate the relative ease of use of different parallel programming languages. The paper borrows techniques from the software engineering field to quantify the complexity of three predominant 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 vs. HPF on an IBM SP2.