TY - GEN
T1 - InDiGO
T2 - 7th International Symposium on Parallel and Distributed Computing, ISPDC 2008
AU - Kolesnikov, Valeriy
AU - Singh, Gurdip
PY - 2008
Y1 - 2008
N2 - The developers of distributed algorithms are faced with two opposing forces. One is to design generic algorithms that are reusable in a large number of applications. Efficiency considerations, on the other hand, force the algorithms to be customized to specific operational contexts. This problem is often attacked by simply re-implementing all or large portions of an algorithm. This paper proposes InDiGO, an infrastructure which allows design of generic but customizable algorithms and provides tools to customize such algorithms for specific applications. InDiGO provides the following capabilities: (a) Tools to generate intermediate representations of an application which can be leveraged for analysis, (b) Mechanisms to allow developers to design customizable algorithms by exposing design knowledge in terms of configurable options, and (c) An optimization engine to analyze an application to derive the information necessary optimize the algorithms. We perform three types of optimizations: static, dynamic and physical topology-based optimization. We present experimental results to demonstrate the advantages of our infrastructure.
AB - The developers of distributed algorithms are faced with two opposing forces. One is to design generic algorithms that are reusable in a large number of applications. Efficiency considerations, on the other hand, force the algorithms to be customized to specific operational contexts. This problem is often attacked by simply re-implementing all or large portions of an algorithm. This paper proposes InDiGO, an infrastructure which allows design of generic but customizable algorithms and provides tools to customize such algorithms for specific applications. InDiGO provides the following capabilities: (a) Tools to generate intermediate representations of an application which can be leveraged for analysis, (b) Mechanisms to allow developers to design customizable algorithms by exposing design knowledge in terms of configurable options, and (c) An optimization engine to analyze an application to derive the information necessary optimize the algorithms. We perform three types of optimizations: static, dynamic and physical topology-based optimization. We present experimental results to demonstrate the advantages of our infrastructure.
UR - http://www.scopus.com/inward/record.url?scp=60349100154&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=60349100154&partnerID=8YFLogxK
U2 - 10.1109/ISPDC.2008.43
DO - 10.1109/ISPDC.2008.43
M3 - Conference contribution
AN - SCOPUS:60349100154
SN - 9780769534725
T3 - Proceedings of the 7th International Symposium on Parallel and Distributed Computing, ISPDC 2008
SP - 401
EP - 408
BT - Proceedings of the 7th International Symposium on Parallel and Distributed Computing, ISPDC 2008
Y2 - 1 July 2008 through 5 July 2008
ER -