Selector: a language construct for developing dynamic applications

Authors:
Pedro C. Diniz;Bing Liu
Affiliations:
Information Sciences Institute, University of Southern California, Marina del Rey, California;Information Sciences Institute, University of Southern California, Marina del Rey, California
Venue:
LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing
Year:
2002

Citing 9
Cited 1

Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)
Type feedback vs. concrete type inference: a comparison of optimization techniques for object-oriented languages

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Fast, effective dynamic compilation

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
VCODE: a retargetable, extensible, very fast dynamic code generation system

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Dynamic feedback: an effective technique for adaptive computing

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Dynamo: a transparent dynamic optimization system

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
High-level adaptive program optimization with ADAPT

PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Language and Compiler Support for Adaptive Distributed Applications

OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems

Language and Compiler Support for Adaptive Applications

Proceedings of the 2004 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fitting algorithms to meet input data characteristics and/or a changing computing environment is a tedious and error prone task. Programmers need to deal with code instrumentation details and implement the selection of which algorithm best suits a given data set. In this paper we describe a set of simple programming constructs for C that allows programmers to specify and generate applications that can select at run-time the best of several possible implementations based on measured run-time performance and/or algorithmic input values. We describe the application of this approach to a realistic linear solver for an engineering crash analysis code. The preliminary experimental results reveal that this approach provides an effective mechanism for creating sophisticated dynamic application behavior with minimal effort.