๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Service selection algorithms for Web services with end-to-end QoS constraints

โœ Scribed by Tao Yu; Kwei-Jay Lin


Publisher
Springer
Year
2005
Tongue
English
Weight
466 KB
Volume
3
Category
Article
ISSN
1617-9846

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Synthy: A system for end to end composit
โœ Vikas Agarwal; Girish Chafle; Koustuv Dasgupta; Neeran Karnik; Arun Kumar; Sumit ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 892 KB

The demand for quickly delivering new applications is increasingly becoming a business imperative today. However, application development is often done in an ad hoc manner resulting in poor reuse of software assets and longer time-to-delivery. Web services have received much interest due to their po

An efficient scheduling algorithm for di
โœ Atsushi Togawa; Eiji Okubo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method