On concurrency improvements in enterprise SOA middleware

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On concurrency improvements in enterprise SOA middleware

Full text

Pdf (1.02 MB)

Source

Middleware Conference archive
Proceedings of the ACM/IFIP/USENIX Middleware '08 Conference Companion table of contents

Leuven, Belgium

SESSION: Work in progress table of contents

Pages 42-47

Year of Publication: 2008

ISBN:978-1-60558-369-3

Authors

Manish Sethi	IBM India Research Lab, New Delhi, India
Ashok Anand	University of Wisconsin-Madison, Madison

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 88, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1462735.1462745 What is a DOI?

ABSTRACT

SOA is becoming prevalent in enterprise IT environments. As a result, component middleware are adding support for composite web services. Till recent past, most of these middleware were employed in tiered architectures. However, nature of call graphs differs in SOA. In this paper we revisit concurrency and deadlock issues that appear due to hosting SOA applications on middleware with prevalent thread allocation schemes. We propose a novel thread allocation scheme which performs an off-line analysis of web services call graphs and equips containers with essential information. At run-time, containers use this information and do not consult any central point or each other for thread allocation decisions. This makes our approach practical and scalable. We demonstrate, through simulations, that our approach can provide significant throughput improvements when compared with traditional thread allocation schemes.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Application server tuning parameters. http://publib.boulder.ibm.com/infocenter/iseries/v5r4/index.jsp?topic=/rzamy/50/admin/help/uejb_rthrd.html.
	2	Weblogic server performance and tuning. http://edocs.bea.com/wls/docs92/perform/appb_queues.html.
	3	Francisco Curbera , Matthew Duftler , Rania Khalaf , William Nagy , Nirmal Mukhi , Sanjiva Weerawarana, Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI, IEEE Internet Computing, v.6 n.2, p.86-93, March 2002 [doi>10.1109/4236.991449]
	4	E. W. Dijkstra. Cooperating sequential processes. Technical Report EWD-123, Technological University, Eindhoven, The Netherlands, September 1965.
	5	H. Foster. Tool support for safety analysis of service composition and deployment models. In Proceedings of the International Conference on Services Computing, July 2008.
	6	Bernhard Haumacher , Thomas Moschny , Jürgen Reuter , Walter F. Tichy, Transparent Distributed Threads for Java, Proceedings of the 17th International Symposium on Parallel and Distributed Processing, p.136.1, April 22-26, 2003
	7	Hantak Kwak , Ben Lee , Ali R. Hurson , Suk-Han Yoon , Woo-Jong Hahn, Effects of Multithreading on Cache Performance, IEEE Transactions on Computers, v.48 n.2, p.176-184, February 1999 [doi>10.1109/12.752659]
	8	A. N., S. C., and P. G. An evaluation of contemporary commercial soap implementations. In Australasian Workshop on Software and System Architectures, 2004.
	9	Mike P. Papazoglou, Service -Oriented Computing: Concepts, Characteristics and Directions, Proceedings of the Fourth International Conference on Web Information Systems Engineering, p.3, December 10-12, 2003
	10	C. Sanchez, H. B. Sipma, Z. Manna, V. Subramonian, and C. Gill. On efficient distributed deadlock avoidance for real-time and embedded systems. In Proceedings of the IPDPS, April 2006.
	11	C. Sanchez, H. B. Sipma, V. Subramonian, C. Gill, and Z. Manna. Thread allocation protocols for distributed real-time and embedded systems. In Proceedings of the Formal Techniques for Networked and Distributed Systems, pages 159--173, October 2005.
	12	Douglas C. Schmidt, Evaluating architectures for multithreaded object request brokers, Communications of the ACM, v.41 n.10, p.54-60, Oct. 1998 [doi>10.1145/286238.286248]
	13	Douglas C. Schmidt , Hans Rohnert , Michael Stal , Dieter Schultz, Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects, John Wiley & Sons, Inc., New York, NY, 2000
	14	M. Sfinghal, Deadlock Detection in Distributed Systems, Computer, v.22 n.11, p.37-48, November 1989 [doi>10.1109/2.43525]
	15	V. Subramonian, C. D. Gill, C. Sanchez, and H. B. Sipma. Composable timed automata models for real-time embedded systems middleware. Technical Report WUCSE-2005-29, Washington University in St. Louis, April 2005.
	16	Xiang Fu , Tevfik Bultan , Jianwen Su, Analysis of interacting BPEL web services, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA [doi>10.1145/988672.988756]