利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

8 条记录 (耗时 0.024 秒)

    Method and system for optimizing data backup
    1.
    发明授权
    Method and system for optimizing data backup 有权
    优化数据备份的方法和系统

    公开(公告)号：US07913047B2

    公开(公告)日：2011-03-22

    申请号：US12221306

    申请日：2008-08-01

    申请人： Scott Erickson ,  Jeffrey M. Jordan ,  William Rothe

    发明人： Scott Erickson ,  Jeffrey M. Jordan ,  William Rothe

    IPC分类号： G06F12/00

    CPC分类号： G06F11/1456 ,  G06F11/1458 ,  G06F11/1461

    摘要： There is provided a method for optimizing a data backup. The method comprising determining a backup project size, the backup project size identifying the quantity of data to be backed up; detecting available recording devices for transferring the data backup to storage media; receiving an input corresponding to at least one user specified optimization variable, wherein the at least one user specified optimization variable comprises an upper limit on the length of each of the calculated plurality of data streams; utilizing the at least one user specified optimization variable to calculate a plurality of data streams for performing the data backup; and assigning subsets of the plurality of data streams to the available recording devices to optimize the data backup.

    摘要翻译： 提供了一种优化数据备份的方法。 该方法包括确定备份项目大小，备份项目大小标识要备份的数据量; 检测用于将数据备份传送到存储介质的可用记录设备; 接收对应于至少一个用户指定的优化变量的输入，其中所述至少一个用户指定的优化变量包括所计算出的多个数据流中的每一个的长度的上限; 利用所述至少一个用户指定的优化变量来计算用于执行所述数据备份的多个数据流; 以及将所述多个数据流的子集分配给所述可用记录装置以优化所述数据备份。

    DYNAMIC ALLOCATION OF COMPUTE RESOURCES
    2.
    发明申请
    DYNAMIC ALLOCATION OF COMPUTE RESOURCES 审中-公开
    计算资源的动态分配

    公开(公告)号：US20130219386A1

    公开(公告)日：2013-08-22

    申请号：US13401786

    申请日：2012-02-21

    申请人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine

    发明人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine

    IPC分类号： G06F9/50 ,  G06F9/455

    CPC分类号： G06F9/5061 ,  G06F9/45558 ,  G06F2009/45562

    摘要： A resource broker determines availability of a portion of a set of compute resources in real-time. The set of compute resources is assigned as a priority to a master process. Further, the resource broker assigns the portion of the set of compute resources to an auxiliary process if the portion of the set of compute resources is available. In addition, the resource broker determines that the master process is attempting to utilize the portion of the set of compute resources. The resource broker also assigns the portion of the set of compute resources to the master process from the auxiliary process without an interruption that exceeds a predetermined time threshold of processing being performed by the master process.

    摘要翻译： 资源代理实时地确定一组计算资源的一部分的可用性。 计算资源集合作为主进程的优先级分配。 此外，如果该组计算资源的部分可用，则资源代理将该组计算资源的一部分分配给辅助进程。 另外，资源代理确定主进程正试图利用该组计算资源的一部分。 资源代理还将辅助处理的计算资源集合的一部分分配给主进程，而不会中断超过由主进程执行的预定时间阈值。

    BATCH SCHEDULER MANAGEMENT OF TASKS
    3.
    发明申请
    BATCH SCHEDULER MANAGEMENT OF TASKS 有权
    任务管理调度员

    公开(公告)号：US20130219395A1

    公开(公告)日：2013-08-22

    申请号：US13401773

    申请日：2012-02-21

    申请人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Henry Allen Driskill

    发明人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Henry Allen Driskill

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5072 ,  G06F2209/504 ,  Y02D10/22

    摘要： A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilized by the client is less than or equal to the predetermined limit, such that the non-speculative task is processed without being preempted by an additional task requested by an additional client. The task is dispatched, from the batch scheduler to the compute node, as a speculative task if the quantity of compute resources is available to process the task, and the quantity of compute resources in addition to the total quantity of compute resources is greater than the predetermined limit.

    摘要翻译： 接收到客户端执行任务的请求。 客户端具有预定的计算资源限制。 如果在计算节点处可用计算资源的数量来处理该任务，以及除计算资源总数之外的计算资源数量，则将任务作为非推测性任务从批处理调度程序分派到计算节点 由客户端使用的小于或等于预定限制，使得非推测性任务被处理而不被附加客户端请求的附加任务抢占。 如果计算资源的数量可用于处理任务，那么从批处理调度程序到计算节点的任务作为推测性任务进行分派，除了计算资源的总数之外，计算资源的数量大于 预定限度。

    FILE MONITORING
    5.
    发明申请
    FILE MONITORING 有权
    文件监控

    公开(公告)号：US20130219049A1

    公开(公告)日：2013-08-22

    申请号：US13401801

    申请日：2012-02-21

    申请人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Thomas Charles Greer

    发明人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Thomas Charles Greer

    IPC分类号： G06F11/00

    CPC分类号： G06F11/3433 ,  G06F11/323 ,  G06F11/3495

    摘要： A server receives a first set of file activity data from a first file monitor. The first set of file activity data indicates activity associated with a first set of files accessed at a first compute node in communication with a network. Further, the server receives a second set of file activity data from a second file monitor. The second set of file activity data indicates activity associated with a second set of files accessed at a second compute node in communication with the network. In addition, the server aggregates the first set of file activity data and the second set of file activity data into an aggregated set of network file activity data.

    摘要翻译： 服务器从第一文件监视器接收第一组文件活动数据。 第一组文件活动数据指示与在与网络通信的第一计算节点处访问的第一组文件相关联的活动。 此外，服务器从第二文件监视器接收第二组文件活动数据。 第二组文件活动数据指示与在与网络通信的第二计算节点处访问的第二组文件相关联的活动。 此外，服务器将第一组文件活动数据和第二组文件活动数据聚合成一组聚合的网络文件活动数据。

    Batch scheduler management of speculative and non-speculative tasks based on conditions of tasks and compute resources
    7.
    发明授权
    Batch scheduler management of speculative and non-speculative tasks based on conditions of tasks and compute resources 有权
    根据任务和计算资源的条件对投机和非投机性任务进行批量调度管理

    公开(公告)号：US09104491B2

    公开(公告)日：2015-08-11

    申请号：US13401773

    申请日：2012-02-21

    申请人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Henry Allen Driskill

    发明人： Jonathan Eric Geibel ,  Jeffrey M. Jordan ,  Scott Lane Burris ,  Kevin Christopher Constantine ,  Henry Allen Driskill

    IPC分类号： G06F9/455 ,  G06F9/50

    CPC分类号： G06F9/5072 ,  G06F2209/504 ,  Y02D10/22

    摘要： A request from a client to perform a task is received. The client has a predetermined limit of compute resources. The task is dispatched from a batch scheduler to a compute node as a non-speculative task if a quantity of compute resources is available at the compute node to process the task, and the quantity of compute resources in addition to a total quantity of compute resources being utilized by the client is less than or equal to the predetermined limit, such that the non-speculative task is processed without being preempted by an additional task requested by an additional client. The task is dispatched, from the batch scheduler to the compute node, as a speculative task if the quantity of compute resources is available to process the task, and the quantity of compute resources in addition to the total quantity of compute resources is greater than the predetermined limit.

    摘要翻译： 接收到客户端执行任务的请求。 客户端具有预定的计算资源限制。 如果在计算节点处可用计算资源的数量来处理该任务，以及除计算资源总数之外的计算资源数量，则将任务作为非推测性任务从批处理调度程序分派到计算节点 由客户端使用的小于或等于预定限制，使得非推测性任务被处理而不被附加客户端请求的附加任务抢占。 如果计算资源的数量可用于处理任务，那么从批处理调度程序到计算节点的任务作为推测性任务进行分派，除了计算资源的总数之外，计算资源的数量大于 预定限度。