Method and a system for composing an optimally-grained set of service functions

• US 7,882,500 B2
• Filed: 01/02/2007
• Issued: 02/01/2011
• Est. Priority Date: 01/02/2007
• Status: Active Grant

• Current Assignee: Rakuten Group, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Velayudham, Senthilnathan, Morar, John F., Yashchin, Emmanuel, Krasikov, Sophia
• Primary Examiner(s): Pham; Thomas K
• Application Number:
  US11/619,000
• Publication Number:
  US 20080163213A1
• Time in Patent Office: 1,491 Days
• Field of Search: 717/154
• US Class Current: 717/154
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine

Abstract

Disclosed is a computer program product for managing granularity of a computing infrastructure, wherein the program, when executed on a computer, causes the computer to: identify at least one set of service functions suited to characterization by one or more sets of metrics; create a representation of at least one supplied functionality for the set of service functions for input to a formal process; characterize at least one rule and at least one constraint for input to the formal process; determine at least one set of metrics for evaluating the service functions; quantify benefits associated with at least one of the sets of service functions using the set of metrics; and provide one or more of the sets of service functions as output, wherein the output is based on the metrics determining the output by use of the formal process. Systems and infrastructure are also disclosed.

Claims

1. A computer program product comprising a tangible computer usable medium having a computer readable program for managing granularity of a computing service infrastructure, wherein the computer readable program when executed on a computer causes the computer to:

identify a group having a number of service requestors;

identify a set of business functions that may be requested by the group of service requestors by either customized or non-customized service requests;

create a value (n1) that represents the smallest number of customized service functions to realize all of the business functions;

create a value (n2) that represents the smallest total number of non-customized service functions to realize all of the business functions; and

iteratively determine an optimal number L of customized and non-customized service functions to realize the business functions, where L is between n1 and n2 and increases from n2 towards n1 as a number of each requestor is assigned a customized service request for each business function.

2. The computer program product as in claim 1, wherein the at least one set of service functions comprises at least one of logic, data and combinations of logic and data.

3. The computer program product as in claim 1, wherein one of the constraints specifies at least one of complexity and cost for one of the service functions.

4. The computer program product as in claim 1, wherein the computer program product further causes the computer to:

characterize at least one rule and at least one constraint for determining an optimal number L wherein one of the constraints comprises a tolerance coefficient for output data of at least one of the service functions.

5. The computer program product as in claim 1, wherein the set of service functions comprise service functions having diverse granularity.

6. The computer program product as in claim 1, wherein the set of service functions comprise at least one of a business function and an output data object.

7. The computer program product as in claim 1, wherein the at least one set of metrics is responsive to a service requestor.