|
|
Technical Report HW-MACS-TR-0068
| Title | Low Pain vs No Pain Multi-core Haskells |
|---|
| Authors | M. KH. Aswad, P. W. Trinder, , A. D. AlZain, , G. J. Michaelson 1, , J. Berthold 2 |
|---|
| Date | 2009-06-09 |
|---|
| Abstract | Multicores are becoming the dominant processor technology and
functional languages are theoretically well suited to exploit
them. In practice, however, implementing effective high level
parallel functional languages is extremely challenging.
This paper is the first programming and performance comparison of
functional multicore technologies and reports some of the first ever
multicore results for two languages. As such it reflects the growing
maturity of the field by systematically evaluating four parallel
Haskell implementations on a common multicore architecture. The
comparison contrasts the programming effort each language requires
with the parallel performance delivered. The study uses 15 'typical' programs to compare a 'no pain',
i.e.\ entirely implicit, parallel language with three 'low pain',
i.e.\ semi-explicit languages.
The parallel Haskell implementations use different versions of GHC
compiler technology, and hence the comparative performance metric is
speedup which normalises against sequential performance. We
ground the speedup comparisons by reporting both
sequential and parallel runtimes and efficiencies for three of the
languages. Our experiments focus on the number of programs improved,
the absolute speedups delivered, the parallel scalability, and the
program changes required to coordinate parallelism. The results are
encouraging and, on occasion, surprising.
|
|---|
| Group | DSG Group |
|---|
| Notes | |
|---|
| Download |   |
|---|
|
|
