Cart (Loading....) | Create Account
Close category search window
 

Randomization in Searching for Composites of Software Components

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qianhui Liang ; Singapore Manage. Univ., Singapore ; Rubin, S.H.

Randomization enables reuse, minimizes the chance of error, and minimizes user time. Randomization is applicable in problem solving techniques such as searching and optimization. With the emergence of service oriented architectures (SOAs), building software by composing existing components has been facilitated to make use of components across the Internet. Such facilitation has scaled up the corresponding problem search space from tens of components in the local component repository to hundreds or thousands of components available anywhere connected by a network. In order to search for the right composites in a large search space, randomization can be used to heuristically reduce the search time. This paper demonstrates, for the software engineering community, how randomization can be applied using granularization of context-free grammatical reduction for the automatic synthesis of component-based software using service-oriented architectures. The approach taken is to iteratively extract largest common component granules and form productions using these granules. The grammar is then written using the common granule components. We review the savings incurred by such randomization in searching for a solution. A theoretical analysis and a use case scenario are provided. Granules allow us to search the space using more formal parameters for a temporal savings of orders of magnitude associated with the symmetric granules. Granted that we can miss viable solutions in this way, the speedup however is too great to be ignored. Furthermore, given that there is a high degree of reuse between solutions, symmetric granule solutions work best.

Published in:

Information Reuse and Integration, 2007. IRI 2007. IEEE International Conference on

Date of Conference:

13-15 Aug. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.