System and method of co-allocating a reservation spanning different compute resources types
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-009/46
G06F-009/50
출원번호
US-0760600
(2013-02-06)
등록번호
US-9959140
(2018-05-01)
발명자
/ 주소
Jackson, David Brian
출원인 / 주소
III Holdings 12, LLC
인용정보
피인용 횟수 :
0인용 특허 :
127
초록▼
Co-allocating resources within a compute environment includes. Receiving a request for a reservation for a first type of resource, analyzing constraints and guarantees associated with the first type of resource, identifying a first group of resources that meet the request for the first type of resou
Co-allocating resources within a compute environment includes. Receiving a request for a reservation for a first type of resource, analyzing constraints and guarantees associated with the first type of resource, identifying a first group of resources that meet the request for the first type of resource and storing in a first list, receiving a request for a reservation for a second type of resource, analyzing constraints and guarantees associated with the second type of resource, identifying a second group of resources that meet the request for the second type of resource and storing in a second list, calculating a co-allocation parameter between the first group of resources and the second group of resources and reserving resources according to the calculated co-allocation parameter of the first group of resources and the second group of resources. The request may also request exclusivity of the reservation.
대표청구항▼
1. A method of co-allocating resources within a compute environment, the method comprising: receiving, via a processor, a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes, the first request being part of a co-allocation reque
1. A method of co-allocating resources within a compute environment, the method comprising: receiving, via a processor, a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes, the first request being part of a co-allocation request, wherein the co-allocation request comprises an indication of a period of time, a first node with a first operating system, and a second node with a second operating system;analyzing, via the processor, first constraints and service level agreement guarantees associated with the first request and related to use of the compute environment;identifying a first group of resources that meets the first request for the first reservation;receiving a second request for a second reservation for a second type of resource in the compute environment, wherein the first type of resource comprises a memory device and wherein the second type of resource comprises one of a hard disk, a virtual memory, a network bandwidth capability, a clock speed, and a processor, the second request being part of the co-allocation request;identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each server of the servers in the compute environment having a homogeneous processor architecture; andgenerating a set of resources exclusive to at least one of the first request and the second request. 2. The method of claim 1, wherein the first request specifies exclusivity of the first group of resources for the first request. 3. The method of claim 2, wherein if exclusivity is requested, the method comprises guaranteeing that the first request will be able to reserve exclusive resources. 4. A method of co-allocating resources within a compute environment, the method comprising: receiving a first request for a reservation for a first type of resource in a compute environment comprising a plurality of networked nodes, wherein the first request is part of a co-allocation request, wherein the co-allocation request comprises an indication of a period of time, a first node with a first operating system, and a second node with a second operating system;analyzing, via the processor, first constraints and service level agreement guarantees associated with the first request and related to use of the compute environment;identifying a first group of resources that meet the first request;receiving a second request for a reservation for a second type of resource in the compute environment, wherein the first type of resource comprises a memory device and wherein the second type of resource comprises one of a hard disk, a virtual memory, a network bandwidth capability, a clock speed, and a processor, wherein the first type of resource and the second type of resource span at least one node of the plurality of networked nodes, wherein each node of the plurality of networked nodes has a homogeneous processor architecture, the second request being part of the co-allocation request;identifying a second group of resources that meet the second request; andgenerating a co-allocation map between the first group of resources of the first type and the second group of resources of the second type, wherein first constraints, second constraints and service level agreement guarantees associated with the first request and the second request relate to time-based policies which limit requesters to a pre-determined quantity of resources at any given moment in time. 5. The method of claim 4, further comprising reserving resources according to the co-allocation map. 6. The method of claim 4, wherein generating the co-allocation map comprises identifying a reduced map of quantities of resources that can simultaneously satisfy the first request and the second request. 7. The method of claim 4, wherein the first type of resource and second type of resource comprise at least one of: compute resources, disk storage resources, network bandwidth resources, memory resources, and licensing resources. 8. The method of claim 4, wherein generating the co-allocation map further comprises identifying an intersection of an availability of each of the first type of resource and the second type of resource. 9. The method of claim 4, further comprising: generating a resulting array of events describing intersecting time frames. 10. The method of claim 9, wherein the resulting array of events comprises at least one of resource quantity, resource quality, time frames, quality of information and cost. 11. The method of claim 4, wherein the first request and the second request comprise at least one of: a job description, at least one time frame availability, a description of minimum resources, a description of resource types and attributes, and a reservation duration minimum. 12. The method of claim 4, wherein identifying the first group of resources and the second group of resources further comprises analyzing events associated with the first request and the second request and how resource availability changes over time. 13. The method of claim 12, wherein the events comprise at least one of job start, job completion, state change, boundaries, reservations, and policy enforcement limits. 14. The method of claim 4, further comprising reporting at least one of the following parameters associated with the identified first and second group of resources: cost, quality of information data, resource quantity data, time frame data, and resource quality data. 15. The method of claim 4, further comprising: performing again, under constraints identified by the co-allocation map, the step of identifying a first group of resources that meet the request for the first type of resource. 16. A system for co-allocating resources within a compute environment, the system comprising: a processor; anda computer-readable storage medium storing instructions which, when executed by the processor, cause the processor to perform operations comprising: receiving a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes, the first request being part of a co-allocation request, wherein the co-allocation request comprises an indication of a period of time, a first node with a first operating system, and a second node with a second operating system;analyzing first constraints and service level agreement guarantees associated with the first request and related to use of the compute environment;identifying a first group of resources that meets the first request for the first reservation;receiving a second request for a second reservation for a second type of resource in the compute environment, wherein the first type of resource comprises a memory device and wherein the second type of resource comprises one of a hard disk, a virtual memory, a network bandwidth capability, a clock speed, and a processor type, the second request being part of the co-allocation request;identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each server of the servers in the compute environment having a homogeneous processor architecture; andgenerating a set of resources exclusive to at least one of the first request and the second request. 17. A computer-readable storage device storing instructions which, when executed by a computing device to co-allocate resources within a compute environment, cause the computing device to perform operations comprising: receiving a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes, the first request being part of a co-allocation request, wherein the co-allocation request comprises an indication of a period of time, a first node with a first operating system, and a second node with a second operating system;analyzing first constraints and service level agreement guarantees associated with the first request and related to use of the compute environment;identifying a first group of resources that meets the first request for the first reservation;receiving a second request for a second reservation for a second type of resource in the compute environment, wherein the first type of resource comprises a memory device and wherein the second type of resource comprises one of a hard disk, a virtual memory, a network bandwidth capability, a clock speed, and a processor, the second request being part of the co-allocation request;identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each server of the servers in the compute environment having a homogeneous processor architecture; andgenerating a set of resources exclusive to at least one of the first request and the second request.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (127)
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.
Erimli, Bahadir; Tzeng, Shr-jie; Acharya, Yatin Ramesh, Apparatus and method in a network switch for modifying a bandwidth request between a requestor and a router.
Pietraszak,Michael E.; Fries,Robert M.; Gibson,Robert S. T.; Wray,Jonathan A., Application program interfaces for electronic program guide data services.
Jackson, David B., Canceling and locking personal reservation if the workload associated with personal reservation exceeds window of time allocated within a resource reservation.
Whittaker,Bruce Ernest; Watson,Leland Elvis; Brock,Scott Lane; Truong,Stephanie Ninh, Displaying abnormal and error conditions in system state analysis.
Friedrich Karl S. (2 Whitewood Rd. Worcester County ; Milford MA 01757) Bousquet Ann R. (18 Causeway St. Middlesex County ; Hudson MA 01749), Dynamic computer system performance modeling interface.
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.
Allen, Michael L.; Bosse, Craig E.; Brickhaus, Lisa A.; Budhraja, Ajay; Carter, Saul E.; Cerutti, Sherry; Gideon, Brenda G.; Jackson, Terry J.; Savintsev, Dmitri; Staggs, Ronald D.; Stobaugh, Richard, Graphical user interface for providing and facilitating user for searching and accessing information with options of selecting one of carrier circuit, facility reroute, customer and cable.
Leon L. Lumelsky ; Nelson R. Manohar, Management of service-oriented resources across heterogeneous media servers using homogenous service units and service signatures to configure the media servers.
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.
Dutta,Rabindranath; Banerjee,Dwip N., Method and system for dynamic utilization mechanisms for facilities whose reservation status can change dynamically.
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.
Cutler ; Jr. Victor Hawes ; Davieau Gerald Joseph, Method and system for managing the initiation of new traffic in a resource limited communication system.
Leong Leon ; Lee Frank, Method and system for monitoring remote routers in networks for available protocols and providing a graphical representation of information received from the routers.
Jones Michael B. ; Leach Paul J. ; Draves ; Jr. Richard P. ; Barrera ; III Joseph S., Method and system for resource management with independent real-time applications on a common set of machines.
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.
Jantz, Ray M.; DeKoning, Rodney A.; Courtright, II, William V.; Markus, Matthew A., Methods and apparatus for performing mass operations on a plurality of managed devices on a network.
Onarheim William G. (Milwaukee WI) Dudley Horace (Hales Corners WI) Meyer Barbara E. (Greendale WI) Viste Michael J. (Grafton WI) Morley David J. (Thousand Oaks CA), Methods for set up and programming of machine and process controllers.
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.
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는 부적절한 답변을 할 수 있습니다.