Hybrid Service-Oriented Computing Architecture

• US 20140282609A1
• Filed: 03/14/2013
• Published: 09/18/2014
• Est. Priority Date: 03/14/2013
• Status: Active Grant

• Current Assignee: Carefusion 303 Incorporated (Becton, Dickinson & Co)
• Original Assignee: Carefusion 303 Incorporated (Becton, Dickinson & Co)
• Inventors: Weiler, Aron, Orona, Martin
• Granted Patent: US 8,984,532 B2
• Time in Patent Office: Days
• US Class Current: 719/313
• CPC Class Codes: G06F 9/44521 Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading

Abstract

Loading of a component to an operating system process that is being executed on a node is initiated. Thereafter, a first available resource location is sequentially determined among a plurality of ranked component resource locations and according to the ranking. Subsequently, the component is loaded to the operating system process via the first available resource location. Related apparatus, systems, techniques and articles are also described.

Claims

1. A computer-implemented method comprising:

initiating, within a service oriented computing architecture, loading of a component to an operating system process being executed on a node of a computing system comprising memory and at least one data processor;

sequentially determine, among a plurality of ranked component resource locations and according to the ranking, a first available resource location; and

loading the component to the operating system process via the first available resource location.

2. A method as in claim 1, wherein a highest ranked resource location is within the operating system process executing on the node.

3. A method as in claim 2, wherein the highest ranked resource location is determined to be the first available resource location by scanning at least one dynamic linked library (DLL) files at the node.

4. A method as in claim 2, wherein a second highest ranked resource location is within a different operating system process executing on the node.

5. A method as in claim 4, wherein the second highest ranked resource location is determined to be the first available resource location by scanning at least one dynamic linked library (DLL) files at the node.

6. A method as in claim 4 further comprising:

marshaling the component from the different operating system process executing on the node.

7. A method as in claim 6, wherein the marshaling comprises an inter-process communication (IPC) method.

8. A method as in claim 4, wherein a third highest ranked resource location is at a second node remote from the node.

9. A method as in claim 8 further comprising:

polling or accessing, by the node, a component management system to identify a location of the component on the second node; and

initiating a service to obtain the component from the second node.

10. A method as in claim 1, wherein loading the component comprises loading the component into the memory at the node.

11. A non-transitory computer program product storing instructions, which when executed by at least one data processor forming part of at least one computing system, result in operation comprising:

initiating, within a service oriented computing architecture, loading of a component to an operating system process being executed on a node of a computing system comprising memory and at least one data processor;

sequentially determine, among a plurality of ranked component resource locations and according to the ranking, a first available resource location; and

loading the component to the operating system process via the first available resource location.

12. A computer program product as in claim 11, wherein a highest ranked resource location is within the operating system process executing on the node.

13. A computer program product as in claim 12, wherein the highest ranked resource location is determined to be the first available resource location by scanning at least one dynamic linked library (DLL) files at the node.

14. A computer program product as in claim 11, wherein a second highest ranked resource location is within a different operating system process executing on the node.

15. A computer program product as in claim 14, wherein the second highest ranked resource location is determined to be the first available resource location by scanning at least one dynamic linked library (DLL) files at the node.

16. A computer program product as in claim 14, wherein the operations further comprise:

marshaling the component from the different operating system process executing on the node.

17. A computer program product as in claim 16, wherein the marshaling comprises an inter-process communication (IPC) method.

18. A computer program product as in claim 14, wherein a third highest ranked resource location is at a second node remote from the node.

19. A computer program product as in claim 18, wherein the operations further comprise:

polling or accessing, by the node, a component management system to identify a location of the component on the second node; and

initiating a service to obtain the component from the second node.

20. A system comprising:

a plurality of nodes communicating amongst each other within a service oriented architecture, each node comprising memory and at least one data processor;

wherein, upon initiation of loading of a component to an operating system process being executed on a first node, it is sequentially determined, among a plurality of ranked component resource locations and according to the ranking, a first available resource location, and wherein the component is loaded to the operating system process via the first available resource location.