We describe a general component software framework designed for demanding grid environments that provides optimal performance
for the assembled component application. This is achieved by separating the high level abstract description of the composition
from the low level implementations. These implementations are chosen at run time by performance analysis of the composed application
on the currently available resources. We show through the solution of a simple linear algebra problem that the framework introduces
minimal overheads while always selecting the most effective implementation.
Keywords Component Composition - Grid Computing - Performance Optimisation - High Level Abstraction
Research supported by the EPSRC grant GR/N13371/01 on equipment provided by the HEFCE/JREI grants GR/L26100 and GR/M92455