Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures
Journal of Parallel and Distributed Computing
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Characterization of E-Commerce Traffic
Electronic Commerce Research
IEEE Internet Computing
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
Response-Time Analysis of Composite Web Services
IEEE Internet Computing
Stochastic bounds for end-to-end delay
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
| Hi-index | 0.00 |
In this paper, we propose bounding models, which provide upper and lower bounds on response time in composite Web service model, for alleviating the state explosion problem. The considered models have heterogeneous servers and the number of elementary Web services can be very large. More precisely, we study two types of composite Web services. First, we investigate the performance of a single composite Web service execution instance. Second, this assumption is relaxed (i.e. multiple composite Web services execution instances are considered). These models allows to find trade-off between the accuracy of the bounds and the computation complexity.