TY - JOUR
T1 - Triolet
T2 - A Programming System that Unifies Algorithmic Skeleton Interfaces for High-Performance Cluster Computing
AU - Rodrigues, Christopher
AU - Jablin, Thomas
AU - Dakkak, Abdul
AU - Hwu, Wen Mei
N1 - Publisher Copyright:
© 2014 ACM.
PY - 2014/2/6
Y1 - 2014/2/6
N2 - Functional algorithmic skeletons promise a high-level programming interface for distributed-memory clusters that free developers from concerns of task decomposition, scheduling, and communication. Unfortunately, prior distributed functional skeleton frameworks do not deliver performance comparable to that achievable in a low-level distributed programming model such as C with MPI and OpenMP, even when used in concert with high-performance array libraries. There are several causes: they do not take advantage of shared memory on each cluster node; they impose a fixed partitioning strategy on input data; and they have limited ability to fuse loops involving skeletons that produce a variable number of outputs per input. We address these shortcomings in the Triolet programming language through a modular library design that separates concerns of parallelism, loop nesting, and data partitioning. We show how Triolet substantially improves the parallel performance of algorithms involving array traversals and nested, variable-size loops over what is achievable in Eden, a distributed variant of Haskell. We further demonstrate how Triolet can substantially simplify parallel programming relative to C with MPI and OpenMP while achieving 23 - 100% of its performance on a 128-core cluster.
AB - Functional algorithmic skeletons promise a high-level programming interface for distributed-memory clusters that free developers from concerns of task decomposition, scheduling, and communication. Unfortunately, prior distributed functional skeleton frameworks do not deliver performance comparable to that achievable in a low-level distributed programming model such as C with MPI and OpenMP, even when used in concert with high-performance array libraries. There are several causes: they do not take advantage of shared memory on each cluster node; they impose a fixed partitioning strategy on input data; and they have limited ability to fuse loops involving skeletons that produce a variable number of outputs per input. We address these shortcomings in the Triolet programming language through a modular library design that separates concerns of parallelism, loop nesting, and data partitioning. We show how Triolet substantially improves the parallel performance of algorithms involving array traversals and nested, variable-size loops over what is achievable in Eden, a distributed variant of Haskell. We further demonstrate how Triolet can substantially simplify parallel programming relative to C with MPI and OpenMP while achieving 23 - 100% of its performance on a 128-core cluster.
KW - algorithmic skeletons
KW - loop fusion
KW - parallel programming
UR - http://www.scopus.com/inward/record.url?scp=85187232759&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85187232759&partnerID=8YFLogxK
U2 - 10.1145/2692916.2555268
DO - 10.1145/2692916.2555268
M3 - Article
AN - SCOPUS:85187232759
SN - 1523-2867
VL - 49
SP - 247
EP - 258
JO - ACM SIGPLAN Notices
JF - ACM SIGPLAN Notices
IS - 8
ER -