Apparatus, method and system for aggregating computing resources
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-013/00
G06F-015/173
출원번호
US-0093645
(2011-04-25)
등록번호
US-8656077
(2014-02-18)
발명자
/ 주소
Miloushev, Vladimir
Nickolov, Peter
Hester, Becky L.
Marinov, Borislav S.
출원인 / 주소
CA, Inc.
대리인 / 주소
Baker Botts, LLP
인용정보
피인용 횟수 :
5인용 특허 :
31
초록▼
A system for executing applications designed to run on a single SMP computer on an easily scalable network of computers, while providing each application with computing resources, including processing power, memory and others that exceed the resources available on any single computer. A server agent
A system for executing applications designed to run on a single SMP computer on an easily scalable network of computers, while providing each application with computing resources, including processing power, memory and others that exceed the resources available on any single computer. A server agent program, a grid switch apparatus and a grid controller apparatus are included. Methods for creating processes and resources, and for accessing resources transparently across multiple servers are also provided.
대표청구항▼
1. A method for automatically assigning a plurality of resources in a distributed computing system to the same resource set, the method comprising: collecting a particular set of statistics about accesses to resources on a plurality of servers;determining an affinity context value for each resource
1. A method for automatically assigning a plurality of resources in a distributed computing system to the same resource set, the method comprising: collecting a particular set of statistics about accesses to resources on a plurality of servers;determining an affinity context value for each resource of a plurality of resources for an application, the affinity context value corresponding to an amount of correlation between the allocation of each resource of the plurality of resources among the plurality of servers in a given context and the allocation of other resources of the plurality of resources among the plurality of servers in the given context;identifying a closely coupled plurality of resources among the plurality of resources for the application based on the affinity context values for the plurality of resources for the application, each resource of the closely coupled plurality of resources having a matching affinity context value; andassigning, by a grid switch, the closely coupled plurality of resources to a particular resource set on a particular server of the plurality of servers based on the particular set of statistics about accesses to resources on the plurality of servers. 2. The method of claim 1, wherein assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises moving a resource of the closely coupled plurality of resources from a server on which the resource was created to the particular server. 3. The method of claim 1, wherein assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises suspending a thread currently accessing a resource of the closely coupled plurality of resources before moving the resource to the particular server. 4. The method of claim 1, wherein determining the affinity context value for each resource of the plurality of resources for the application comprises determining that a parent object and a child object, which is allocated by the parent object, among the plurality of resources for the application have matching affinity context values. 5. The method of claim 1, wherein the application provides the affinity context value for each of the plurality of resources for the application. 6. The method of claim 1, wherein assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises selecting a next-in-order server from an ordered set of available servers as the particular server. 7. A system for automatically assigning a plurality of resources in a distributed computing environment to the same resource set, the system comprising: a grid switch configured to: collect a particular set of statistics about accesses to resources on a plurality of servers,determine an affinity context value for each resource of a plurality of resources for an application, the affinity context value corresponding to an amount of correlation between the allocation of each resource of the plurality of resources among the plurality of servers in a given context and the allocation of other resources of the plurality of resources among the plurality of servers in the given context,identify a closely coupled plurality of resources among the plurality of resources for the application based on the affinity context values for the plurality of resources for the application, each resource of the closely coupled plurality of resources having a matching affinity context value, andassign the closely coupled plurality of resources to a particular resource set on a particular server of the plurality of servers based on the particular set of statistics about accesses to resources on the plurality of servers. 8. The system of claim 7, wherein the grid switch is configured to move a resource of the closely coupled plurality of resources from a server on which the resource was created to the particular server. 9. The system of claim 7, wherein the grid switch is configured to suspend a thread currently accessing a resource of the closely coupled plurality of resources before moving the resource to the particular server. 10. The method of claim 7, wherein the grid switch is configured to determine that a parent object and a child object, which is allocated by the parent object, among the plurality of resources for the application have matching affinity context values. 11. The method of claim 7, wherein the grid switch is configured to receive the affinity context value for each of the plurality of resources for the application from the application. 12. The method of claim 7, wherein the grid switch is configured to select a next-in-order server from an ordered set of available servers as the particular server. 13. A non-transitory, computer-readable memory storing computer-readable instructions that, when executed by a processor configured to operate as a grid switch, instruct the processor to perform processes comprising: collecting a particular set of statistics about accesses to resources on a plurality of servers;determining an affinity context value for each resource of a plurality of resources for an application, the affinity context value corresponding to an amount of correlation between the allocation of each resource of the plurality of resources among the plurality of servers in a given context and the allocation of other resources of the plurality of resources among the plurality of servers in the given context;identifying a closely coupled plurality of resources among the plurality of resources for the application based on the affinity context values for the plurality of resources for the application, each resource of the closely coupled plurality of resources having a matching affinity context value; andassigning the closely coupled plurality of resources to a particular resource set on a particular server of the plurality of servers based on the particular set of statistics about accesses to resources on the plurality of servers. 14. The non-transitory, computer-readable memory according to claim 13, wherein the instruction for the processor to perform the process of assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises: an instruction for the processor to perform a process comprising moving a resource of the closely coupled plurality of resources from a server on which the resource was created to the particular server. 15. The non-transitory, computer-readable memory according to claim 13, wherein the instruction for the processor to perform the process of assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises: an instruction for the processor to perform a process comprising suspending a thread currently accessing a resource of the closely coupled plurality of resources before moving the resource to the particular server. 16. The non-transitory, computer-readable memory according to claim 13, wherein determining the affinity context value for each resource of the plurality of resources for the application comprises determining that a parent object and a child object, which is allocated by the parent object, among the plurality of resources for the application have matching affinity context values. 17. The non-transitory, computer-readable memory according to claim 13, wherein the application provides the affinity context value for each of the plurality of resources for the application. 18. The non-transitory, computer-readable memory according to claim 13, wherein the instruction for the processor to perform the process of assigning the closely coupled plurality of resources to the particular resource set on the particular server comprises: an instruction for the processor to perform a process comprising selecting a next-in-order server from an ordered set of available servers as the particular server.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (31)
Gilbert, Matthew M.; Boom, Douglas D., Apparatus and method for dynamic resource allocation in a network environment.
Chen Steve S. (Chippewa Falls) Simmons Frederick J. (Neillsville) Spix George A. (Eau Claire) Wilson Jimmie R. (Eau Claire) Miller Edward C. (Eau Claire) Eckert Roger E. (Eau Claire) Beard Douglas R., Cluster architecture for a highly parallel scalar/vector multiprocessor system.
Sudo Yoshiaki (Chigasaki JPX), Load distribution method and system for distributed threaded task operation in network information processing apparatuse.
Spalink, Jan-Dieter; Gullette, Brian R. D.; Hatchell, Andrew; Nortman, Randall C.; Babyak, Kevin; Babyak, Michael, Method and system for classifying information available on a computer network.
Chrysos, George Z.; Dean, Jeffrey A.; Hicks, Jr., James E.; Waldspurger, Carl A.; Weihl, William E., Method for scheduling threads in a multithreaded processor.
Overby ; Jr. Linwood Hugh ; Rajaraman Balachandar, Methods, systems and computer program products for preemptive avoidance of constraints for shared resources.
Kimmel Jeffrey S. ; Alfieri Robert A. ; de Forest Miles A. ; McGrath William K. ; McLeod Michael J. ; O'Connell Mark A. ; Simpson Guy A., Operating system for a non-uniform memory access multiprocessor system.
VanHuben Gary Alan ; Blake Michael A. ; Mak Pak-kin, SMP clusters with remote resource managers for distributing work to other clusters while reducing bus traffic to a minimum.
Ryan Jeffrey M. ; Brobst Curtis H. ; Chou Chih-Hsiang, System for distributing a plurality of threads associated with a process initiating by one data processing station among data processing stations.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.