.png){kind=icon}
.png){kind=icon}
Return
A pilot study to compare programming effort for two parallel programming models
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2007.12.798.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Context: Writing software for the current generation of parallel systems requires significant programmer effort, and the community is seeking alternatives that reduce effort while still achieving good performance. Objective: Measure the effect of parallel programming models (message-passing vs. PRAM-like) oil programmer effort. Design, setting. and subjects: One group of subjects implemented sparse-matrix dense-vector multiplication using message-passing (MPI), and a second group solved the same problem using a PRAM-like model (XMTC). The subjects were students in two graduate-level classes: one class was taught MPI and the other was taught XMTC. Main outcome measures: Development time, program correctness. Results: Mean XMTC development time was 4.8 h less than mean MPI development time (95% confidence interval, 2.0-7.7), a 46% reduction. XMTC programs were more likely to be correct, but the difference in correctness rates was not statistically significant (p = .16). Conclusions: XMTC Solutions for this particular problem required less effort than MPI equivalents, but further Studies are necessary which examine different types of problems and different levels of programmer experience. (C) 2008 Elsevier Inc. All rights reserved.
Keywords:
MPI
XMT
Message-passing
PRAM
Empirical study
Parallel programming
Effort
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K
Organization
View more organizations