Evaluating architectures for multithreaded object request brokers
Communications of the ACM
Effects of Multithreading on Cache Performance
IEEE Transactions on Computers - Special issue on cache memory and related problems
Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects
Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects
Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI
IEEE Internet Computing
Transparent Distributed Threads for Java
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Service -Oriented Computing: Concepts, Characteristics and Directions
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Tool Support for Safety Analysis of Service Composition and Deployment Models
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
Thread allocation protocols for distributed real-time and embedded systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
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.