Cluster Computing and the Grid, IEEE International Symposium on (2006)
May 16, 2006 to May 19, 2006
Peter M. Kelly , University of Adelaide, Australia
Paul D. Coddington , Univesity of Adelaide, Australia
Andrew L. Wendelborn , University of Adelaide, Australia
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and data intensive programs that delegate part of their computation to services, and making it easier to develop such applications. The ability to invoke multiple service calls at one time on different machines enables different portions of the program to be executed concurrently. We are addressing this through an implementation of an existing functional language, XSLT. Our implementation uses a dataflow execution model, and includes a compiler to build dataflow graphs from XSLT source code. This paper describes the execution model used to obtain parallelism and compose web services, as well as the compilation process used to create the dataflow graphs. Our aim with this paper is to present the design of our system and demonstrate that XSLT provides a suitable model for distributed execution and parallel composition of web services.
P. M. Kelly, A. L. Wendelborn and P. D. Coddington, "Compilation of XSLT into Dataflow Graphs for Web Service Composition," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Singapore, 2006, pp. 141-149.