Decentralizing execution of composite web services

19th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA'04

Volumn , Issue , 2004, Pages 170-187

  Nanda, Mangala Gowri ^a   Chandra, Satish ^a   Sarkar, Vivek ^b  

^a IBM RESEARCH INDIA   (India)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Business Process; Program Dependence Graph; Workflow

Indexed keywords

COMPUTER NETWORKS; COMPUTER PROGRAMMING LANGUAGES; DECENTRALIZED CONTROL; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER CONTROL SYSTEMS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; RESOURCE ALLOCATION; SERVERS; TELECOMMUNICATION TRAFFIC;

BUSINESS PROCESS; BUSINESS PROCESS EXECUTION LANGUAGE (BPEL); DISTRIBUTED PROGRAMMING LANGUAGE; PROGRAM DEPENDENCE GRAPH; WORKFLOW;

WORLD WIDE WEB;

EID: 12844281065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1028976.1028991     Document Type: Conference Paper

References (24)

1. WebSphere Application Server. http://www-3.ibm.com/software/info1/ websphere/index.jsp?tab=products/appserv.
2. W. Baxter and I. H. R. Bauer. The program dependence graph and vectorization. In Proceedings of the ACM Symposium on Principles of Programming Languages, 1989.
3. S. H. Bokhari. Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE Transactions on Computers, c-37:48-57, January 1988.
4. Business Process Execution Language for Web Services Version 1.1. http://www.ibm.com/developerworks/library/ws-bpel/.
5. BPWS4J: Java Run Time for BPEL4WS. http://www.alphaworks.ibm.com/tech/ bpws4j.
6. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9:319-349, July 1987.
7. A. Gerasoulis, S. Venugopal, and T. Yang. Clustering Task Graphs for Message Passing Architectures. Proceedings of the ACM 1990 International Conference on Supercomputing, pages 447-456, June 1990. Amsterdam, the Netherlands.
8. R. L. Graham. Bounds on Multiprocessing Timing Anomalies. SIAM Journal on Applied Mathematics, 17(2):416-429, March 1969.
9. S. Graham, S. Simeonov, T. Boubez, G. Daniels, D. Davis, Y. Nakamura, and R. Neyama. Building Web Services with Java: Making sense of XML, SOAP, WSDL and UDDI. Sams; ISBN:0672321815, 2001.
10. S. Horwitz, J. Prins, and T. Reps. Integrating Non-Interfering Versions of Programs. Conf. Rec. Fifteenth ACM Symposium on Principles of Programming Languages, pages 133-145, January 1988.
11. R. Khalaf, N. Mukhi, and S. Weerawarana. Service-Oriented Composition in BPEL4WS. In Proceedings of the Twelfth International World Wide Web Conference, 2003.
12. J. Krinke. Static slicing of threaded programs. In Program analysis for software tools and engineering (PASTE 98), pages 35-42. ACMSOFT, 1998.
13. P. Muth, D. Wodtke, J. Weissenfels, D. A. Kotz, and G. Weikum. From centralized workflow specification to distributed workflow execution. Journal of Intelligent Information Systems (JIIS), 10(2), 1998.
14. R. Reiter. Scheduling Parallel Computations. Journal of the ACM, 4(15):590-599, 1968.
15. V. Sarkar. Partitioning and Scheduling Parallel Programs on Multiprocessors. Research Monographs in Parallel and Distributed Computing. MIT Press, Cambridge, MA, 1989.
16. V. Sarkar. Automatic Partitioning of a Program Dependence Graph into Parallel Tasks. IBM Journal of Research and Development, 35(5/6), 1991.
17. V. Sarkar. A Concurrent Execution Semantics for Parallel Program Graphs and Program Dependence Graphs. Springer-Verlag Lecture Notes in Computer Science, 757:16-30, 1992. Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, Yale University, August 1992.
18. A. Singh and S. Pande. Compiler optimizations for Java aglets in distributed data intensive applications. In Proceedings of the ACM Symposium on Applied Computing, pages 87-92, 2002.
19. S. Singhai and K. McKinley. Loop fusion for data locality and parallelism. In Proceedings of the Mid-Atlantic Student Workshop on Programming Languages and Systems, 1996.
20. J. Subhlok, D. O'Hallaron, T. Gross, P. Dinda, and J. Webb. Communication and memory requirements as the basis for mapping task and data parallel programs. In Proceedings of Supercomputing, pages 330-339, Washington, DC, November 1994.
21. J. Subhlok and G. Vondran. Optimal latency-throughput tradeoffs for data parallel pipelines. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), Padua, Italy, June 1996.
22. E. Tilevich and Y. Smaragdakis. J-Orchestra: Automatic Java application partitioning. In Proceedings of European Conference on Object Oriented Programming (ECOOP'02), 2002.
23. T. Yang and A. Gerasoulis. DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951-967, 1994.
24. D. Zhou, S. Pande, and K. Schwan. Method partitioning - runtime customization of pervasive programs without design-time application knowledge. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS'03), 2003.