A pilot study to compare programming effort for two parallel programming models |
| |
Authors: | Lorin Hochstein [Author Vitae] Victor R. Basili |
| |
Affiliation: | a University of Nebraska, Lincoln, Department of Computer Science and Engineering, United States b University of Maryland, Computer Science Department, United States c University of Maryland, Institute for Advanced Computer Studies, United States d University of California, Santa Barbara, Computer Science Department, United States |
| |
Abstract: | ContextWriting 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.ObjectiveMeasure the effect of parallel programming models (message-passing vs. PRAM-like) on programmer effort.Design, setting, and subjectsOne 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 measuresDevelopment time, program correctness.ResultsMean 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).ConclusionsXMTC 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. |
| |
Keywords: | MPI XMT Message-passing PRAM Empirical study Parallel programming Effort |
本文献已被 ScienceDirect 等数据库收录! |
|