A comparative analysis of parallel programming language complexity and performance

被引：0
|
作者：
Vanderwiel, SP
Nathanson, D
Lilja, DJ
机构：
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Iowa State Univ, Dept Elect & Comp Engn, Ames, IA 50010 USA
来源：
CONCURRENCY-PRACTICE AND EXPERIENCE | 1998年 / 10卷 / 10期
关键词：
D O I：
10.1002/(SICI)1096-9128(19980825)10:10<807::AID-CPE376>3.0.CO;2-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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. (C) 1998 John Wiley & Sons, Ltd.
引用
收藏
页码：807 / 820
页数：14
相关论文
共 50 条
  • [1] Complexity and performance in parallel programming languages
    VanderWiel, SP
    Nathanson, D
    Lilja, DJ
    [J]. SECOND INTERNATIONAL WORKSHOP ON HIGH-LEVEL PARALLEL PROGRAMMING MODELS AND SUPPORTIVE ENVIRONMENTS, PROCEEDINGS, 1997, : 3 - 12
  • [2] A language for the complexity analysis of parallel programs
    González, JA
    León, C
    Pristinta, M
    Roda, JL
    Rodríguez, C
    Rodríguez, JM
    Sande, F
    [J]. PARALLEL PROCESSING APPLIED MATHEMATICS, 2002, 2328 : 256 - 263
  • [3] Parallel programming and complexity analysis using Actors
    Agha, G
    Kim, WY
    [J]. THIRD WORKING CONFERENCE ON MASSIVELY PARALLEL PROGRAMMING MODELS, PROCEEDINGS, 1998, : 68 - 79
  • [4] Towards the Complexity Analysis of Programming Language Proof Methods
    Cimini, Matteo
    [J]. THEORETICAL ASPECTS OF COMPUTING, ICTAC 2023, 2023, 14446 : 100 - 118
  • [5] ON THE PARALLEL COMPLEXITY OF INTEGER PROGRAMMING
    DENG, XT
    [J]. SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 110 - 116
  • [6] VISUAL PARALLEL PROGRAMMING AND DETERMINANCY - A LANGUAGE SPECIFICATION, AN ANALYSIS TECHNIQUE, AND A PROGRAMMING TOOL
    BEGUELIN, A
    NUTT, G
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 22 (02) : 235 - 250
  • [7] Parallel programming with a pattern language *
    Massingill B.L.
    Mattson T.G.
    Sanders B.A.
    [J]. International Journal on Software Tools for Technology Transfer, 2001, 3 (2) : 217 - 234
  • [8] On parallel programming language caper
    Vartanov, SR
    [J]. HIGH-PERFORMANCE COMPUTING AND NETWORKING, 2001, 2110 : 565 - 568
  • [9] THE DINO PARALLEL PROGRAMMING LANGUAGE
    ROSING, M
    SCHNABEL, RB
    WEAVER, RP
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (01) : 30 - 42
  • [10] THE BLAZE LANGUAGE - A PARALLEL LANGUAGE FOR SCIENTIFIC PROGRAMMING
    MEHROTRA, P
    VANROSENDALE, J
    [J]. PARALLEL COMPUTING, 1987, 5 (03) : 339 - 361
12345