TY - GEN
T1 - Decomposition techniques for optimal design-space exploration of streaming applications
AU - Padmanabhan, Shobana
AU - Chen, Yixin
AU - Chamberlain, Roger D.
PY - 2013
Y1 - 2013
N2 - Streaming data programs are an important class of applications, for which queueing network models are frequently available. While the design space can be large, decomposition techniques can be effective at design space reduction. We introduce two decomposition techniques called convex decomposition and unchaining and present implications for a biosequence search application.
AB - Streaming data programs are an important class of applications, for which queueing network models are frequently available. While the design space can be large, decomposition techniques can be effective at design space reduction. We introduce two decomposition techniques called convex decomposition and unchaining and present implications for a biosequence search application.
KW - domain-specific branch and bound
KW - optimization
UR - https://www.scopus.com/pages/publications/84875175264
U2 - 10.1145/2442516.2442547
DO - 10.1145/2442516.2442547
M3 - Conference contribution
AN - SCOPUS:84875175264
SN - 9781450319225
T3 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
SP - 285
EP - 286
BT - PPoPP 2013 - Proceedings of the 2013 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
T2 - 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2013
Y2 - 23 February 2013 through 27 February 2013
ER -