Model-driven mapping onto distributed memory parallel computers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
High-level optimization via automated statistical modeling
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Algorithmic bombardment for the iterative solution of linear systems: a poly-iterative approach
Journal of Computational and Applied Mathematics - Special issue on TICAM symposium
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
ICS '97 Proceedings of the 11th international conference on Supercomputing
Efficient management of parallelism in object-oriented numerical software libraries
Modern software tools for scientific computing
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast Fourier transform compiler
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Replicator equations, maximal cliques, and graph isomorphism
Neural Computation
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
NetSolve: a network server for solving computational science problems
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
SIAM Journal on Optimization
Developing Component Architectures for Distributed Scientific Problem Solving
IEEE Computational Science & Engineering
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Toward a Common Component Architecture for High-Performance Scientific Computing
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Optimizing the performance of sparse matrix-vector multiplication
Optimizing the performance of sparse matrix-vector multiplication
A Unifying Framework for Relational Structure Matching
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
A Portable Programming Interface for Performance Evaluation on Modern Processors
International Journal of High Performance Computing Applications
The GrADS Project: Software Support for High-Level Grid Application Development
International Journal of High Performance Computing Applications
A versatile computer-controlled assembly system
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Statistical Models for Empirical Search-Based Performance Tuning
International Journal of High Performance Computing Applications
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
A Standard and Software for Numerical Metadata
ACM Transactions on Mathematical Software (TOMS)
Parallel SSOR preconditioning implemented on dynamic SMP clusters with communication on the fly
Future Generation Computer Systems
Management of services based on a semantic description within the GRID-TLSE project
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Self-adaptive hints for collective i/o
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
| Hi-index | 0.00 |
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill efficiently their computational demands. This know-how extends to algorith choice, computational grid utilization, and use of properly optimized kernels. A SANS system is a piece of meta software that mediates between the application program and the computational platform so that application scientists - with disparate levels of knowledge of algorithmic and programmatic complexities of the underlying numerical software - can easily realize numerical solvers and efficiently solve their problem. The main component of a sans system is an Intelligent Agent that automates method selection based on data, algorithm and system attributes. The IA uses heuristics to make its decisions. In this paper we explain how the heuristics of the IA can be tuned over time by redundant testing and using the nature of many applications.