This invention relates generally to providing atomic services in the field of information technology (IT) and, more specifically, to a method and system for identifying service boundaries, partitioning services into atomic services based on the services boundaries, and utilizing those atomic services.
In service oriented architecture (SOA), services are primarily abstractions for building business systems. In practical terms, the design, definition and implementation of the services becomes the most important aspect of designing, building and implementing SOA systems. This leads immediately to the issue of granularity.
Granularity is the degree to which systems contain separate components, or granules. Higher granularity implies more flexibility in customizing a system, as there are more, smaller components from which to choose. Therefore, the more components in a system, or the greater the granularity, the more flexible, modular and adaptable the system is.
Given the myriad of activities being performed in a business environment, it can be difficult to define what qualifies as a service. Yet, how services are designed, defined and implemented plays a critical role in the overall efficiency of SOA systems. Furthermore, in service delivery, this is all the more significant since identifying the correct boundaries for service elements impacts the entire service delivery business.
Currently, there are no methodologies available to systemically determine service boundaries. The present invention describes a methodology for describing atomic services and then utilizing them for service delivery.
In an exemplary embodiment the present invention provides a method for identifying and partitioning a service into at least one atomic service in an environment to fulfill information technology services, the method including: determining whether the entire work to perform an information technology service can be automated; encapsulating all tasks into an atomic service responsive to a determination that the entire work to perform said information technology service can be automated; and storing the encapsulated tasks in an atomic services catalog.
In another exemplary embodiment the present invention provides a method for identifying and partitioning atomic services in an environment to fulfill information technology services, the method including: determining whether an entire work to perform an information technology service can be automated; determining whether all tasks to perform said work can be performed by one team having accountability and ownership of said tasks or said team having one or more logical subteams based on skills; partitioning the work to match the different skills required to perform different tasks in the work; dividing the tasks into specializations based on team, subteam or skill; encapsulating all tasks into atomic services; and storing said atomic services in an atomic services catalog.
In yet another exemplary embodiment the present invention provides an apparatus for identifying and partitioning a service into at least one atomic service in an environment to fulfill information technology services, the apparatus including: means for determining whether the entire work to perform an information technology service can be automated; means for determining whether all tasks can be performed by a person, team or subteam; means for determining whether the work can be partitioned into tasks to match the different skills required to perform different sections in the work; means for partitioning the tasks into atomic services; and means for storing said atomic services in an atomic services catalog. In a further exemplary embodiment, the apparatus further includes means for associating an interface definition for at least one service provider capable of providing one of said atomic services in said atomic services catalog.
In still another exemplary embodiment the present invention provides a method for identifying and partitioning a service into at least one atomic service in an environment to fulfill information technology services, the method including dividing a project into individual tasks, confirming the tasks can not be divided any further, converting each of the resulting tasks into a respective atomic service, and placing each atomic service into an atomic service catalog.
In still another exemplary embodiment the present invention provides a method for identifying and partitioning a service into at least one atomic service in an environment to fulfill information technology services, the method comprising: dividing a project into individual tasks based on a first consideration; designating the individual tasks as atomic services; and placing said atomic services into a catalog. The method in at least one exemplary embodiment further includes identifying service providers able to perform said atomic services. In at least one exemplary embodiment, the method includes adding identified service providers to said catalog, and linking each of said identified service providers to at least one atomic service.
Given the following enabling description of the drawings, the apparatus should become evident to a person of ordinary skill in the art.
The present invention is described with reference to the accompanying drawings, wherein:
The present invention will be described in an information technology (IT) services environment and its advantages are best understood by referring to
Atomic services are instrumental in allowing companies to utilize their global pool of services. The atomic services business model shifts work from the standard team approach towards delivering services to distribute work based on a variety of considerations designed to increase efficiency. These considerations include but are not limited to competencies, such as skill and experience, location, availability, security, costs and contractual considerations.
An example of a company utilizing atomic services to increase efficiencies is as follows: Company X receives an order for a “computer setup”. Instead of deploying a geographically/centrally located team to fulfill the order, Company X partitions the standardized tasks in the project (computer setup) to service providers to match service provider skills with the tasks required to fulfill the order. So for the requested computer setup, Company X might partition the varying tasks as follows:
Operating system setup performed by a service provider in Texas
Network connection configuration done by a service provider in New York
Software A installation performed by a service provider in Brazil
Software B installation performed by a service provider in India
This allows Company X to utilize its global services pool to fill the order, instead of relying on all members of a geographically located team to have the required skills needed or to all be available at the same time, for instance.
The function of partitioning or breaking down services into atomic services may be performed by a variety of sources and may include, for example, services coordinators, subject matter experts, account managers, an automated process, etc. However, in order to partition services into atomic services, those services must first be identified. Therefore, it becomes necessary to identify the correct boundaries for service elements so that they may be logically and efficiently partitioned. The present invention provides a reliable and efficient means of identifying and utilizing atomic services for service delivery.
For the purposes of the detailed description of the present invention, the following definitions are intended: “work” is related to the delivery of IT services, including IT systems management, server management, software installation, etc.; “entity” refers to a variety of end users of IT services, including customers, suppliers, distributors, companies, teams, individuals, etc.; “true” is intended to be synonymous with “yes”; and “false” is intended to be synonymous with “no”.
Another high-level method according to the invention for identifying and partitioning a service into at least one atomic service begins with dividing a project into individual tasks. To see if the tasks need to be divided any further, it is confirmed that the individual tasks can not be separated further. The resulting tasks are converted into respective atomics services, which are placed into an atomic services catalog.
In order to break an information technology project into atomic services, it is necessary to first identify the service boundaries so that the services can be partitioned, divided and packaged into atomic services.
However, where the entire work required to perform the IT service cannot be automated, it must be determined whether all tasks to perform the work can be performed by one person, or a team having accountability and ownership of the tasks, or a team having one or more logical subteams based on skills, as shown at 154. Based on the determination of who can perform the work, the work is partitioned to match the different skills required to perform different tasks in the work, as shown at 156. The tasks may then be further divided into specializations within the team, subteam or skill set, as shown at 158. The tasks are then encapsulated into atomic services, as shown at 160, and delivered into an atomic services catalog, as shown at 162. These generalized steps will be discussed later in greater detail with respect to
The method of identifying and partitioning atomic services is described with respect to flowchart 300 of
If step 304 is false, the method proceeds to step 310 and determines whether all tasks can be performed by one person. If step 310 is true, the method proceeds to step 312 and determines whether all the work can be partitioned to match the different skills required to perform different sections in the work. If step 312 is false, the method proceeds to step 306 and encapsulates all tasks into an atomic service. The method would then end at step 308 and the atomic service would be ready for inclusion in the atomic services catalog 402.
If step 312, which asks, “Can the work be partitioned to match the different skills required to perform different sections in the work?” is true, the method proceeds to step 340 and the work is partitioned into smaller pieces or chunks based on criteria, such as team, subteam, skill, etc. The division of a service in step 340 allows for a level of subjective analysis of a particular service in at least one embodiment, and as such can increase the granularity that is possible with this invention. Step 340 in at least one embodiment provides an efficient way to expedite the analysis and partitioning of services into atomic services, for example, the computer installation example above. Once the work is partitioned into smaller pieces at step 340, the method returns to step 304 and determines whether the entire work to perform an IT service can be automated. The determination at step 304 is performed for each piece that is partitioned at step 340.
If step 310, which asks, “Can all tasks be performed by one person?” is false, the method proceeds to step 314 and determines whether all tasks are performed by a single team. If step 314 is true, the method proceeds to step 316 and determines whether the team has logical subteams based on skills. If step 316 is false, the method proceeds to step 318 and determines whether the work can be partitioned to match different skills required to perform different sections in the work. If step 318 is true, the method proceeds to step 340 and partitions the work into smaller pieces based on team, subteam, skill, etc. The method then determines, at step 304, whether the entire work to perform an IT service can be automated for each piece output by step 340. If step 318 is false, all the tasks are encapsulated into an atomic service at step 320 and output at step 322 for inclusion into the atomic services catalog 402.
If step 316, which asks, “Does the team have logical subteams based on skills?” is true the method proceeds to step 326 and determines whether the tasks are performed by different subteams. If step 326 is true, the method proceeds to step 340 and the work is partitioned into smaller pieces. The method would then proceed to step 304 and perform the functions as outlined above. If step 326 is false, the method would proceed to step 330 and determine whether the work can be partitioned to match the different skills required to perform different sections in the work. If step 330 is true, the method proceeds to step 340. If step 330 is false, all tasks are encapsulated into an atomic service at step 334 and output at step 336 for inclusion into the atomic services catalog 402.
If step 314, which asks, “Are all tasks performed by a single team?” is false the method proceeds to step 324 and determines whether one team is accountable and has clear ownership of the tasks. If step 324 is false, the method proceeds to step 340. If step 324 is true, all tasks are encapsulated into an atomic service at step 328 and output at step 332 for inclusion into the atomic services catalog 402.
The steps of method 300 continue until all services are partitioned into the smallest possible pieces based on the team, subteam, skill, etc. Once all services have been partitioned into the smallest possible pieces based on the set criteria, the method ends and all results are stored in (or delivered to) the atomic services catalog 402.
One of ordinary skill in the art will appreciate based on this disclosure that the steps illustrated in
The various methods described above may be combined with a method that identifies service providers capable of performing the atomic services. Once a service provider is identified, adding (or storing) them in the atomic service catalog, for example, in the service provider capability database. The database in at least one exemplary embodiment is related (or linked) to the atomic services database to allow the service providers to be used. The service provider capability database in at least one exemplary embodiment includes an interface definition for how to communicate with the particular service provider.
As discussed above, the atomic services catalog 402 may be a database. The service provider capabilities 404 and atomic service definitions 406 may be stored in the database and mapped and cross-referenced in order to match the service provider capabilities 404 with the atomic service definitions 406. The matching or bundling of service provider capabilities 404 and atomic service definitions 406 may be based on a variety of considerations, for example, overall efficiency, skill, location, availability, etc.
Once entered into the atomic services catalog 402, atomic services may be matched or bundled in several ways, including in a predefined manner, manually, or based on policy. Predefined bundling of atomic services may be automated to be performed by the integration services bus 410 based on set rules that determine which services are to be performed by which service provider 414, 416. Manual bundling of services may be performed by a person, such as a service coordinator, account administrator, account manager, etc., who determines what services are needed to fulfill a service request. Policy bundling is performed based on a set of policy related criteria, such as security considerations, special customer requirements or requests, etc.
A system makes use of the atomic services catalog 402 to communicate with its service providers 414, 416. The system allocates an atomic service 406 to a service provider based on the enterprises' business process and service provider's capability 404. The system generates a message to “fulfill” an atomic service using service provider independent Web Services Definitions Language (WSDL) 408. The system puts the message on an integration services bus 410. The integration services bus transforms the message into the Web Services Definitions Language (WSDL) 412 of the appropriate target system 414, 416.
Service providers may optionally receive notifications to which they may respond with availability. This helps to ensure that services are reliably provided in a timely fashion. Once tasks are performed the service provider would notify the account manager.
The atomic services catalog 402 may also be updated to refine the atomic services through actual use of the atomic services system 400. The actual use of the atomic services catalog 402 may utilize mathematical techniques, such as algorithms, to track and update the granularity and performance of the atomic services. These algorithms may incorporate metrics, such as key performance indicators (KPIs) that are designed to reflect strategic value drivers that are defined by executives. These metrics can be designed to continually or periodically update based on a feedback loop. Metrics may be designed to measure a variety of parameters and allows each service to be analyzed to increase efficiencies. Service order metrics, for example, may be designed to measure turnaround time to process orders, minimum and maximum time to fulfill orders, quality of services provided, time to market for a particular service, etc. These metrics may also be sortable. These metrics in at least one embodiment help to further define competencies and the competencies help define boundaries by sending requested services to appropriate specialists.
An exemplary embodiment of a feedback loop that may be practiced with the present invention is outlined in
The invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In at least one exemplary embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.
Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device). Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk—read only memory (CD-ROM), compact disk—read/write (CD-R/W) and DVD.
A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.
Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
As will be appreciated by one of ordinary skill in the art, the present invention may be embodied as a computer implemented method, a programmed computer, a data processing system, and/or computer program. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program on a computer-usable storage medium having computer-usable program code embodied in the medium. Any suitable computer readable medium may be utilized including hard disks, CD-ROMs, optical storage devices, or other storage devices.
Computer program code for carrying out operations of the present invention may be written in a variety of computer programming languages. The program code may be executed entirely on at least one computing device, as a stand-alone software package, or it may be executed partly on one computing device and partly on a remote computer.
It will be understood that each block of the flowchart illustrations and block diagrams and combinations of those blocks can be implemented by computer program instructions and/or means. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowcharts or block diagrams.
The exemplary embodiments described above may be combined in a variety of ways with each other. Furthermore, the steps and number of the various steps illustrated in the figures may be adjusted from that shown.
It should be noted that the present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, the embodiments set forth herein are provided so that the disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. The accompanying drawings illustrate exemplary embodiments of the invention.
Although the present invention has been described in terms of particular exemplary embodiments, it is not limited to those embodiments. Alternative embodiments, examples, and modifications which would still be encompassed by the invention may be made by those skilled in the art, particularly in light of the foregoing teachings.
Those skilled in the art will appreciate that various adaptations and modifications of the exemplary embodiments described above can be configured without departing from the scope and spirit of the invention. Therefore, it is to be understood that, within the scope of the appended claims, the invention may be practiced other than as specifically described herein.
VI. Industrial Applicability
The above-described invention is useful for identifying, partitioning, and delivering atomic services in an information technology (IT) environment. Identifying and partitioning services based on natural service boundaries allows atomic services to be standardized and reused as needed. The standardization and storage of services diminishes the effects of the loss of knowledge due to employee attrition. The invention is particularly useful in providing a method and system for the automated bundling and delivery of services based on competencies which allows for increased efficiency.
Number | Name | Date | Kind |
---|---|---|---|
4835372 | Gombrich et al. | May 1989 | A |
5049873 | Robins et al. | Sep 1991 | A |
5504921 | Dev et al. | Apr 1996 | A |
5634009 | Iddon et al. | May 1997 | A |
5724262 | Ghahramani | Mar 1998 | A |
5734837 | Flores et al. | Mar 1998 | A |
5765138 | Aycock et al. | Jun 1998 | A |
5774661 | Chatterjee et al. | Jun 1998 | A |
5826239 | Du et al. | Oct 1998 | A |
5850535 | Maystrovsky et al. | Dec 1998 | A |
5870545 | Davis et al. | Feb 1999 | A |
5884302 | Ho | Mar 1999 | A |
5907488 | Arimoto et al. | May 1999 | A |
5937388 | Davis et al. | Aug 1999 | A |
6049776 | Donnelly et al. | Apr 2000 | A |
6131085 | Rossides | Oct 2000 | A |
6249769 | Ruffin et al. | Jun 2001 | B1 |
6259448 | McNally et al. | Jul 2001 | B1 |
6263335 | Paik et al. | Jul 2001 | B1 |
6308208 | Jung et al. | Oct 2001 | B1 |
6339838 | Weinman, Jr. | Jan 2002 | B1 |
6363384 | Cookmeyer, II et al. | Mar 2002 | B1 |
6438594 | Bowman-Amuah | Aug 2002 | B1 |
6453269 | Quernemoen | Sep 2002 | B1 |
6473794 | Guheen et al. | Oct 2002 | B1 |
6496209 | Horii | Dec 2002 | B2 |
6523027 | Underwood | Feb 2003 | B1 |
6526387 | Ruffin et al. | Feb 2003 | B1 |
6526392 | Dietrich et al. | Feb 2003 | B1 |
6526404 | Slater et al. | Feb 2003 | B1 |
6618730 | Poulter et al. | Sep 2003 | B1 |
6675149 | Ruffin et al. | Jan 2004 | B1 |
6738736 | Bond | May 2004 | B1 |
6763380 | Mayton et al. | Jul 2004 | B1 |
6789101 | Clarke et al. | Sep 2004 | B2 |
6810383 | Loveland | Oct 2004 | B1 |
6865370 | Ho et al. | Mar 2005 | B2 |
6879685 | Peterson et al. | Apr 2005 | B1 |
6907549 | Davis et al. | Jun 2005 | B2 |
6970803 | Aerdts et al. | Nov 2005 | B1 |
6988088 | Miikkulainen et al. | Jan 2006 | B1 |
6988132 | Horvitz | Jan 2006 | B2 |
7010593 | Raymond | Mar 2006 | B2 |
7039606 | Hoffman et al. | May 2006 | B2 |
7089529 | Sweitzer et al. | Aug 2006 | B2 |
7114146 | Zhang et al. | Sep 2006 | B2 |
7177774 | Brown et al. | Feb 2007 | B1 |
7236966 | Jackson et al. | Jun 2007 | B1 |
7260535 | Galanes et al. | Aug 2007 | B2 |
7293238 | Brook et al. | Nov 2007 | B1 |
7315826 | Guheen et al. | Jan 2008 | B1 |
7364067 | Steusloff et al. | Apr 2008 | B2 |
7403948 | Ghoneimy et al. | Jul 2008 | B2 |
7412502 | Fearn et al. | Aug 2008 | B2 |
7467198 | Goodman et al. | Dec 2008 | B2 |
7472037 | Brown et al. | Dec 2008 | B2 |
7490145 | Sylor et al. | Feb 2009 | B2 |
7562143 | Fellenstein et al. | Jul 2009 | B2 |
7580906 | Faihe | Aug 2009 | B2 |
7599308 | Laver et al. | Oct 2009 | B2 |
7707015 | Lubrecht et al. | Apr 2010 | B2 |
7802144 | Vinberg et al. | Sep 2010 | B2 |
7818418 | Bansal et al. | Oct 2010 | B2 |
20010047270 | Gusick et al. | Nov 2001 | A1 |
20020019837 | Balnaves | Feb 2002 | A1 |
20020055849 | Georgakopoulos et al. | May 2002 | A1 |
20020091736 | Wall | Jul 2002 | A1 |
20020099578 | Eicher et al. | Jul 2002 | A1 |
20020111823 | Heptner | Aug 2002 | A1 |
20020140725 | Horii | Oct 2002 | A1 |
20020147809 | Vinberg | Oct 2002 | A1 |
20020161875 | Raymond | Oct 2002 | A1 |
20020169649 | Lineberry et al. | Nov 2002 | A1 |
20020186238 | Sylor et al. | Dec 2002 | A1 |
20030004746 | Kheirolomoom et al. | Jan 2003 | A1 |
20030018629 | Namba | Jan 2003 | A1 |
20030018771 | Vinberg | Jan 2003 | A1 |
20030033402 | Battat et al. | Feb 2003 | A1 |
20030065764 | Capers et al. | Apr 2003 | A1 |
20030065805 | Barnes | Apr 2003 | A1 |
20030097286 | Skeen | May 2003 | A1 |
20030101086 | San Miguel | May 2003 | A1 |
20030154406 | Honarvar et al. | Aug 2003 | A1 |
20030172145 | Nguyen | Sep 2003 | A1 |
20030187719 | Brocklebank | Oct 2003 | A1 |
20030225747 | Brown et al. | Dec 2003 | A1 |
20040024627 | Keener | Feb 2004 | A1 |
20040158568 | Colle et al. | Aug 2004 | A1 |
20040172466 | Douglas et al. | Sep 2004 | A1 |
20040181435 | Snell et al. | Sep 2004 | A9 |
20040186757 | Starkey | Sep 2004 | A1 |
20040186758 | Halac et al. | Sep 2004 | A1 |
20040199417 | Baxter et al. | Oct 2004 | A1 |
20050027585 | Wodtke et al. | Feb 2005 | A1 |
20050027845 | Secor et al. | Feb 2005 | A1 |
20050066026 | Chen et al. | Mar 2005 | A1 |
20050091269 | Gerber et al. | Apr 2005 | A1 |
20050114306 | Shu et al. | May 2005 | A1 |
20050114829 | Robin et al. | May 2005 | A1 |
20050136946 | Trossen | Jun 2005 | A1 |
20050138631 | Bellotti et al. | Jun 2005 | A1 |
20050159969 | Sheppard | Jul 2005 | A1 |
20050187929 | Staggs | Aug 2005 | A1 |
20050192947 | Mischke | Sep 2005 | A1 |
20050203917 | Freeberg et al. | Sep 2005 | A1 |
20050223299 | Childress et al. | Oct 2005 | A1 |
20050223392 | Cox et al. | Oct 2005 | A1 |
20050254775 | Hamilton et al. | Nov 2005 | A1 |
20060067252 | John et al. | Mar 2006 | A1 |
20060069607 | Linder | Mar 2006 | A1 |
20060112036 | Zhang et al. | May 2006 | A1 |
20060112050 | Miikkulainen et al. | May 2006 | A1 |
20060129906 | Wall | Jun 2006 | A1 |
20060168168 | Xia et al. | Jul 2006 | A1 |
20060178913 | Lara et al. | Aug 2006 | A1 |
20060184410 | Ramamurthy et al. | Aug 2006 | A1 |
20060190482 | Kishan et al. | Aug 2006 | A1 |
20060224569 | DeSanto et al. | Oct 2006 | A1 |
20060224580 | Quiroga et al. | Oct 2006 | A1 |
20060235690 | Tomasic et al. | Oct 2006 | A1 |
20060282302 | Hussain | Dec 2006 | A1 |
20060287890 | Stead et al. | Dec 2006 | A1 |
20070043524 | Brown et al. | Feb 2007 | A1 |
20070055558 | Shanahan et al. | Mar 2007 | A1 |
20070073576 | Connors et al. | Mar 2007 | A1 |
20070073651 | Imielinski | Mar 2007 | A1 |
20070083419 | Baxter et al. | Apr 2007 | A1 |
20070118514 | Mariappan | May 2007 | A1 |
20070168225 | Haider et al. | Jul 2007 | A1 |
20070219958 | Park et al. | Sep 2007 | A1 |
20070234282 | Prigge et al. | Oct 2007 | A1 |
20070282470 | Hernandez et al. | Dec 2007 | A1 |
20070282622 | Hernandez et al. | Dec 2007 | A1 |
20070282644 | Diao et al. | Dec 2007 | A1 |
20070282645 | Brown et al. | Dec 2007 | A1 |
20070282653 | Bishop et al. | Dec 2007 | A1 |
20070282659 | Bailey et al. | Dec 2007 | A1 |
20070282692 | Bishop et al. | Dec 2007 | A1 |
20070282776 | Jaluka et al. | Dec 2007 | A1 |
20070282876 | Diao et al. | Dec 2007 | A1 |
20070282942 | Bailey et al. | Dec 2007 | A1 |
20070288274 | Chao et al. | Dec 2007 | A1 |
20070292833 | Brodie et al. | Dec 2007 | A1 |
20080065448 | Hull et al. | Mar 2008 | A1 |
20080109260 | Roof | May 2008 | A1 |
20080213740 | Brodie et al. | Sep 2008 | A1 |
20080215404 | Diao et al. | Sep 2008 | A1 |
20090012887 | Taub et al. | Jan 2009 | A1 |
20110251866 | Sengupta | Oct 2011 | A1 |
Number | Date | Country |
---|---|---|
2007143516 | Dec 2007 | WO |
Entry |
---|
M.D. Harrison, P.D. Johnson and P.C. Wright. “Relating the automation of functions in multi-agent control systems to a system engineering representation.” Department of Computer Science, University of York, Heslington, York. UK. Aug. 13, 2004. |
Relating the Automation of Functions in Multiagent Control Systems to a System Engineering Representation Harrison, Michael ; Johnson, Philip ; Wright, Peter Handbook of Cognitive Task Design. Jun 2003 , 503-524. |
“A Capacity Planning Model of Unreliable Multimedia Service Systems”, by Kiejin Park and Sungsoo Kim, Department of Software, Anyang University, Kangwha, Incheon, South Korea, Jul. 2001. |
“Tracking Your Changing Skills Inventory: Why Its Now Possible, and What It Means for Your Organization”, from CIO.com, Mid 2002 IT Staffing Update, Brainbench. |
“Project MEGAGRID: Capacity Planning for Large Commodity Clusters”, An Oracle, Dell, EMC, Intel Joint White Paper, Dec. 2004. |
BEA Systems, Inc., “BEA White Paper—BEA AquaLogic Service Bus—IT's Direct Route to SOA,” printout from http://www.bea.com/content/news—events/white—papers/BEA—AQL—ServiceBus—wp.pdf, Jun. 2005. |
Cape Clear Software, Inc., “Cape Clear 6.5”, printout from http://www.capeclear.com/download/CC65—Broch.pdf, copyright notice 2005. |
Cordys, “Cordys Enterprise Service Bus—Capabilities,” printout from http://www.cordys.com/en/Products/Cordys—ESB—capabilities.htm, printed on Jun. 26, 2006. |
Oracle, “Enterprise Service Bus,” printout from http://www.oracle.com/appserver/esb.html, printed on Jun. 27, 2006. |
PolarLake Limited, “Enterprise Service Bus (ESB) Resoure Center,” printout from http://www.polarlake.com/en/html/resources/esb/, printed on Jun. 27, 2006, copyright notice dated 2006. |
Sonic Software, “ESB Architecture & Lifecycle Definition,” printout from http://www.sonicsoftware.com/products/sonic—esb/architecture—definition/index.ssp, printed on Jun. 26, 2006. |
Internet.com (http://www.webopedia.com/TERM/m/metadata.html). |
Team Quest, Capacity Planning with TeamQuest Analytic Modeling Software, printed from http://www.team/quest.com/solutions-products/solutions/planning-provis . . . on Jun. 4, 2006. |
Mercury, Mercury Capacity Planning (Powered by Hyperformix), 2004. |
Ganesarajah, Dinesh and Lupu Emil, 2002, Workflow-based composition of web-services: a business model or programming paradigm?, IEEE Computer Society. |
“Self-Adaptive SLA-Driven Capacity Management for Internet Services”, by Bruno Abrahao et al., Computer Science Department, Federal University of Minas, Gerais, Brazil, 2005. |
zur Muehlen, Michael. “Resource Modeling in Workflow Applications”, 1999. |
Number | Date | Country | |
---|---|---|---|
20070282655 A1 | Dec 2007 | US |