System and method of using transaction IDS for managing reservations of compute resources within a compute environment
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-009/46
G06F-015/173
G06F-009/50
출원번호
US-0686045
(2012-11-27)
등록번호
US-8984524
(2015-03-17)
발명자
/ 주소
Jackson, David Brian
출원인 / 주소
Adaptive Computing Enterprises, Inc.
인용정보
피인용 횟수 :
0인용 특허 :
93
초록▼
A system and method for reserving resources within a compute environment such as a cluster or grid are disclosed. The method aspect of the disclosure includes receiving a request for resource availability in a compute environment from a requestor, associating a transaction identification with the re
A system and method for reserving resources within a compute environment such as a cluster or grid are disclosed. The method aspect of the disclosure includes receiving a request for resource availability in a compute environment from a requestor, associating a transaction identification with the request and resources within the compute environment that can meet the request and presenting the transaction identification to the requestor. The transaction ID can also be associated with a time frame in which resources are available and can also be associated with modifications to the resources and supersets of resources that could be drawn upon to meet the request. The transaction ID can also be associated with metrics that identify how well the resource fit with the request and modifications that can make the resources better match the workload which would be submitted under the request.
대표청구항▼
1. A method comprising: receiving a request for compute resource availability in a multi-node compute environment managed by a common workload manager, wherein the common workload manager reserves resources for consumption at a second time that is later than the first time;associating, via a process
1. A method comprising: receiving a request for compute resource availability in a multi-node compute environment managed by a common workload manager, wherein the common workload manager reserves resources for consumption at a second time that is later than the first time;associating, via a processor, no more than one transaction identification with the request and with available resources comprising at least one node in the multi-node compute environment for consumption;presenting the transaction identification, wherein associating the transaction identification and presenting the transaction identification occur prior to reserving available resources associated with the request;receiving instructions to modify at least one resource of the available resources;changing an operating system on a node of the available resources based on the instructions; andreserving the available resources to yield reserved compute resources and automatically loading software on the reserved resources within the multi-node compute environment. 2. The method of claim 1, further comprising presenting information associated with the available resources further comprises presenting information associated with probabilities of availability associated with the available resources. 3. The method of claim 2, further comprising, after presenting the information and presenting associated transaction identification: receiving instructions from the requestor to commit the request for the available resources. 4. The method of claim 3, wherein receiving instructions to commit the request for available resources is accomplished with reference to the transaction identification. 5. The method of claim 2, wherein the presented information further comprises at least one time period in which the available resources can meet the request. 6. The method of claim 5, wherein the transaction identification is associated with both the available resources and the at least one time period in which the available resources can meet the request. 7. The method of claim 6, wherein receiving instructions to commit the request for the available resources further comprises receiving instructions to reserve the available resources for the at least one time period at which the available resources can meet the request. 8. The method of claim 2, wherein presenting information associated with the available resources that can meet the request further comprises presenting information associated with modified resources that, if so modified, can meet the request in a given time frame. 9. The method of claim 8, wherein the transaction identification reflects a potential configuration of the available resources. 10. The method of claim 1, further comprising presenting an option to modify the available resources. 11. The method of claim 1, wherein receiving instructions to modify at least one resource further comprises receiving instructions to modify at least one of the following parameters associated with a reservation of the available resources associated with the transaction identification: disk space, processor speed, number of nodes reserved, memory allocation, bandwidth and licenses. 12. The method of claim 1, wherein receiving instructions to modify at least one resource further comprises receiving instructions to perform a provisioning of resources. 13. The method of claim 1, wherein the transaction identification is associated with a metric which relates to how closely the available resources match the request. 14. The method of claim 13, wherein the metric relates to at least one of: response time, overhead required to modify resources, and ownership of resources. 15. A system comprising: a processor; anda computer readable medium storing instructions, which, when executed by the processor, cause the processor to perform operations comprising: receiving a request for resource availability in a multi-node compute environment managed by a common workload manager, wherein the common workload manager reserves resources at a first time for consumption at a second time that is later than the first time;associating, via a processor, no more than one transaction identification with the request-and with available resources comprising at least one node in the multi-node compute environment for consumption;analyzing the available resources in the multi-node compute environment and identifying a time frame when the available resources are available to meet the request, wherein: comparing potential modifications of the available resources in the multi-node compute environment to a modification threshold; andif no modifications of the available resources are necessary according to the comparison with the modification threshold, then associating the transaction identification with the available resources at the time frame; andif modifications to the available resources are necessary according to the comparison with the modification threshold, then associating the transaction identification with the available resources as modified and the time frame;presenting the transaction identification, wherein associating the transaction identification and presenting the transaction identification occur prior to reserving available resources associated with the request; andreserving the available resources to yield reserved resources and automatically loading software on the reserved resources within the multi-node compute environment. 16. A non-transitory computer-readable storage device storing instructions which, when executed by a computing device, cause the computing device to perform operations comprising: receiving a request for resource availability in a multi-node compute environment managed by a common workload manager, wherein the common workload manager reserves resources at a first time for consumption at a second time that is later than the first time;associating, via a processor, no more than one transaction identification with the request and with available resources comprising at least one node in the multi-node compute environment for consumption;analyzing the available resources in the multi-node compute environment and identifying a time frame when the available resources are available to meet the request, wherein: comparing potential modifications of the available resources in the multi-node compute environment to a modification threshold; andif no modifications of the available resources are necessary according to the comparison with the modification threshold, then associating the transaction identification with the available resources at the time frame; andif modifications to the available resources are necessary according to the comparison with the modification threshold, then associating the transaction identification with the available resources as modified and the time frame;presenting the transaction identification, wherein associating the transaction identification and presenting the transaction identification occur prior to reserving available resources associated with the request; andreserving the available resources to yield reserved resources and automatically loading software on the reserved resources within the multi-node compute environment.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (93)
Matsumura,Yasuhiro, Abnormality supervising apparatus, abnormality search support method, and abnormality search support program.
Aman Jeffrey D. (Wappingers Falls NY) Eilert Catherine K. (Wappingers Falls NY) King Gary M. (Millbrook NY) Pierce Bernard R. (Poughkeepsie NY) Yocom Peter B. (Wappingers Falls NY), Apparatus and method for managing a data processing system workload according to two or more distinct processing goals.
Darling,Christopher L.; Gernaey,Michael E.; Kaldestad,Hallvard S.; Aikins,Howard A., Dynamic monitor and controller of availability of a load-balancing cluster.
Galis Alexandru (London GBX) Richardson Malcolm (Herts GBX) Page Stuart (Herts GBX) Devani Shailen (Middlesex GBX), Expert and data base system and method for communications network.
Liana Liyow Fong ; Ajei Sarat Gopal ; Nayeem Islam ; Andreas Leonidas Prodromidis ; Mark Steven Squillante, Flexible dynamic partitioning of resources in a cluster computing environment.
Johansson Staffan E.,SEX ; Jonsson Nils T. E.,SEX ; Rynback Patrik J. E.,SEX ; Johansson Peter,SEX ; Andersson Christoffer,SEX, Method and apparatus for allocating processing resources.
Lovy,David M.; Fagan,Brant M.; Bojanek,Robert J., Method and apparatus for maintaining the status of objects in computer networks using virtual state machines.
Jacobs Lawrence ; Adunuthula Seshu ; Anand Mala, Method and apparatus for performing transactions in a stateless web environment which supports a declarative paradigm.
Kahle James A. ; Mallick Soummya ; McDonald Robert G. ; Swarthout Edward L., Method and system for executing a program within a multiscalar processor by processing linked thread descriptors.
Trossman,Andrew; Iszlai,Gabriel; Mihaescu,Mircea; Scarth,Michael; Vytas,Paul; Li,Michael; Hill,Duncan, Method and system for managing resources in a data center.
Jones Michael B. ; Leach Paul J. ; Draves ; Jr. Richard P. ; Barrera ; III Joseph S. ; Levi Steven P. ; Rashid Richard F. ; Fitzgerald Robert P., Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider.
Jones, Michael B.; Leach, Paul J.; Draves, Jr., Richard P.; Barrera, III, Joseph S.; Levi, Steven P.; Rashid, Richard F.; Fitzgerald, Robert P., Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider.
Kalmanek ; Jr. Charles Robert ; Marshall William Todd ; Mishra Partho Pratim ; Nortz Douglas M ; Ramakrishnan Kadangode K., Method for exchanging signaling messages in two phases.
Pan, Yin; Villarica, Al; Edwards, Eric, Method for reserving network resources using a hierarchical/segment tree for starting and ending times of request.
Vogl,Norbert George; Purdy,Geoffrey Hale; Flavin,Robert Alan; Feng,Yuan; Clarke, Jr.,Edward Payson, Method of doing business over a network by transmission and retransmission of digital information on a network during time slots.
Arimilli, Ravi Kumar; Williams, Derek Edward, Method, apparatus and system for allocating and accessing memory-mapped facilities within a data processing system.
Eilert, Catherine K.; Kubala, Jeffrey P.; Nick, Jeffrey M.; Yocom, Peter B., Method, system and program products for managing central processing unit resources of a computing environment.
Takihiro Masatoshi,JPX ; Ishizaki Takeshi,JPX ; Ohno Shuji,JPX ; Ohta Masataka,JPX ; Ikeda Naoya,JPX, Network and switching node in which resource can be reserved.
Waldron ; III Theodore C. ; Giangarra Paul P. ; Huynh Khoa D. ; Tyler John G. ; Winters Scott L., System and method for optimizing dispatch latency of tasks in a data processing system.
Attanasio Clement Richard ; Goldszmidt German Sergio ; Hunt Guerney Douglas Holloway ; Smith Stephen Edwin, System and method for providing dynamically alterable computer clusters for message routing.
Clement Richard Attanasio ; German Sergio Goldszmidt ; Guerney-Douglass Holloway Hunt ; Stephen Edwin Smith, System and method for providing dynamically alterable computer clusters for message routing.
McKeehan Michael Dennis ; Kan Teresa Chung ; Lawrence Kenneth James, System and method for supporting transactions for a thin client lacking a persistent store in a distributed object-orien.
Aman Jeffrey David ; Cotner Curt Lee ; Dillenberger Donna Ngar Ting ; Emmes David Bruce, System for assignment of work requests by identifying servers in a multisystem complex having a minimum predefined capa.
Deng, Yuefan; Engel, Stephen J.; Giustozzi, Joseph; O'Brien, Thomas O., System for balance distribution of requests across multiple servers using dynamic metrics.
Kawato, Masahiro, System for confirming and cancelling tentative resource reservation within the valid time indicates period during which the tentative reservation request is valid.
Nishanov, Gor; Peterson, Glenn R.; Gamache, Rod; Massa, Michael T.; Shrivastava, Sunita, System for determining at subgroup of nodes relative weight to represent cluster by obtaining exclusive possession of quorum resource.
Bozak, Erol; Gebhart, Alexander, System for matching resource request that freeing the reserved first resource and forwarding the request to second resource if predetermined time period expired.
Ferguson Donald F. (Bayside NY) Georgiadis Leonidas (Chappaqua NY) Nikolaou Christos N. (New York NY), Workload manager for achieving transaction class response time goals in a multiprocessing system.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.