Selector: A Language Construct for Developing Dynamic Applications

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 s...

Full description

Saved in:
Bibliographic Details
Published inLanguages and Compilers for Parallel Computing pp. 218 - 232
Main Authors Diniz, Pedro C., Liu, Bing
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Break Function
Code Variant
Computer science; control theory; systems
Cost Function
Exact sciences and technology
Linear Solver
Probe Function
Programming languages
Software
Algorithmics
High performance
Compilation
Programming language
Distributed computing
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:3540307818
9783540307815
ISSN:0302-9743
1611-3349
DOI:10.1007/11596110_15