Abstract
One of the great benefit of computational grids is to provide access to a wide range of scientific software and computers with different architectures. It is then possible to use a variety of tools for solving the same problem and even to combine these tools in order to obtain the best solution technique.
Grid service trading (searching for the best combination of software and execution platform according to the user requirements) is thus a crucial issue. Trading relies both on the description of available services and computers, on the current state of the grid, and on the user requirements. Given the large amount of services available on the Grid, this description cannot be reduced to a simple service name.
We present in this paper a more sophisticated service description similar to algebraic data type. We then illustrate how it can be used to determine the combinations of services that answer a user request. As a side effect, users do not make direct explicit calls to grid-services but talk to a more applicative-domain specific service trader.
We illustrate this approach and its possible limitations within the framework of dense linear algebra. More precisely we focus on Level 3 BLAS ([DDDH90a, DDDH90b]) and LAPACK [ABB+99] type of basic operations.
This work has been partially supported by the French Ministery of Research throught the GRID-TLSE Project from ACI < < Globalisation des Ressources Informatiques et des Données > > and by the ANR (Agence Nationale de la Recherche) through the LEGO Project referenced ANR-05-CIGC-11.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, D., et al.: Users’ Guide to NetSolve V1.4. Computer Science Dept. Technical Report CS-01-467, University of Tennessee, Knoxville, TN (July 2001)
Anderson, E., et al.: LAPACK Users’ guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Arbenz, P., Gander, W., Mori, J.: The Remote Computational System. Parallel Computing 23(10), 1421–1428 (1997)
Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 445–532. Elsevier, Amsterdam (2001), citeseer.ist.psu.edu/baader99unification.html
Castagna, G., Ghelli, G., Longo, G.: A calculus for overloaded functions with subtyping. In: Proceedings of the ACM Conference on Lisp and Functional Programming, vol. 5, pp. 182–192. ACM, New York (1992), citeseer.ist.psu.edu/castagna95calculus.html
Dongarra, J.J., et al.: Algorithm 679. A set of Level 3 Basic Linear Algebra S ubprograms. ACM Transactions on Mathematical Software 16, 1–17 (1990)
Dongarra, J.J., et al.: Algorithm 679. A set of level 3 basic linear algebra subprograms: model implementation and test programs. ACM Transactions on Mathematical Software 16, 18–28 (1990)
Guttag, J.V., Horning, J.J.: The algebraic specification of abstract data types. Acta Inf. 10, 27–52 (1978)
Gallier, J.H., Snyder, W.: Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67(2-3), 203–260 (1989)
Hurault, A., Pantel, M.: Mathematical service trading based on equational matching. In: Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2005), 21 March 2006. Electronic Notes in Theoretical Computer Science, vol. 151, pp. 161–177 (2006)
NEOS - Server for Optimization. http://www-neos.mcs.anl.gov/neos/
Pantel, M.: Test of Large Systems of Equations on the Grid: Meta-Data for Matrices, Computers, and Solvers. In: PMAA’04 (2004)
Marc Pantel, Chiara Puglisi, and Patrick Amestoy. Grid, Components and Scientific computing. In: Submission to Euro-Par 2005 (2005)
Stickel, M.E., et al.: Deductive composition of astronomical software from subroutine libraries. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 341–355. Springer, Heidelberg (1994)
Tanaka, Y., et al.: Ninf-G: A Reference Implementation of RPC-based Programming Middleware for Grid Computing. Journal of Grid Computing 1(1), 41–51 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Daydé, M., Hurault, A., Pantel, M. (2007). Semantic-Based Service Trading: Application to Linear Algebra. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)