Pragmatic granularity decision for right-grained services in service-oriented modelling
- Authors
- Kim, Y.; Doh, K.-G.
- Issue Date
- Aug-2012
- Publisher
- Inderscience Enterprises Ltd
- Keywords
- service identification; SOA; service-oriented architecture; metrics-based decision making; business process modelling; granularity; right-grained services; service-oriented modelling; service orientation; reusability; activity allocation; graph partitioning.
- Citation
- International Journal of Web and Grid Services, v.8, no.2, pp 111 - 133
- Pages
- 23
- Journal Title
- International Journal of Web and Grid Services
- Volume
- 8
- Number
- 2
- Start Page
- 111
- End Page
- 133
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/147590
- DOI
- 10.1504/IJWGS.2012.048376
- ISSN
- 1741-1106
1741-1114
- Abstract
- The identifi cation of right-grained services is important in leading a successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupled services and the reusability of individual services in different contexts. Although the concept of service orientation has been intensely debated in recent years, a unifi ed methodic approach for identifying services has not yet been identifi ed. In this paper, we suggest a formal approach to identify services at the right level of granularity from the business process model abstraction. Our approach adopts the concept of activity allocation based on the locality principle for defi ning loosely-coupled services. The method utilising the concept of graph partitioning can minimise the network roundtrip costs incurred during the service execution. If we can defi ne activities into a service as cohesively as possible, we can identify the reusable and self-contained services so as to reduce the coupling of remote tasks and increase the local task cohesion. © 2012 Inderscience Enterprises Ltd.
- Files in This Item
-
Go to Link
- Appears in
Collections - 공과대학 > 기초공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.