US20070266388A1 - System and method for providing advanced reservations in a compute environment - Google Patents

System and method for providing advanced reservations in a compute environment Download PDF

Info

Publication number
US20070266388A1
US20070266388A1 US10597898 US59789804A US2007266388A1 US 20070266388 A1 US20070266388 A1 US 20070266388A1 US 10597898 US10597898 US 10597898 US 59789804 A US59789804 A US 59789804A US 2007266388 A1 US2007266388 A1 US 2007266388A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
reservation
resources
method
request
sub
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10597898
Inventor
David Jackson
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Adaptive Computing Enterprises Inc
Original Assignee
Adaptive Computing Enterprises Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022Mechanisms to release resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5072Grid computing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance or administration or management of packet switching networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5014Reservation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/504Resource capping
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing
    • Y02D10/20Reducing energy consumption by means of multiprocessor or multiprocessing based techniques, other than acting upon the power supply
    • Y02D10/22Resource allocation

Abstract

A system and method are disclosed for dynamically reserving resources within a cluster environment. The method embodiment of the invention comprises receiving a request for resources in the cluster environment, monitoring events after receiving the request for resources and based on the monitored events, dynamically modifying at least one of the request for resources and the cluster environment.

Description

    PRIORITY CLAIM
  • The present application claims priority to U.S. Provisional Application No. 60/581,257 filed Jun. 18, 2004, the contents of which are incorporated herein by reference.
  • BACKGROUND OF THE INVENTION
  • 1. Field of the Invention
  • The present invention relates to reservations in a compute environment such as a cluster and more specifically to a system and method of providing reservation masks to manage resources in a compute environment.
  • 2. Introduction
  • The present invention relates to a system and method of managing compute resources in the context of a grid or cluster of computers. Grid computing may be defined as coordinated resource sharing and problem solving in dynamic, multi-institutional collaborations. Many computing projects require much more computational power and resources than a single computer or single processor may provide. Networked computers with peripheral resources such as printers, scanners, I/O devices, storage disks, scientific devices and instruments, etc. may need to be coordinated and utilized to complete a task.
  • Grid/cluster resource management generally describes the process of identifying requirements, matching resources to applications, allocating those resources, and scheduling and monitoring grid resources over time in order to run cluster/grid applications or jobs as efficiently as possible. Each project will utilize a different set of resources and thus is typically unique. In addition to the challenge of allocating resources for a particular job, administrators also have difficulty obtaining a clear understanding of the resources available, the current status of the cluster/grid and available resources, and real-time competing needs of various users. One aspect of this process is the ability to reserve resources for a job. A cluster manager will seek to reserve a set of resources to enable the cluster to process a job at a promised quality of service.
  • General background information on clusters and grids may be found in several publications. See, e.g., Grid Resource Management, State of the Art and Future Trends, Jarek Nabrzyski, Jennifer M. Schopf, and Jan Weglarz, Kluwer Academic Publishers, 2004; and Beowulf Cluster Computing with Linux, edited by William Gropp, Ewing Lusk, and Thomas Sterling, Massachusetts Institute of Technology, 2003.
  • It is generally understood herein that the terms grid and cluster are interchangeable in that there is no specific definition of either. The term compute environment may apply to a cluster, a grid or variations on the general concepts of clusters or grids. The definition of a cluster or grid is very flexible and may refer to a number of different configurations of computers. The introduction here is meant to be general given the variety of configurations that are possible. In general, a grid will comprise a plurality of clusters as will be shown in FIG. 1A. Several challenges exist when attempting to maximize resources in a compute environment. First, there are typically multiple layers of grid and cluster schedulers. A grid 100 may comprise a group of clusters or a group of networked computers within a particular administrative control. A grid scheduler 102 communicates with a plurality of cluster schedulers 104A, 104B and 104C. Each of these cluster schedulers communicates with a respective resource manager 106A, 106B or 106C. Each resource manager communicates with a respective series of compute resources shown as nodes 108A, 108B, 108C in cluster 110, nodes 108D, 108E, 108Fin cluster 112 and nodes 108G, 108H, 108I in cluster 114.
  • Local schedulers (which may refer to either the cluster schedulers 104 or the resource managers 106) are closer to the specific resources 108 and may not allow grid schedulers 102 direct access to the resources. Examples of compute resources include data storage devices such as hard drives and computer processors. The grid level scheduler 102 typically does not own or control the actual resources. Therefore, jobs are submitted from the high level grid-scheduler 102 to a local set of resources with no more permissions that the user would have. This reduces efficiencies and can render the reservation process more difficult.
  • The heterogeneous nature of the shared resources also causes a reduction in efficiency. Without dedicated access to a resource, the grid level scheduler 102 is challenged with the high degree of variance and unpredictability in the capacity of the resources available for use. Most resources are shared among users and projects and each project varies from the other. The performance goals for projects differ. Grid resources are used to improve performance of an application but the resource owners and users have different performance goals: from optimizing the performance for a single application to getting the best system throughput or minimizing response time. Local policies may also play a role in performance.
  • Within a given cluster, there is only a concept of resource management in space. An administrator can partition a cluster and identify a set of resources to be dedicated to a particular purpose and another set of resources can be dedicated to another purpose. In this regard, the resources are reserved in advance to process the job. There is currently no ability to identify a set of resources over a time frame for a purpose. By being constrained in space, the nodes 108A, 108B, 108C, if they need maintenance or for administrators to perform work or provisioning on the nodes, have to be taken out of the system, fragmented permanently or partitioned permanently for special purposes or policies. If the administrator wants to dedicate them to particular users, organizations or groups, the prior art method of resource management in space causes too much management overhead requiring constant adjustment to the configuration of the cluster environment and also losses in efficiency with the fragmentation associated with meeting particular policies.
  • To manage the jobs submissions, a cluster scheduler will employ reservations to insure that jobs will have the resources necessary for processing. FIG. 1B illustrates a cluster/node diagram for a cluster 110 with nodes 120. Time is along the X axis. An access control list 114 (ACL) to the cluster is static, meaning that the ACL is based on the credentials of the person, group, account, class or quality of service making the request or job submission to the cluster. The ACL 114 determines what jobs get assigned to the cluster 110 via a reservation 112 shown as spanning into two nodes of the cluster. Either the job can be allocated to the cluster or it can't and the decision is determined based on who submits the job at submission time. The deficiency with this approach is that there are situations in which organizations would like to make resources available but only in such a way as to balance or meet certain performance goals. Given the prior art model, companies are unable to have the needed or required flexibility over their cluster resources. To improve the management of cluster resources, what is needed in the art is a method for a module associated with administrative software that controls compute resources within a compute environment to manage reservations within the compute environment more efficiently and with more flexibility.
  • SUMMARY OF THE INVENTION
  • Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The features and advantages of the invention may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the present invention will become more fully apparent from the following description and appended claims, or may be learned by the practice of the invention as set forth herein. The present invention addresses the need to manage the reservation process with more flexibility and efficiency. The invention introduces the concept of reservation masks and comprises a method, system, and a computer-readable medium for managing compute resources by creating reservation masks over an identified group of compute resources. The method manages compute resources within a compute environment by identifying a need type and a group of available compute resources, creating a reservation mask over the identified group of compute resources and if a request from a consumer matches the need type, then constraining the creation of a sub-reservation for the consumer to only use compute resources within the reservation mask. A set of reservation masks may be created as well, wherein multiple sub-reservations from multiple consumer requests will each be constrained to only use compute resources within the set of reservation masks. In one aspect of the invention, the mask is a policy-enforcing mechanism to manage and constrain reservations.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • In order to describe the manner in which the above-recited and other advantages and features of the invention can be obtained, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
  • FIG. 1A illustrates generally a grid scheduler, cluster scheduler, and resource managers interacting with compute nodes;
  • FIG. 1B illustrates a job submitted to a resource set in a computing environment;
  • FIG. 2A illustrates a method of creating a reservation mask;
  • FIG. 2B illustrates a method of providing a roll-back reservation mask;
  • FIG. 2C illustrates a method embodiment of the invention;
  • FIG. 3A illustrates a reservation mask;
  • FIG. 3B illustrates another aspect of the reservation mask;
  • FIG. 4 illustrates a floating reservation; and
  • FIG. 5 illustrates another aspect of a roll-back reservation mask.
  • DETAILED DESCRIPTION OF THE INVENTION
  • Various embodiments of the invention are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the invention.
  • The present invention relates to resource reservations in the context of a compute environment. The environment may be operated by a hosting facility, hosting center, a virtual hosting center, data center, grid, cluster and/or utility-based computing environments. The system aspect of the invention comprises a computing device that operates software that practices the steps of the invention to manage compute resources. There are many known types of computing devices that are known to those of skill in the art and that are acceptable as the system embodiment of the invention. The computing device may be a single device or a plurality of connected computing devices that enable the invention to be practiced. The software operating within the system is comprised of computer program modules written in a computing language, such as the C programming language or any other suitable programming language. The programming modules include all the necessary programming to communicate with the compute environment (i.e., such as the cluster/grid) and both receive information about the compute resources within the compute environment and also manage the reservation and use of those compute resources. The primary invention disclosed herein relates to the concept of the reservation mask. Therefore, the system embodiment of the invention will include the various modules that practice the steps of the method embodiment of the invention disclosed herein. For example, a system for managing compute resources within a compute environment may comprise means for identifying a need type and a group of available resources, means for creating a reservation mask over the identified group of resources and means for constraining the creation of a sub-reservation associated with a request from a consumer that matches the need type. The means for performing this may be, as mentioned above, computer programmed modules within a software package that perform these steps.
  • Prior to discussing the reservation masks according to the invention, some other explanatory information is provided about reservations and the access control list.
  • The present invention allows the ACL for the reservation to have a dynamic aspect instead of simply being based on who the requester is. The ACL decision making process is based at least in part on the current level of service or response time that is being delivered to the requester. To illustrate the operation of the ACL, assume that a user submits a job and that the ACL reports that the only jobs that can access these resources are those that have a queue time that currently exceeds two hours. If the job has sat in the queue for two hours it will then access the additional resources to prevent the queue time for the user from increasing significantly beyond this time frame. The decision to allocate these additional resources can be keyed off of utilization of an expansion factor and other performance metrics of the job.
  • Whether or not an ACL is satisfied is typically and preferably determined by the scheduler 104A. However, there is no restriction in the principle of the invention regarding where or on what node in the network the process of making these allocation of resource decisions occurs. The scheduler 104A is able to monitor all aspects of the request by looking at the current job inside the queue and how long it has sat there and what the response time target is and the scheduler itself determines whether all requirements of the ACL are satisfied. If requirements are satisfied, it releases the resources that are available to the job. A job in the queue can then consume resources and the scheduler communicates this to the scheduler 104A. If resources are allocated, the job is taken from the queue and inserted into the reservation in the cluster.
  • An example benefit of this model is that it makes it significantly easier for a site to balance or provide guaranteed levels of service or constant levels of service for key players or the general populace. Setting aside certain resources and only making them available to the jobs which threaten to violate their quality of service targets increases the probability of satisfying the targets.
  • The disclosure now continues to discuss reservations further. An advance reservation is the mechanism by which the present invention guarantees the availability of a set of resources at a particular time. With an advanced reservation a site now has an ability to actually specify how the scheduler should manage resources in both space and time. Every reservation consists of three major components, a list of resources, a timeframe (a start and an end time during which it is active), and an access control list (ACL). These elements are subject to a set of rules. The ACL acts as a doorway determining who or what can actually utilize the resources of the cluster. It is the job of the cluster scheduler to make certain that the ACL is not violated during the reservation's lifetime (i.e., its timeframe) on the resources listed. The ACL governs access by the various users to the resources. The ACL does this by determining which of the jobs, various groups, accounts, jobs with special service levels, jobs with requests for specific resource types or attributes and many different aspects of requests can actually come in and utilize the resources. With the ability to say that these resources are reserved, the scheduler can then enforce true guarantees and can enforce policies and enable dynamic administrative tasks to occur. The system greatly increases in efficiency because there is no need to partition the resources as was previously necessary and the administrative overhead is reduced it terms of staff time because things can be automated and scheduled ahead of time and reserved.
  • As an example of a reservation, a reservation may specify that node002 is reserved for user John Doe on Friday. The scheduler will thus be constrained to make certain that only John Doe's jobs can use node002 at any time on Friday. Advance reservation technology enables many features including backfill, deadline based scheduling, QOS support, and meta scheduling.
  • There are several reservation concepts that will be introduced as aspects of the invention. These include dynamic reservations, co-allocating reservation resources of different types, reservations that self-optimize in time, reservations that self-optimize in space, reservations rollbacks and reservation masks. The main focus of the present invention is the reservation mask.
  • Dynamic reservations are reservations that are able to be modified once they are created. Attributes of a reservation may change based on a feedback mechanism that adds intelligence as to ideal characteristics of the reservation and how it should be applied as the context of its environment or an entities needs change. One example of a dynamic reservation is a reservation that provides for a guarantee of resources for a project unless that project is not using the resources it has been given. A job associated with a reservation begins in a cluster environment. At a given portion of time into processing the job on compute resources, the system receives compute resource usage feedback relative to the job. For example, a dynamic reservation policy may apply which says that if the project does not use more than 25% of what it is guaranteed by the time that 50% of its time has expired, then, based on the feedback, the system dynamically modifies the reservation of resources to more closely match the job. In other words, the reservation dynamically adjust itself to reserve X % fewer resources for this project, thus freeing up unused resources for others to use.
  • Another dynamic reservation may perform the following step: if usage of resources provided by a reservation is above 90% with fewer than 10 minutes left in the reservation then the reservation will attempt to add 10% more time to the end of the reservation to help ensure the project is able to complete. In summary, it is the ability for a reservation to receive manual or automatic feedback to an existing reservation in order to have it more accurately match any given needs, whether those be of the submitting entity, the community of users, administrators, etc. The dynamic reservation improves the state of the art by allowing the ACL to the reservation to have a dynamic aspect instead of simply being based on who the requestor is. The reservation can be based on a current level of service or response time being delivered to the requestor.
  • Another example of a dynamic reservation is consider a user submitting a job and the reservation may need an ACL that requires that the only job that can access these resources are those that have a queue time that is currently exceeded two hours. If the job has sat in the queue for two hours it will then access the additional resources to prevent the queue time for the user from increasing significantly beyond this time frame. You can also key the dynamic reservation off of utilization, off of an expansion factor and other performance metrics of the job.
  • The ACL and scheduler are able to monitor all aspects of the request by looking at the current job inside the queue and how long it has sat there and what the response time target is. It is preferable, although not required, that the scheduler itself determines whether all requirements of the ACL are satisfied. If the requirements are satisfied, the scheduler releases the resources that are available to the job.
  • The benefit of this model is that it makes it significantly easier for a site to balance or provide guaranteed levels of service or constant levels of service for key players or the general populace. Setting aside certain resources and only making them available to the jobs which threaten to violate their quality of service target increases the probability of satisfying those targets.
  • Another reservation type is a self optimizing reservation in time. In many cases, people will request resources and request that they be available at a particular time. For example, a person is doing a demonstration and it happens to be from 2:00 pm to 4:00 pm. In many other cases, people will simply have a deadline or simply want processing as early as possible. With a self-optimizing in time reservation, the scheduler is actually able to lock in a set of resources for a particular request and then over time evaluate the cluster resources and determine if it can actually improve on it and improve on the reservation in such a way as to guarantee that it does not lose the resources that it has already made available.
  • With self-optimizing reservations in time, a particular request may come in requesting resources that meet the following criteria but the requester prefers resources that meet a more increasingly strict criteria. The scheduler, in finding the reservation, may be able to satisfy the required criteria but not necessarily satisfy all the preferred criteria. Over time, the scheduler, once it has established a reservation that meets the minimum criteria, it can continue to look at newly freed up resources and determine if it can, to a larger and larger extent, satisfy the preferred resource needs as well. This self optimizing reservation technology is also useful to work around resource failures in the case of a reservation that has already had reserved all the resources it needs and it has a node failure. It can actually continue to locate resources and reallocate resources that are still up and running and be able to satisfy the time frame it originally promised by excluding the failed node and picking up a newly available compute node.
  • With the above concepts about reservations and the ACL in mind, the reservation mask is next introduced. FIG. 2A illustrates the steps taken to provide a reservation mask for compute resources. The method comprises identifying a need type and a group of available resources (202), creating a reservation mask over the identified group of resources (204) and if a request from a consumer matches the need type, then constraining the creation of a sub-reservation for the consumer to only use resources within the reservation mask (206). The reservation mask therefore has a different purpose from the reservation itself. The mask is a policy-enforcing mechanism to manage and constrain reservations. Identifying a need type and a group of available resources may be based on an administrative policy or some other criteria. The sub-reservation may be constrained by independent, non-administrative criteria, such as the quantity of resources and on a per-credential basis. For example, the constraints may limit each member of a group to six processors at a time. If the request from a requestor matches the need type, then the creation of the sub-reservation may be constrained at least according to credentials associated with the request. The credentials may be at least one of: per user credential, per group credential, per class credential, quality of service-based credential and a partition-based credential. There are preferably policies that impose these constraints upon the sub-reservations. These types of independent limits on non-administrative reservations do not really have anything to do with the reservation mask but relate to the ability to limit the creation of reservations with or without the masks according to the per-credential policy. In other words, the per person, per group, per class, per QOS, per partition, etc. policy that imposes these constraints. In this case, these constraints only apply to a personal or a grid reservation and not to administrative reservations.
  • The sub-reservation (or simply, the reservation) may be dynamically modified according to received data such as resource usage, system performance, a policy and a criterion associated with the request. For example, if resource usage is low, the sub-reservation may be dynamically modified to use 8 more processors which are not being used to more efficiently use the resources and more quickly complete the task. Such modifications may be bounded by minimum thresholds and maximum thresholds such as load metrics or system performance parameters. Modifying the sub-reservation may involve several things. For example, the ACL may be modified, the reserved resources may be modified, and the time frame covered may be modified. Other modifications may be made as well to further improve the completion of the task either from a job standpoint or a compute environment standpoint.
  • If a request from the consumer does not match the need type, then no constraints are enforced for creating a reservation for the request from the consumer. Creating the reservation mask may also involve specifying at least one timeframe during which the reservation mask enforces constraints, such as during business hours, eastern time. The time frame may also be a plurality of independent or periodic time frames. The method may also provide for specifying an access control list that constrains which consumers or resource requests may utilize resources within the reservation mask. The request from the consumer or requester is typically placed within the access control list. The need type may refer to a particular use, a user, a group of users, a job source, a type of job submission, personal reservation, grid reservation, cluster reservation and so forth.
  • A personal reservation, for example, may consist of a reservation that dedicates resource access to a specific user or group of users. One aspect of the personal reservation or reservation from a consumer is that is it is a non-administrator request. If the personal reservation provides access to resources to a group of users, then each reservation and reservation timeframe are determined by a user in the group of users that requests the respective reservation. Where there are administrator requests and personal requests that may be submitted, the administrator requests may be different in one aspect in that they are not constrained within the reservation mask. A grid reservation is a reservation requested from outside an administrative group. When a grid reservation is received (a grid-based request) and established, the system protects or guarantees the resource availability for a job that is remotely created from the local compute resources.
  • Another aspect of reservation relates to a roll-back reservation in time or a roll-back reservation mask. FIG. 2B illustrates this method embodiment of the present invention. The method of managing compute resources within a compute environment comprises establishing a policy to provide compute resources within a fixed time from the reception of a request for a reservation (210), creating a roll-back reservation mask which slides ahead of current time by the fixed time (212) and receiving a request for a reservation (214). Upon receiving the request for a reservation, the roll-back reservation mask insures that compute resources will be available for reservation within the fixed time according to the policy. The policy may be established according to an agreement with a requester of compute resources and the provider or manager of the compute resources. An example policy would insure that the requestor of resources may be able to reserve and have at a predetermined quality of service, 100 nodes, 3 GB of memory and a certain bandwidth of communication within six hours of a request.
  • The compute environment is a cluster or a grid or any other grouping of compute devices or compute nodes. Within the roll-back reservation mask, the mask analyzes compute resources according to the policy to insure that compute resources may be reserved by the requestor within the fixed period of time. An example of the request for a reservation is a consumption request, where a user desires to process a submitted job using the compute resources. After receiving the reservation request, the roll-back reservation mask reserves the appropriate compute resources according to the request and the policy such that within the fixed amount of time, the requestor has access to his or her reserved resources.
  • The reservation mask can also be self-optimizing. Given that there is sufficient time to analyze the request or reservation and the compute resources, the reservation mask may analyze whether a level of service can be improved for the reservation request and if the level of service can be improved, then the mask cancels the reservation of compute resources and reserves a second group of compute resources. The mask or some other compute process may perform some of these steps. This self-optimization process of modifying or canceling and re-issuing reservations to improve performance of either the compute environment or the quality of service delivered to the requester may occur until a predetermined point. For example, assume the policy requires that the requester have resources reserved and available for use within one hour of the request. If the requestor requests a reservation for three hours into the future, the roll-back reservation mask has two hours until the fixed guaranteed time to optimize the request. When the time comes where the request needs to be honored within one hour, one aspect of the invention requires the reservation to be set and thus not “covered” by the reservation mask. The reservation in this sense has slipped out from underneath the reservation mask. This is shown by the reservations 406 in FIG. 4 and FIG. 5.
  • The roll-back reservation mask 402, 502 has a length preferably based on the agreement. This may be, for example, a several months or it may be indefinite or of infinite length. Preferably, the length of the mask 402, 502 is associated with how far into the future it analyzes compute resources and a height associated with a guaranteed throughput.
  • FIG. 3A illustrates a standing reservation. In cluster 302, there are standing reservations shown as 304A, 304B and 304C. These reservations show resources allocated and reserved on a periodic basis. These are consuming reservations meaning that cluster resources will be consumed by the reservation.
  • A reservation mask, mentioned above, allows a compute site to create “sandboxes” in which other guarantees can be made. The most common aspects of this reservation are for grid environments and personal reservation environments. In a grid environment, a remote entity will be requesting resources and will want to use these resources on an autonomous cluster for the autonomous cluster to participate. In many cases it will want to constrain when and where the entities can reserve or utilize resources. One way of doing that is via the reservation mask.
  • FIG. 3B illustrates the reservation mask shown as creating sandboxes 306A, 306B, 306C in duster 310 and allowing the autonomous cluster to state that only a specific subset of resources can be used by these remote requesters during a specific subset of times. When a requester asks for resources, the scheduler will only report and return resources available within this reservation mask, after which point if the remote entity wants to use the resources, it can actually make a consumption reservation and that reservation is guaranteed to be within the reservation mask space. The consumption reservations 312A, 312B, 312C, 312D are shown within the reservation masks.
  • In cluster 310 the reservation masks operate differently from consuming reservations in that they are enabled to allow personal reservations to be created within the space that is reserved. ACL's are independent inside of a sandbox reservation or a reservation mask in that you can also exclude other requesters out of those spaces so they're dedicated for these particular users.
  • The benefits of this approach include preventing local job starvation, and providing a high level of control to the cluster manager in that he or she can determine exactly when, where, how much and who can use these resources even though the manager doesn't necessarily know who the requesters are or the combination or quantity of resources they will request. The administrator can determine when, how and where requestors will participate in these grids. A valuable use is in the space of personal reservations which typically involves a local user given the authority to reserve a block of resources for a rigid time frame. Again, with a personal reservation mask, the requests are limited to only allow resource reservations within the mask time frame and mask resource set, providing again the administrator the ability to constrain exactly when and exactly where and exactly how much of resources individual users can reserve for a rigid time frame. The individual user is not known ahead of time but it is known to the system, but it typically a standard local cluster user.
  • The reservation masks 306A, 306B and 306C define periodic, personal reservation masks where other reservations in a cluster 310 may be created, i.e., outside the defined boxes. These are provisioning or policy-based reservations in contrast to consuming reservations. In this regard, the resources in this type of reservation are not specifically allocated but the time and space defined by the reservation mask cannot be reserved for other jobs. Reservation masks enable the system to be able to control the fact that resources are available for specific purposes, during specific time frames. The time frames may be either single time frames or regular, repeating time frames to dedicate the resources to meet project needs, policies, guarantees of service, administrative needs, demonstration needs, etc. This type of reservation insures that reservations are managed and scheduled in time as well as space. Boxes 308A, 308B, 308C and 308D represent non-personal reservation masks. They have the freedom to be placed anywhere in cluster including overlapping some or all of the reservation masks 306A, 306B, 306C. Overlapping is allowed when the personal reservation mask was setup with a global ACL. To prevent the possibility of an overlap of a reservation mask by a non-personal reservation, the administrator can set an ACL to constrain it so that only personal consumption reservations are inside. These personal consumption reservations are shown as boxes 312A, 312B, 312C, 312D which are constrained to be within the personal reservation masks 306A, 306B, 306C. The 308A, 308B, 308C and 308D reservations, if allowed, can go anywhere within the cluster 310 including overlapping the other personal reservation masks. The result is the creation of a “sandbox” where only personal reservations can go without in any way constraining the behavior of the scheduler to schedule other requests. The ACL is preferably the mechanism that constrains which consumer or resource requests may utilize resources within the reservation mask.
  • Another reservation type is the roll-back reservation mask shown in FIG. 4. This reservation mask has particular application for enforcing policies or allowing support for service level guarantees in service level agreements. A level of service guarantee allows a site, cluster or grid to guarantee that a particular consumer or organization or type of credential is guaranteed a certain quantity of resources within a certain amount of time. The standard way to provide those guarantees would be to dedicate a block of resources that satisfies the needs and would be statically and rigidly partitioned so that no one else could access it. The request of that organization could not extend beyond the bounds of the dedicated block.
  • A self optimizing reservation will only slide forward barring resource failure of the actual compute resources. It does this by, when it makes a query to determine what resources are available, as part of its algorithm, it determines that it has availability to both free resources and the resources it already has reserved. In such a case in then goes and analyzes it, looks at resources that were recently freed by other workload and other reservations that completed early which is actually quite common in a cluster environment, and if it can find that it can improve the level of service delivered to the request or it will actually create the new reservation and will remove the old reservation and adjust things as needed. A self optimizing reservation therefore has the ability to improve any given attribute of service to the submitting entity, community of users, administrators, etc.
  • With the present invention regarding the reservation roll-back, an administrator can create a reservation mask 402 which enforces its policy and continues to float in time a certain distance 408 ahead of the current time. Typically, the rectangular area of the reservation mask has a height that corresponds to guaranteed throughput when processing jobs and the horizontal distance that corresponds to the length in time of the reservation mask. The reservation mask 402 may correspond to a certain amount of time according to a service level agreement, such as 3 or 4 months for example. The reservation mask 402 may extend into infinity as well if there is no defined ending time. The reservation mask 402 is a provisioning reservation and maintains the time offset 408 to the current time.
  • To illustrate the reservation roll-back, consider a service level agreement with a company to have twenty resources available within one hour of the request for the resources and that they can make the request anytime. The time offset 408 can then be set to one hour and the company will never will they wait more than one hour to get up to twenty compute resources. The reservation mask 402 monitors the resources and when a request is made for resources, consumption reservations 404 are allocated and left behind 406 as the roll-back reservation mask maintains its offset. Those that are left behind are not “covered” by the reservation mask 402 any longer.
  • An implementation with reservation rollback mask allows a site to set up basically a floating reservation that extends from one hour in the future until a time further in the future, such as 4 or 8 hours in the future, and continues to slide forward in time. The reservation mask 402 will only allow jobs from this organization into the space and can drop down requests or reserve host resources underneath the reservation mask. As time moves forward, the reservation mask slides forward in time so it always maintains a constant distance in the future allowing these guarantees 404 to be created and maintained 406 on the cluster.
  • The time offset 408 may be static or dynamic. A static offset 408 will maintain a constant offset time, such as one hour into the future. The static offset will likely be set by a service level agreement wherein a company requests that the resources become available within an hour. The offset 408 may also by dynamic. There may be requests in the service level agreement where under a given event or set of events, the offset would change wherein the reservation slides closer or farther away from the current time to provide a guarantee of resources within ½ (instead of 1 hour) or 2 hours in the future. There are a variety of ways to vary the offset. One can be to simply cancel the current sliding reservation and create a new reservation at a different offset. Another way would be to maintain the current reservation but slide it closer or farther away from the current time. The factors that adjust the dynamic nature of the offset may be based on company requests, the nature and use of the cluster resources, the time the request is made, historical information, and so forth. For example, if the request for resources is made at midnight on a Friday night, perhaps instead of the 1 hour availability of resources, the hosting center analyzes the cluster resources and the time of the request and determines that it can deliver the resources in ½. The company may want a flexible offset where if the request is made during a block of time such as between 3-4:30 pm (near the end of the work day) that the offset be shortened so that the job can be processed sooner. The modifications to the offset may be automatic based on a feedback loop of information or may be adjustable by an administrator.
  • The dynamic aspect of the period of time in which the reservation mask slides ahead of the current time is discussed next. This aspect of the invention provides some flexibility in how soon resources need to be available after a request for a reservation. For example, if the fixed time offset 408 is three hours, a user submits a request for a reservation on Friday at 3:00 pm, the soonest the resources would be guaranteed to be available to process a submitted job is 6:00 pm. That may be beyond the time that the user desires to wait to submit a job. A dynamically modifiable period of time allows for some parameters that can move up the period of time in which the resources can be available.
  • FIG. 2C illustrates the method aspect of the invention in this regard. A method of managing compute resources within a compute environment comprises establishing a policy to provide compute resources within a period of time from the reception of a request for a reservation (220), creating a roll-back reservation mask which slides ahead of current time by the period of time (222) and receiving a request for a reservation, wherein the period of time by which compute resources must be available after a request for a reservation is dynamically modifiable (224).
  • The policy may be based on an agreement with a submitter of requests for reservations or a service level agreement. The period of time is dynamically modifiable based on a number of factors, such as parameters within the policy, events related to the compute environment (a cluster environment or a grid environment), historical information such as previous jobs submitted by the submittor, events related to a time associated with a job submission or the job submission itself, a request by a consumer or events related billing. As can be seen, there may be a number of factors that may play a role in an analysis of whether the period of time from which resources must be available after a request is received may be modified (increased or decreased).
  • The reservation rollback policy mask is stackable allowing multiple different types of service or service level agreements to be simultaneously satisfied and share a collection of resources. This feature is illustrated in FIG. 5. A reservation 502 is shown and can generally be considered as an aggregation of requests from various masks 504, 506, 508 510. These are aggregated into one space 502 which will then allow reservations to be created on a first come first serve basis, or based on other factors. If these reservation masks 504, 506, 508 and 510 are stacked with individual offsets from the current time (not shown), the administrator can allow the masks to be partitioned among consumers. A useful component of this stackable approach is the capability to have an enveloping reservation 502 created with a total quantity of resource and rollback time offset 408 and a duration to the end of the SLA. Once that reservation space is established or paid for, as a service, the hosting center sub-partitions the space using reservations to provide service guarantees, response time guarantees, quantity or resources guarantees taking advantage of the stacking capability.
  • A company may therefore establish the enveloping reservation 502 and request from the hosting center that they partition the space according to various organizations within the enveloping reservation 502. This eliminates the need for a large entity to have its own group of clusters of computer.
  • Embodiments within the scope of the present invention may also include computer-readable media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code means in the form of computer-executable instructions or data structures. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or combination thereof) to a computer, the computer properly views the connection as a computer-readable medium. Thus, any such connection is properly termed a computer-readable medium. Combinations of the above should also be included within the scope of the computer-readable media.
  • Computer-executable instructions include, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Computer-executable instructions also include program modules that are executed by computers in stand-alone or network environments. Generally, program modules include routines, programs, objects, components, and data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of the program code means for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.
  • Those of skill in the art will appreciate that other embodiments of the invention may be practiced in network computing environments with many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. Embodiments may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are linked (either by hardwired links, wireless links, or by a combination thereof) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
  • Although the above description may contain specific details, they should not be construed as limiting the claims in any way. Other configurations of the described embodiments of the invention are part of the scope of this invention. Accordingly, the appended claims and their legal equivalents should only define the invention, rather than any specific examples given.

Claims (41)

  1. 1. A method of managing compute resources within a compute environment, the method comprising:
    identifying a need type and a group of available compute resources;
    creating a reservation mask over the identified group of compute resources; and
    if a request from a consumer matches the need type, then constraining the creation of a sub-reservation for the consumer to only use compute resources within the reservation mask.
  2. 2. The method of claim 1, further comprising:
    creating a set of reservation masks over the identified group of compute resources, wherein multiple sub-reservations created from multiple consumer requests are each constrained to only use compute resources within the set of reservation masks.
  3. 3. The method of claim 1, wherein the request from the consumer is a non-administrator request.
  4. 4. The method of claim 3, wherein an administrator is not constrained within the reservation mask.
  5. 5. The method of claim 1, wherein the compute environment is a grid environment and the request from a consumer is a grid-based request.
  6. 6. The method of claim 1, wherein the compute environment is one of: a compute farm, a data center, a virtual hosting center, a hosting center, a grid and a cluster.
  7. 7. The method of claim 1, wherein the request from a consumer is a personal-based request.
  8. 8. The method of claim 1, wherein the request from a consumer is placed in an access control list.
  9. 9. The method of claim 1, wherein if a request from the consumer does not match the need type, then no constraints are enforced for creating the sub-reservation.
  10. 10. The method of claim 1, wherein creating the reservation mask further comprises specifying at least one timeframe during which the reservation mask enforces constraints.
  11. 11. The method of claim 10, wherein the at least one time frame further comprises a plurality of independent time frames.
  12. 12. The method of claim 10, wherein the at least one time frame further comprises a plurality of regular, periodic timeframes.
  13. 13. The method of claim 1, further comprising:
    specifying an access control list that constrains which consumers or resource requests may utilize compute resources within the reservation mask.
  14. 14. The method of claim 1, wherein the need type comprises at least one of: a particular use, a user, a group of users, a job source and a type of job submission.
  15. 15. The method of claim 1, wherein the reservation mask is for a need type of a personal reservation or a grid reservation.
  16. 16. The method of claim 15, wherein the personal reservation comprises a reservation that dedicates resource access to a user or a group of users.
  17. 17. The method of claim 16, wherein if the personal reservation provides access to resources to a group of users, then each reservation and reservation timeframe are determined by a user in the group of users that requests the respective reservation.
  18. 18. The method of claim 15, wherein a grid reservation is a reservation requested from outside an administrative group.
  19. 19. The method of claim 1, wherein the step of identifying a need type and a group of available resources is based on an administrative policy.
  20. 20. The method of claim 1, further comprising:
    modifying the sub-reservation according to received data.
  21. 21. The method of claim 20, wherein the received data is at least one of resource usage, system performance, a policy and a criterion associated with the request.
  22. 22. The method of claim 20, wherein modification of the sub-reservation is bounded by a minimum threshold and a maximum threshold.
  23. 23. The method of claim 20, wherein modifying the sub-reservation further comprises modifying at least one of: an access control list, reserved resources and a time frame covered.
  24. 24. The method of claim 1, wherein the created sub-reservation is constrained by independent, non-administrative criteria.
  25. 25. The method of claim 24, wherein the criteria comprises at least one of quantity of resources and on a per-credential basis.
  26. 26. The method of claim 1, wherein the reservation mask is a policy enforcing mechanism to manage and constrain sub-reservations.
  27. 27. A method of managing compute resources within a compute environment, the method comprising:
    identifying a need type and a group of available resources;
    creating a reservation mask over the identified group of resources; and
    if a request from a requestor matches the need type, then constraining the creation of a sub-reservation for the requestor independent of the reservation mask and according to credentials associated with the request.
  28. 28. The method of claim 27, wherein the credentials are one of: a per user credentials, per group credentials, per class credentials, quality of service-based credentials and a partition-based credentials.
  29. 29. The method of claim 27, wherein the request is a non-administrative request.
  30. 30. The method of claim 29, wherein the request is a request for a sub-reservation comprising one of a grid-based reservation and a personal reservation.
  31. 31. A system for managing compute resources within a compute environment, the system comprising:
    means for identifying a need type and a group of available resources;
    means for creating a reservation mask over the identified group of resources; and
    means for constraining the creation of a sub-reservation associated with a request from a consumer that matches the need type.
  32. 32. The system of claim 31, wherein the means for constraining the creation of a sub-reservation constrains the creation of the sub-reservation to only use compute resources within the, reservation mask.
  33. 33. The system of claim 31, wherein the means for constraining the creation of a sub-reservation constrains the creation of the sub-reservation independent of the reservation mask and according to credentials associated with the request.
  34. 34. The system of claim 33, wherein the credentials are one of: a per user credentials, per group credentials, per class credentials, quality of service-based credentials and a partition-based credentials.
  35. 35. A system for managing compute resources within a compute environment, the system comprising:
    a module configured to identify a need type and a group of available resources;
    a module configured to create a reservation mask over the identified group of resources; and
    a module configured to constrain the creation of a sub-reservation for the consumer if a request from a consumer matches the need type.
  36. 36. The system of claim 35, wherein the module configured to constrain the creation of the sub-reservation constrains the creation of the sub-reservation to only use resources within the reservation mask.
  37. 37. The system of claim 35, wherein the module configured to constrain the creation of the sub-reservation constrains the creation of the sub-reservation independent of the reservation mask and according to credentials associated with the request.
  38. 38. The system of claim 37, wherein the credentials are one of: a per user credentials, per group credentials, per class credentials, quality of service-based credentials and a partition-based credentials.
  39. 39. A computer-readable medium storing instructions for controlling a computing device to manage compute resources within a compute environment, the instructions comprising:
    identifying a need type and a group of available resources;
    creating a reservation mask over the identified group of resources; and
    constraining the creation of a sub-reservation for the consumer if a request from a consumer matches the need type.
  40. 40. The computer-readable medium of claim 39, wherein the sub-reservation is constrained to only use resources within the reservation.
  41. 41. The computer-readable medium of claim 39, wherein the sub-reservation is created for the request independent of the reservation mask and according to credentials associated with the request.
US10597898 2004-06-18 2004-06-18 System and method for providing advanced reservations in a compute environment Abandoned US20070266388A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US58125704 true 2004-06-18 2004-06-18
US10597898 US20070266388A1 (en) 2004-06-18 2004-06-18 System and method for providing advanced reservations in a compute environment
PCT/US2005/021427 WO2006009827A3 (en) 2004-06-18 2005-06-17 System and method of providing reservation masks within a compute environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10597898 US20070266388A1 (en) 2004-06-18 2004-06-18 System and method for providing advanced reservations in a compute environment

Publications (1)

Publication Number Publication Date
US20070266388A1 true true US20070266388A1 (en) 2007-11-15

Family

ID=35785689

Family Applications (10)

Application Number Title Priority Date Filing Date
US10597898 Abandoned US20070266388A1 (en) 2004-06-18 2004-06-18 System and method for providing advanced reservations in a compute environment
US11155091 Active 2029-06-10 US8037475B1 (en) 2004-06-18 2005-06-17 System and method for providing dynamic provisioning within a compute environment
US11155347 Active 2028-09-13 US8370898B1 (en) 2004-06-18 2005-06-17 System and method for providing threshold-based access to compute resources
US11155090 Active 2029-07-23 US8321871B1 (en) 2004-06-18 2005-06-17 System and method of using transaction IDS for managing reservations of compute resources within a compute environment
US13269893 Active 2025-12-07 US9069611B2 (en) 2004-06-18 2011-10-10 System and method for providing dynamic provisioning within a compute environment
US13686045 Active US8984524B2 (en) 2004-06-18 2012-11-27 System and method of using transaction IDS for managing reservations of compute resources within a compute environment
US13758182 Active US9135066B2 (en) 2004-06-18 2013-02-04 System and method for providing threshold-based access to compute resources
US14744746 Active US9491064B2 (en) 2004-06-18 2015-06-19 System and method for providing dynamic provisioning within a compute environment
US14850346 Active US9537726B2 (en) 2004-06-18 2015-09-10 System and method for providing threshold-based access to compute resources
US15345017 Pending US20180054364A1 (en) 2004-06-18 2016-11-07 System and Method for Providing Dynamic Provisioning Within a Compute Environment

Family Applications After (9)

Application Number Title Priority Date Filing Date
US11155091 Active 2029-06-10 US8037475B1 (en) 2004-06-18 2005-06-17 System and method for providing dynamic provisioning within a compute environment
US11155347 Active 2028-09-13 US8370898B1 (en) 2004-06-18 2005-06-17 System and method for providing threshold-based access to compute resources
US11155090 Active 2029-07-23 US8321871B1 (en) 2004-06-18 2005-06-17 System and method of using transaction IDS for managing reservations of compute resources within a compute environment
US13269893 Active 2025-12-07 US9069611B2 (en) 2004-06-18 2011-10-10 System and method for providing dynamic provisioning within a compute environment
US13686045 Active US8984524B2 (en) 2004-06-18 2012-11-27 System and method of using transaction IDS for managing reservations of compute resources within a compute environment
US13758182 Active US9135066B2 (en) 2004-06-18 2013-02-04 System and method for providing threshold-based access to compute resources
US14744746 Active US9491064B2 (en) 2004-06-18 2015-06-19 System and method for providing dynamic provisioning within a compute environment
US14850346 Active US9537726B2 (en) 2004-06-18 2015-09-10 System and method for providing threshold-based access to compute resources
US15345017 Pending US20180054364A1 (en) 2004-06-18 2016-11-07 System and Method for Providing Dynamic Provisioning Within a Compute Environment

Country Status (4)

Country Link
US (10) US20070266388A1 (en)
EP (2) EP2357561A1 (en)
CA (1) CA2570476A1 (en)
WO (1) WO2006009827A3 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090025004A1 (en) * 2007-07-16 2009-01-22 Microsoft Corporation Scheduling by Growing and Shrinking Resource Allocation
US8060883B1 (en) * 2007-02-16 2011-11-15 Vmware, Inc. System for managing and providing expandable resource reservations in a tree hierarchy
US20130060933A1 (en) * 2011-09-07 2013-03-07 Teresa Tung Cloud service monitoring system
US20140075029A1 (en) * 2012-09-11 2014-03-13 Maor Lipchuk Virtual resource allocation and resource and consumption management
US20140359132A1 (en) * 2011-01-03 2014-12-04 Novell, Inc. Policy and identity based workload provisioning
US9069610B2 (en) 2010-10-13 2015-06-30 Microsoft Technology Licensing, Llc Compute cluster with balanced resources
WO2016054382A1 (en) * 2014-10-03 2016-04-07 SorsEm, LLC Resource allocation methods and apparatus

Families Citing this family (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8863143B2 (en) 2006-03-16 2014-10-14 Adaptive Computing Enterprises, Inc. System and method for managing a hybrid compute environment
JP4770602B2 (en) * 2006-06-23 2011-09-14 株式会社デンソー Electronics
US8677353B2 (en) * 2007-01-11 2014-03-18 Nec Corporation Provisioning a standby virtual machine based on the prediction of a provisioning request being generated
US8250581B1 (en) * 2007-10-28 2012-08-21 Hewlett-Packard Development Company, L.P. Allocating computer resources to candidate recipient computer workloads according to expected marginal utilities
EP2272240A2 (en) * 2008-04-09 2011-01-12 Nxp B.V. Aggressive resource management
US9858123B1 (en) 2014-11-10 2018-01-02 Turbonomic, Inc. Moving resource consumers in computer systems
US9805345B1 (en) 2014-11-10 2017-10-31 Turbonomic, Inc. Systems, apparatus, and methods for managing quality of service agreements
US9830192B1 (en) * 2014-11-10 2017-11-28 Turbonomic, Inc. Managing application performance in virtualization systems
US9888067B1 (en) 2014-11-10 2018-02-06 Turbonomic, Inc. Managing resources in container systems
US9852011B1 (en) 2009-06-26 2017-12-26 Turbonomic, Inc. Managing resources in virtualization systems
EP2467779A2 (en) * 2009-08-19 2012-06-27 Nxp B.V. Lazy resource management
US8832707B2 (en) * 2009-12-21 2014-09-09 International Business Machines Corporation Tunable error resilience computing
US20110235592A1 (en) * 2010-03-26 2011-09-29 Qualcomm Incorporated Network resource leasing
US8381217B1 (en) * 2010-04-30 2013-02-19 Netapp, Inc. System and method for preventing resource over-commitment due to remote management in a clustered network storage system
US8621477B2 (en) * 2010-10-29 2013-12-31 International Business Machines Corporation Real-time monitoring of job resource consumption and prediction of resource deficiency based on future availability
US8984519B2 (en) * 2010-11-17 2015-03-17 Nec Laboratories America, Inc. Scheduler and resource manager for coprocessor-based heterogeneous clusters
US8966037B1 (en) 2011-01-18 2015-02-24 Amazon Technologies, Inc. Measuring spread of compute capacity
US8924561B2 (en) * 2011-05-13 2014-12-30 International Business Machines Corporation Dynamically resizing a networked computing environment to process a workload
US9448849B2 (en) * 2011-08-31 2016-09-20 Oracle International Corporation Preventing oscillatory load behavior in a multi-node distributed system
JP5785050B2 (en) 2011-10-27 2015-09-24 株式会社日立製作所 The information processing system, the power-saving control method, and apparatus
US9870384B2 (en) * 2012-03-30 2018-01-16 International Business Machines Corporation Database system transaction management
US9569275B2 (en) * 2012-05-14 2017-02-14 International Business Machines Corporation Allocation and reservation of virtualization-based resources
US9152458B1 (en) * 2012-08-30 2015-10-06 Google Inc. Mirrored stateful workers
US9164773B2 (en) 2012-09-21 2015-10-20 Dell Products, Lp Deciding booting of a server based on whether its virtual initiator is currently used by another server or not
WO2014052843A1 (en) * 2012-09-28 2014-04-03 Cycle Computing, Inc. Real time optimization of compute infrastructure in a virtualized environment
GB201217571D0 (en) * 2012-10-02 2012-11-14 Ibm System provisioning optimization
US8874754B2 (en) 2012-10-16 2014-10-28 Softwin Srl Romania Load balancing in handwritten signature authentication systems
CN103780646B (en) * 2012-10-22 2017-04-12 中国长城计算机深圳股份有限公司 Scheduling method and system for cloud resources
US20150355943A1 (en) * 2014-06-05 2015-12-10 International Business Machines Corporation Weighted stealing of resources
US20160154673A1 (en) * 2014-07-23 2016-06-02 Sitting Man, Llc Methods, systems, and computer program products for providing a minimally complete operating environment
US9361154B2 (en) 2014-09-30 2016-06-07 International Business Machines Corporation Tunable computerized job scheduling
US9430750B2 (en) 2014-10-27 2016-08-30 International Business Machines Corporation Predictive approach to environment provisioning
US9830566B1 (en) 2014-11-10 2017-11-28 Turbonomic, Inc. Managing resources in computer systems using action permits
US9747136B2 (en) * 2014-12-09 2017-08-29 Vmware, Inc. Methods and systems that allocate cost of cluster resources in virtual data centers
US10009234B2 (en) 2015-11-19 2018-06-26 International Business Machines Corporation Predictive modeling of risk for services in a computing environment
CN107222426A (en) * 2016-03-21 2017-09-29 阿里巴巴集团控股有限公司 Traffic control method, device and system
US20180024771A1 (en) * 2016-07-22 2018-01-25 Intel Corporation Storage Sled and Techniques for a Data Center

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6496566B1 (en) * 2000-09-29 2002-12-17 Lucent Technologies Inc. Metallic testing of a subscriber loop that provides both voice and digital subscriber line services
US6587938B1 (en) * 1999-09-28 2003-07-01 International Business Machines Corporation Method, system and program products for managing central processing unit resources of a computing environment
US20030233446A1 (en) * 2002-06-12 2003-12-18 Earl William J. System and method for managing a distributed computing system
US6771661B1 (en) * 1999-07-21 2004-08-03 Cisco Technology, Inc. Apparatus and methods for providing event-based data communications device configuration
US20040205101A1 (en) * 2003-04-11 2004-10-14 Sun Microsystems, Inc. Systems, methods, and articles of manufacture for aligning service containers

Family Cites Families (190)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5175800A (en) 1987-03-23 1992-12-29 Case Group Plc Expert and data base system and method for communications network
WO1991017507A1 (en) 1990-05-07 1991-11-14 Mitsubishi Denki Kabushiki Kaisha Parallel data processing system
JPH05173989A (en) 1991-12-24 1993-07-13 Kawasaki Steel Corp Computer and multiprocessor computation device
US6021425A (en) 1992-04-03 2000-02-01 International Business Machines Corporation System and method for optimizing dispatch latency of tasks in a data processing system
US5504894A (en) 1992-04-30 1996-04-02 International Business Machines Corporation Workload manager for achieving transaction class response time goals in a multiprocessing system
JPH0836513A (en) * 1993-12-29 1996-02-06 Xerox Corp Data managing method and data management error recovering method
US5473773A (en) 1994-04-04 1995-12-05 International Business Machines Corporation Apparatus and method for managing a data processing system workload according to two or more distinct processing goals
JPH09505681A (en) * 1994-05-10 1997-06-03 シーメンス アクチエンゲゼルシヤフト Data management system in a real-time system
US5550970A (en) 1994-08-31 1996-08-27 International Business Machines Corporation Method and system for allocating resources
US6330583B1 (en) 1994-09-09 2001-12-11 Martin Reiffin Computer network of interactive multitasking computers for parallel processing of network subtasks concurrently with local tasks
US5603029A (en) * 1995-06-07 1997-02-11 International Business Machines Corporation System of assigning work requests based on classifying into an eligible class where the criteria is goal oriented and capacity information is available
US6282561B1 (en) 1995-12-07 2001-08-28 Microsoft Corporation Method and system for resource management with independent real-time applications on a common set of machines
US6003061A (en) 1995-12-07 1999-12-14 Microsoft Corporation Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider
US5958003A (en) * 1996-02-21 1999-09-28 International Business Machines Corporation Method and computer system for improving the response time of a computer system to a user request
US5826082A (en) * 1996-07-01 1998-10-20 Sun Microsystems, Inc. Method for reserving resources
US6101508A (en) 1997-08-01 2000-08-08 Hewlett-Packard Company Clustered file management for network resources
US6067545A (en) 1997-08-01 2000-05-23 Hewlett-Packard Company Resource rebalancing in networked computer systems
US6886035B2 (en) 1996-08-02 2005-04-26 Hewlett-Packard Development Company, L.P. Dynamic load balancing of a network of client and server computer
US5918017A (en) 1996-08-23 1999-06-29 Internatioinal Business Machines Corp. System and method for providing dynamically alterable computer clusters for message routing
US6212542B1 (en) 1996-12-16 2001-04-03 International Business Machines Corporation Method and system for executing a program within a multiscalar processor by processing linked thread descriptors
US6317774B1 (en) 1997-01-09 2001-11-13 Microsoft Corporation Providing predictable scheduling of programs using a repeating precomputed schedule
US6571215B1 (en) * 1997-01-21 2003-05-27 Microsoft Corporation System and method for generating a schedule based on resource assignments
US6330008B1 (en) 1997-02-24 2001-12-11 Torrent Systems, Inc. Apparatuses and methods for monitoring performance of parallel computing
CA2236285C (en) 1997-05-08 2003-09-16 Hitachi Ltd. Network and switching node in which resource can be reserved
US6366945B1 (en) 1997-05-23 2002-04-02 Ibm Corporation Flexible dynamic partitioning of resources in a cluster computing environment
US5920863A (en) * 1997-05-31 1999-07-06 International Business Machines Corporation System and method for supporting transactions for a thin client lacking a persistent store in a distributed object-oriented environment
US5933417A (en) 1997-06-16 1999-08-03 General Datacomm, Inc. Multimedia multipoint telecommunications reservation acceptance systems and controllers
WO1999005593A1 (en) 1997-07-25 1999-02-04 British Telecommunications Public Limited Company Software system generation
US6665869B1 (en) 1997-09-05 2003-12-16 United Video Properties, Inc. Program guide application interface system
US6098090A (en) 1997-09-05 2000-08-01 Novell, Inc. Methods and system for providing a background processing thread which manages the background tasks of external threads
US6334114B1 (en) * 1997-10-31 2001-12-25 Oracle Corporation Method and apparatus for performing transactions in a stateless web environment which supports a declarative paradigm
US6370154B1 (en) 1997-12-30 2002-04-09 Alcatel Usa Sourcing, L.P. Telecommunications system craft interface device with broadband end-to-end cross-connect capability
US6088718A (en) * 1998-01-15 2000-07-11 Microsoft Corporation Methods and apparatus for using resource transition probability models for pre-fetching resources
US6105122A (en) * 1998-02-06 2000-08-15 Ncr Corporation I/O protocol for highly configurable multi-node processing system
US6076174A (en) 1998-02-19 2000-06-13 United States Of America Scheduling framework for a heterogeneous computer network
US6529932B1 (en) * 1998-04-01 2003-03-04 Microsoft Corporation Method and system for distributed transaction processing with asynchronous message delivery
US6333936B1 (en) 1998-04-29 2001-12-25 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for allocating processing resources
US6154778A (en) * 1998-05-19 2000-11-28 Hewlett-Packard Company Utility-based multi-category quality-of-service negotiation in distributed systems
US6418459B1 (en) * 1998-06-09 2002-07-09 Advanced Micro Devices, Inc. Isochronous task scheduling structure for a non-real-time operating system
US6526442B1 (en) 1998-07-07 2003-02-25 Compaq Information Technologies Group, L.P. Programmable operational system for managing devices participating in a network
US6298352B1 (en) 1998-07-23 2001-10-02 Mci Communications Corporation Apparatus and method for managing number sources
JP3224782B2 (en) * 1998-08-03 2001-11-05 インターナショナル・ビジネス・マシーンズ・コーポレーション Processing sharing dynamic change methods and computer
WO2000008820A1 (en) 1998-08-04 2000-02-17 At & T Corp. Method for establishing call state information
US7017156B1 (en) * 1998-08-28 2006-03-21 Oracle International Corporation System for computing an estimate execution time by totaling the time value base on an architecture or a software operating environment
US6167445A (en) 1998-10-26 2000-12-26 Cisco Technology, Inc. Method and apparatus for defining and implementing high-level quality of service policies in computer networks
US7386586B1 (en) * 1998-12-22 2008-06-10 Computer Associates Think, Inc. System for scheduling and monitoring computer processes
US6564261B1 (en) 1999-05-10 2003-05-13 Telefonaktiebolaget Lm Ericsson (Publ) Distributed system to intelligently establish sessions between anonymous users over various networks
US6519571B1 (en) 1999-05-27 2003-02-11 Accenture Llp Dynamic customer profile management
US6463454B1 (en) 1999-06-17 2002-10-08 International Business Machines Corporation System and method for integrated load distribution and resource management on internet environment
US7346677B1 (en) 1999-07-02 2008-03-18 Cisco Technology, Inc. Method and apparatus for creating policies for policy-based management of quality of service treatments of network data traffic flows
US6687257B1 (en) 1999-08-12 2004-02-03 Rockwell Automation Technologies, Inc. Distributed real-time operating system providing dynamic guaranteed mixed priority scheduling for communications and processing
US6374297B1 (en) 1999-08-16 2002-04-16 International Business Machines Corporation Method and apparatus for load balancing of web cluster farms
US6690400B1 (en) 1999-09-29 2004-02-10 Flash Vos, Inc. Graphic user interface for resources management of super operating system based computers
US6725456B1 (en) * 1999-11-29 2004-04-20 Lucent Technologies Inc. Methods and apparatus for ensuring quality of service in an operating system
US7003414B1 (en) 1999-11-30 2006-02-21 Agilent Technologies, Inc. Monitoring system and method implementing failure time spectrum scan
US6590587B1 (en) 1999-11-30 2003-07-08 Agilent Technologies, Inc. Monitoring system and method implementing navigation interface logic
US6662219B1 (en) 1999-12-15 2003-12-09 Microsoft Corporation System for determining at subgroup of nodes relative weight to represent cluster by obtaining exclusive possession of quorum resource
US6938256B2 (en) 2000-01-18 2005-08-30 Galactic Computing Corporation System for balance distribution of requests across multiple servers using dynamic metrics
US7140020B2 (en) * 2000-01-28 2006-11-21 Hewlett-Packard Development Company, L.P. Dynamic management of virtual partition computer workloads through service level optimization
US6594799B1 (en) * 2000-02-28 2003-07-15 Cadence Design Systems, Inc. Method and system for facilitating electronic circuit and chip design using remotely located resources
US20020120741A1 (en) 2000-03-03 2002-08-29 Webb Theodore S. Systems and methods for using distributed interconnects in information management enviroments
US20020065864A1 (en) * 2000-03-03 2002-05-30 Hartsell Neal D. Systems and method for resource tracking in information management environments
US7111297B1 (en) * 2000-05-02 2006-09-19 Microsoft Corporation Methods and architectures for resource management
US7058947B1 (en) 2000-05-02 2006-06-06 Microsoft Corporation Resource manager architecture utilizing a policy manager
US6985937B1 (en) 2000-05-11 2006-01-10 Ensim Corporation Dynamically modifying the resources of a virtual server
US6975609B1 (en) 2000-05-30 2005-12-13 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic call admission
US7423971B1 (en) 2000-05-31 2008-09-09 Cisco Technology, Inc. Method and apparatus providing automatic RESV message generation for non-RESV-capable network devices
US6925431B1 (en) 2000-06-06 2005-08-02 Microsoft Corporation Method and system for predicting communication delays of detailed application workloads
WO2002008870A3 (en) * 2000-07-26 2003-04-24 David Dickenson Distributive access controller
US6963537B2 (en) * 2000-07-27 2005-11-08 Corrigent Systems Ltd. Resource reservation in a ring network
US20020087699A1 (en) 2000-07-31 2002-07-04 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic QoS management in differentiated services using bandwidth brokers, RSVP aggregation and load control protocols
US7366134B2 (en) 2001-08-17 2008-04-29 Comsat Corporation Dynamic allocation of network resources in a multiple-user communication system
US7403994B1 (en) 2000-08-29 2008-07-22 International Business Machines Corporation Method of doing business over a network by transmission and retransmission of digital information on a network during time slots
US7596784B2 (en) 2000-09-12 2009-09-29 Symantec Operating Corporation Method system and apparatus for providing pay-per-use distributed computing resources
US6625406B2 (en) 2000-09-14 2003-09-23 Konica Corporation Image forming system wherein an image input to one of the plurality of image forming apparatus is output by the plurality of image forming apparatus
US6760306B1 (en) 2000-09-27 2004-07-06 Nortel Networks Limited Method for reserving network resources using a hierarchical/segment tree for starting and ending times of request
US7058951B2 (en) * 2000-11-06 2006-06-06 Koninklijke Philips Electronics N.V. Method and a system for allocation of a budget to a task
US7296268B2 (en) 2000-12-18 2007-11-13 Microsoft Corporation Dynamic monitor and controller of availability of a load-balancing cluster
US7191244B2 (en) 2001-01-19 2007-03-13 Streamworks Technologies, Inc. System and method for routing media
US6985955B2 (en) 2001-01-29 2006-01-10 International Business Machines Corporation System and method for provisioning resources to users based on roles, organizational information, attributes and third-party information or authorizations
JP2002245282A (en) 2001-02-19 2002-08-30 Hitachi Ltd Method for providing information processing service, and method for controlling information processing resource
EP1365328B1 (en) 2001-02-28 2013-09-04 Fujitsu Limited Method for executing parallel process, and multi-processor computer
US7054936B2 (en) 2001-03-12 2006-05-30 Hrl Laboratories, Llc Priority-based dynamic resource allocation method and apparatus for supply-demand systems
US7197561B1 (en) 2001-03-28 2007-03-27 Shoregroup, Inc. Method and apparatus for maintaining the status of objects in computer networks using virtual state machines
US20040030741A1 (en) 2001-04-02 2004-02-12 Wolton Richard Ernest Method and apparatus for search, visual navigation, analysis and retrieval of information from networks with remote notification and content delivery
US6948171B2 (en) 2001-04-16 2005-09-20 International Business Machines Corporation Apparatus, system and method for active scheduling of time based event-driven long running processes
US7281043B1 (en) 2001-05-31 2007-10-09 Cisco Technology, Inc. System for sharing resources among RSVP sessions
US7386850B2 (en) * 2001-06-01 2008-06-10 Avaya Technology Corp. Arrangement for scheduling tasks based on probability of availability of resources at a future point in time
US7237243B2 (en) * 2001-06-11 2007-06-26 Microsoft Corporation Multiple device management method and system
US8782254B2 (en) 2001-06-28 2014-07-15 Oracle America, Inc. Differentiated quality of service context assignment and propagation
US20030005130A1 (en) 2001-06-29 2003-01-02 Cheng Doreen Yining Audio-video management in UPnP
US7035230B1 (en) 2001-07-11 2006-04-25 Cisco Technology, Inc. System and method for bandwidth and conference resource reservation
US7065764B1 (en) * 2001-07-20 2006-06-20 Netrendered, Inc. Dynamically allocated cluster system
US6912533B1 (en) 2001-07-31 2005-06-28 Oracle International Corporation Data mining agents for efficient hardware utilization
US7174379B2 (en) * 2001-08-03 2007-02-06 International Business Machines Corporation Managing server resources for hosted applications
EP1283466A1 (en) 2001-08-06 2003-02-12 Hewlett-Packard Company (a Delaware corporation) Management system for a cluster
US7236915B2 (en) 2001-08-09 2007-06-26 Hewlett-Packard Development Company, L.P. Technique and interface for computer system resource assignment
US6839662B2 (en) * 2001-08-17 2005-01-04 Lockheed Martin Corporation Command and control system architecture for convenient upgrading
US7660887B2 (en) * 2001-09-07 2010-02-09 Sun Microsystems, Inc. Systems and methods for providing dynamic quality of service for a distributed system
US7412492B1 (en) * 2001-09-12 2008-08-12 Vmware, Inc. Proportional share resource allocation with reduction of unproductive resource consumption
US20030061262A1 (en) 2001-09-25 2003-03-27 Hahn Stephen C. Method and apparatus for partitioning resources within a computer system
US20030061260A1 (en) 2001-09-25 2003-03-27 Timesys Corporation Resource reservation and priority management
US6966033B1 (en) 2001-09-28 2005-11-15 Emc Corporation Methods and apparatus for graphically managing resources
US20030069974A1 (en) * 2001-10-08 2003-04-10 Tommy Lu Method and apparatus for load balancing web servers and virtual web servers
WO2003038563A3 (en) * 2001-11-01 2003-07-31 Thomson Licensing Sa Specific internet user target advertising replacement method and system
US7191143B2 (en) 2001-11-05 2007-03-13 Keli Sev K H Preference information-based metrics
US7177823B2 (en) * 2001-11-06 2007-02-13 International Business Machines Corporation In-queue jobs information monitoring and filtering
US7502747B1 (en) * 2001-11-29 2009-03-10 Microsoft Corporation Automated job scheduling based on resource availability
EP1318453A1 (en) 2001-12-07 2003-06-11 Hewlett-Packard Company Scheduling system, method and apparatus for a cluster
CA2365729A1 (en) 2001-12-20 2003-06-20 Platform Computing (Barbados) Inc. Topology aware scheduling for a multiprocessor system
US20030135615A1 (en) 2001-12-31 2003-07-17 Wyatt David A. Method for rebalancing resources within a global resource namespace
CA2473003A1 (en) 2002-01-09 2003-07-24 Agilquest Corporation System and method for managing workplace real estate and other resources
US7124410B2 (en) * 2002-01-09 2006-10-17 International Business Machines Corporation Distributed allocation of system hardware resources for multiprocessor systems
US20030135609A1 (en) * 2002-01-16 2003-07-17 Sun Microsystems, Inc. Method, system, and program for determining a modification of a system resource configuration
WO2003067480A1 (en) * 2002-02-07 2003-08-14 Thinkdynamics Inc. Method and system for managing resources in a data center
US7640547B2 (en) * 2002-02-08 2009-12-29 Jpmorgan Chase & Co. System and method for allocating computing resources of a distributed computing system
US7376693B2 (en) 2002-02-08 2008-05-20 Jp Morgan Chase & Company System architecture for distributed computing and method of using the system
US7266823B2 (en) 2002-02-21 2007-09-04 International Business Machines Corporation Apparatus and method of dynamically repartitioning a computer system in response to partition workloads
DE10208432B4 (en) 2002-02-22 2006-06-01 Siemens Ag A method for server-based data processing for a plurality of clients
US20030182425A1 (en) * 2002-03-01 2003-09-25 Docomo Communications Laboratories Usa, Inc. Communication system capable of executing a communication task in a manner adaptable to available distributed resources
US6919896B2 (en) 2002-03-11 2005-07-19 Sony Computer Entertainment Inc. System and method of optimizing graphics processing
US7009991B2 (en) 2002-03-28 2006-03-07 Matisse Networks Reservation-based media access controller and reservation-based optical network
US20040153563A1 (en) * 2002-03-29 2004-08-05 Shay A. David Forward looking infrastructure re-provisioning
JP2003308213A (en) 2002-04-17 2003-10-31 Hitachi Ltd Method and apparatus for job processing and storage management system
US20030216951A1 (en) 2002-05-02 2003-11-20 Roman Ginis Automating resource management for distributed business processes
EP1504343B1 (en) 2002-05-10 2007-09-05 Silicon Graphics, Inc. Real-time storage area network
US20030217129A1 (en) 2002-05-15 2003-11-20 Lucent Technologies Inc. Self-organizing intelligent network architecture and methodology
US6785794B2 (en) * 2002-05-17 2004-08-31 International Business Machines Corporation Differentiated storage resource provisioning
US20030233378A1 (en) 2002-06-13 2003-12-18 International Business Machines Corporation Apparatus and method for reconciling resources in a managed region of a resource management system
US7168049B2 (en) 2002-06-18 2007-01-23 Silicon Graphics, Inc. System and method for allocating computing resources
GB0215118D0 (en) * 2002-06-28 2002-08-07 Hewlett Packard Co Dynamic resource allocation in a multimodal system
US7185046B2 (en) * 2002-08-28 2007-02-27 Sun Microsystems, Inc. Submitting jobs in a distributed computing environment
US7765521B2 (en) * 2002-08-29 2010-07-27 Jeffrey F Bryant Configuration engine
US6829762B2 (en) 2002-10-10 2004-12-07 International Business Machnies Corporation Method, apparatus and system for allocating and accessing memory-mapped facilities within a data processing system
US7617273B2 (en) * 2002-11-15 2009-11-10 Sun Microsystems, Inc. Method and apparatus for providing a unified component architecture for client-side and server-side components
US8489741B2 (en) 2002-11-21 2013-07-16 International Business Machines Corporation Policy enabled grid architecture
US7243352B2 (en) 2002-11-27 2007-07-10 Sun Microsystems, Inc. Distributed process runner
US20040133889A1 (en) * 2002-12-12 2004-07-08 Renzo Colle Scheduling tasks across multiple locations
US7131113B2 (en) 2002-12-12 2006-10-31 International Business Machines Corporation System and method on generating multi-dimensional trace files and visualizing them using multiple Gantt charts
US20060294238A1 (en) 2002-12-16 2006-12-28 Naik Vijay K Policy-based hierarchical management of shared resources in a grid environment
US7243351B2 (en) * 2002-12-17 2007-07-10 International Business Machines Corporation System and method for task scheduling based upon the classification value and probability
US7383550B2 (en) 2002-12-23 2008-06-03 International Business Machines Corporation Topology aware grid services scheduler architecture
US7188174B2 (en) * 2002-12-30 2007-03-06 Hewlett-Packard Development Company, L.P. Admission control for applications in resource utility environments
US7421500B2 (en) 2003-01-10 2008-09-02 Hewlett-Packard Development Company, L.P. Grid computing control system
WO2004063905A3 (en) 2003-01-13 2004-10-28 Innovative System Design Inc Apparatus, method, and article of manufacture for visualizing status in a compute environment
US7222343B2 (en) * 2003-01-16 2007-05-22 International Business Machines Corporation Dynamic allocation of computer resources based on thread type
US7353495B2 (en) * 2003-02-28 2008-04-01 Bea Systems, Inc. Method for protection against interleaving transactions using a transaction manager
US7072807B2 (en) 2003-03-06 2006-07-04 Microsoft Corporation Architecture for distributed computing system and automated design, deployment, and management of distributed applications
US7350186B2 (en) * 2003-03-10 2008-03-25 International Business Machines Corporation Methods and apparatus for managing computing deployment in presence of variable workload
US8018860B1 (en) * 2003-03-12 2011-09-13 Sprint Communications Company L.P. Network maintenance simulator with path re-route prediction
JP3951949B2 (en) 2003-03-31 2007-08-01 日本電気株式会社 Distributed resource management system and the distributed resource management method and program
US8135795B2 (en) 2003-04-03 2012-03-13 International Business Machines Corporation Method to provide on-demand resource access
US7331048B2 (en) 2003-04-04 2008-02-12 International Business Machines Corporation Backfill scheduling of applications based on data of the applications
US7607093B2 (en) 2003-04-04 2009-10-20 Agilent Technologies, Inc. Displaying network segment decode information in diagrammatic form
US7590984B2 (en) * 2003-05-29 2009-09-15 International Business Machines Corporation System and method for balancing a computing load among computing resources in a distributed computing problem
US7107363B2 (en) * 2003-06-19 2006-09-12 International Business Machines Corporation Microprocessor having bandwidth management for computing applications and related method of managing bandwidth allocation
US7146353B2 (en) * 2003-07-22 2006-12-05 Hewlett-Packard Development Company, L.P. Resource allocation for multiple applications
US7546553B2 (en) * 2003-07-28 2009-06-09 Sap Ag Grid landscape component
US7568199B2 (en) * 2003-07-28 2009-07-28 Sap Ag. System for matching resource request that freeing the reserved first resource and forwarding the request to second resource if predetermined time period expired
US7287121B2 (en) 2003-08-27 2007-10-23 Aristos Logic Corporation System and method of establishing and reconfiguring volume profiles in a storage system
US7516455B2 (en) * 2003-09-05 2009-04-07 Microsoft Corporation Probabilistic scheduling
US8051420B2 (en) * 2003-10-31 2011-11-01 Hewlett-Packard Development Company, L.P. Method and system for governing access to computing utilities
US20050108703A1 (en) * 2003-11-18 2005-05-19 Hellier Charles R. Proactive policy-driven service provisioning framework
US7552437B2 (en) * 2004-01-14 2009-06-23 International Business Machines Corporation Maintaining application operations within a suboptimal grid environment
JP2005208707A (en) 2004-01-20 2005-08-04 Fujitsu Ltd Abnormality monitoring device, abnormality search support method, abnormality search support program
WO2005072321A3 (en) 2004-01-23 2006-12-21 Camiant Inc Policy-based admission control and bandwidth reservation for future sessions
US7558864B2 (en) * 2004-01-27 2009-07-07 International Business Machines Corporation Method, system and product for identifying, reserving, and logically provisioning resources in provisioning data processing systems
CN1906600A (en) 2004-01-30 2007-01-31 国际商业机器公司 Hierarchical resource management for a computing utility
JP4867660B2 (en) 2004-01-30 2012-02-01 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Automatic Provisioning and Management are components of the computing environment for a computing utility
US20050172291A1 (en) * 2004-01-30 2005-08-04 Rajarshi Das Method and apparatus for utility-based dynamic resource allocation in a distributed computing system
US20050197877A1 (en) * 2004-03-08 2005-09-08 Ken Kalinoski System and method for scheduling heterogeneous resources
US7665090B1 (en) * 2004-03-08 2010-02-16 Swsoft Holdings, Ltd. System, method, and computer program product for group scheduling of computer resources
US20050256942A1 (en) 2004-03-24 2005-11-17 Mccardle William M Cluster management system and method
US8417499B2 (en) * 2004-03-31 2013-04-09 International Business Machines Corporation Enabling real-time testing of on-demand infrastructure to predict service level agreement compliance
US8041797B2 (en) * 2004-03-31 2011-10-18 International Business Machines Corporation Apparatus and method for allocating resources based on service level agreement predictions and associated costs
US7328406B2 (en) * 2004-04-30 2008-02-05 Tandberg Telecom As System, method and software for managing and publishing resource availability data
US20050278760A1 (en) 2004-06-01 2005-12-15 Don Dewar Method and system for controlling streaming in an on-demand server
WO2006007415A3 (en) 2004-06-16 2006-07-13 Elizabeth Bradley Nonlinear adaptive control of resource-distribution dynamics
US7861246B2 (en) * 2004-06-17 2010-12-28 Platform Computing Corporation Job-centric scheduling in a grid environment
US7844969B2 (en) 2004-06-17 2010-11-30 Platform Computing Corporation Goal-oriented predictive scheduling in a grid environment
US7464160B2 (en) * 2004-06-17 2008-12-09 International Business Machines Corporation Provisioning grid services to maintain service level agreements
JP3892002B2 (en) * 2004-07-01 2007-03-14 株式会社日立製作所 Resource allocation method and program
US9264384B1 (en) 2004-07-22 2016-02-16 Oracle International Corporation Resource virtualization mechanism including virtual host bus adapters
US7853880B2 (en) 2004-07-28 2010-12-14 Hewlett-Packard Development Company, L.P. Displaying network properties in a graphical user interface
US20060097863A1 (en) 2004-10-21 2006-05-11 Eric Horowitz Tracking equipment
US7433931B2 (en) * 2004-11-17 2008-10-07 Raytheon Company Scheduling in a high-performance computing (HPC) system
US7565310B2 (en) * 2005-05-04 2009-07-21 International Business Machines Corporation Method and system and program product for a design pattern for automating service provisioning
US20060271552A1 (en) 2005-05-26 2006-11-30 Venture Capital & Consulting Group, Llc. Targeted delivery of content
US7716193B2 (en) * 2005-10-13 2010-05-11 Oracle International Corporation Ensuring timely servicing of desired transactions in a database server
US20080184248A1 (en) * 2007-01-29 2008-07-31 Yahoo! Inc. Optimization of job scheduling for resource clusters with access control and usage reporting

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6771661B1 (en) * 1999-07-21 2004-08-03 Cisco Technology, Inc. Apparatus and methods for providing event-based data communications device configuration
US6587938B1 (en) * 1999-09-28 2003-07-01 International Business Machines Corporation Method, system and program products for managing central processing unit resources of a computing environment
US6496566B1 (en) * 2000-09-29 2002-12-17 Lucent Technologies Inc. Metallic testing of a subscriber loop that provides both voice and digital subscriber line services
US20030233446A1 (en) * 2002-06-12 2003-12-18 Earl William J. System and method for managing a distributed computing system
US20040205101A1 (en) * 2003-04-11 2004-10-14 Sun Microsystems, Inc. Systems, methods, and articles of manufacture for aligning service containers

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8060883B1 (en) * 2007-02-16 2011-11-15 Vmware, Inc. System for managing and providing expandable resource reservations in a tree hierarchy
US20090025004A1 (en) * 2007-07-16 2009-01-22 Microsoft Corporation Scheduling by Growing and Shrinking Resource Allocation
US9069610B2 (en) 2010-10-13 2015-06-30 Microsoft Technology Licensing, Llc Compute cluster with balanced resources
US9800655B2 (en) * 2011-01-03 2017-10-24 Micro Focus Software Inc. Policy and identity based workload provisioning
US20140359132A1 (en) * 2011-01-03 2014-12-04 Novell, Inc. Policy and identity based workload provisioning
US20130060933A1 (en) * 2011-09-07 2013-03-07 Teresa Tung Cloud service monitoring system
US9985847B2 (en) 2011-09-07 2018-05-29 Accenture Global Services Limited Cloud service monitoring system
US8612599B2 (en) * 2011-09-07 2013-12-17 Accenture Global Services Limited Cloud service monitoring system
US9384056B2 (en) * 2012-09-11 2016-07-05 Red Hat Israel, Ltd. Virtual resource allocation and resource and consumption management
US20140075029A1 (en) * 2012-09-11 2014-03-13 Maor Lipchuk Virtual resource allocation and resource and consumption management
WO2016054382A1 (en) * 2014-10-03 2016-04-07 SorsEm, LLC Resource allocation methods and apparatus

Also Published As

Publication number Publication date Type
US9069611B2 (en) 2015-06-30 grant
EP2357561A1 (en) 2011-08-17 application
US8370898B1 (en) 2013-02-05 grant
US8037475B1 (en) 2011-10-11 grant
US20150286502A1 (en) 2015-10-08 application
US20180054364A1 (en) 2018-02-22 application
US9135066B2 (en) 2015-09-15 grant
US8984524B2 (en) 2015-03-17 grant
US20130086588A1 (en) 2013-04-04 application
EP1763778A2 (en) 2007-03-21 application
CA2570476A1 (en) 2006-01-26 application
WO2006009827A2 (en) 2006-01-26 application
EP1763778A4 (en) 2008-12-17 application
US20130145029A1 (en) 2013-06-06 application
US20120030685A1 (en) 2012-02-02 application
US9491064B2 (en) 2016-11-08 grant
US9537726B2 (en) 2017-01-03 grant
US8321871B1 (en) 2012-11-27 grant
WO2006009827A3 (en) 2006-06-08 application
US20150381436A1 (en) 2015-12-31 application

Similar Documents

Publication Publication Date Title
Bittencourt et al. Scheduling in hybrid clouds
US6584489B1 (en) Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider
US7093250B1 (en) Priority scheduler for database access
US20100100877A1 (en) Statistical packing of resource requirements in data centers
US20090241117A1 (en) Method for integrating flow orchestration and scheduling for a batch of workflows
US7694082B2 (en) Computer program and method for managing resources in a distributed storage system
US20090199193A1 (en) System and method for managing a hybrid compute environment
US20080104605A1 (en) Methods and apparatus for dynamic placement of heterogeneous workloads
US20040205206A1 (en) System for managing and controlling storage access requirements
Doulamis et al. Fair scheduling algorithms in grids
Elmroth et al. Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions
US20050246705A1 (en) Method for dynamically allocating and managing resources in a computerized system having multiple consumers
US20090254660A1 (en) Systems and methods for coordinated management of power usage and runtime performance in performance-managed computing environments
US20050097560A1 (en) Method and system for governing access to computing utilities
US20110154353A1 (en) Demand-Driven Workload Scheduling Optimization on Shared Computing Resources
US20060277307A1 (en) Method for allocating shared computing infrastructure for application server-based deployments
Mateescu et al. Hybrid computing—where HPC meets grid and cloud computing
Singh et al. Optimizing grid-based workflow execution
US20110067030A1 (en) Flow based scheduling
US20120072762A1 (en) Methods and systems for dynamically managing requests for computing capacity
US20050138175A1 (en) Method and system using admission control in interactive grid computing systems
Yu et al. Cost-based scheduling of scientific workflow applications on utility grids
US20110055605A1 (en) System and method for managing energy consumption in a compute environment
US20110173637A1 (en) Managing private use of program execution capacity
US8904008B2 (en) Assignment of resources in virtual machine pools

Legal Events

Date Code Title Description
AS Assignment

Owner name: CLUSTER RESOURCES, INC., UTAH

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JACKSON, DAVID B.;REEL/FRAME:016741/0551

Effective date: 20050616