会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • RESOURCE RESERVATION FOR MASSIVELY PARALLEL PROCESSING SYSTEMS
    • 资源预留用于大规模并行处理系统
    • US20070255835A1
    • 2007-11-01
    • US11553511
    • 2006-10-27
    • Richard J. CoppingerAlexander DruyanEnci Zhong
    • Richard J. CoppingerAlexander DruyanEnci Zhong
    • G06F15/16G06F15/173
    • G06F9/505
    • Disclosed are a method, information processing system, and computer readable medium for reserving resources in a massively parallel processing system comprising. The method includes receiving a reservation request for reserving at least one resource within a massively parallel processing system. The massively parallel processing system includes compute nodes, base partitions, switches, wires, and node cards. The reservation type associated with the reservation is determined. The reservation type is at least one of a number of compute nodes, a base partition list, a particular shape configuration, a particular job, and a particular partition. A set of requirements is generated based on the reservation type. A set of resources is identified for satisfying the set of requirements and the set of resources is reserved.
    • 公开了一种用于在大规模并行处理系统中预留资源的方法,信息处理系统和计算机可读介质,包括: 该方法包括接收在大规模并行处理系统内保留至少一个资源的预留请求。 大规模并行处理系统包括计算节点,基本分区,交换机,电线和节点卡。 确定与预约相关联的预约类型。 预约类型是多个计算节点,基本分区列表,特定形状配置,特定作业和特定分区中的至少一个。 根据预约类型生成一组要求。 确定一组资源以满足一组要求,并保留一组资源。
    • 3. 发明授权
    • Resource reservation for massively parallel processing systems
    • 大规模并行处理系统的资源预留
    • US07716336B2
    • 2010-05-11
    • US11553511
    • 2006-10-27
    • Richard J. CoppingerAlexander DruyanEnci Zhong
    • Richard J. CoppingerAlexander DruyanEnci Zhong
    • G06F15/173G06F15/16
    • G06F9/505
    • Disclosed are a method, information processing system, and computer readable medium for reserving resources in a massively parallel processing system comprising. The method includes receiving a reservation request for reserving at least one resource within a massively parallel processing system. The massively parallel processing system includes compute nodes, base partitions, switches, wires, and node cards. The reservation type associated with the reservation is determined. The reservation type is at least one of a number of compute nodes, a base partition list, a particular shape configuration, a particular job, and a particular partition. A set of requirements is generated based on the reservation type. A set of resources is identified for satisfying the set of requirements and the set of resources is reserved.
    • 公开了一种用于在大规模并行处理系统中预留资源的方法,信息处理系统和计算机可读介质,包括: 该方法包括接收在大规模并行处理系统内保留至少一个资源的预留请求。 大规模并行处理系统包括计算节点,基本分区,交换机,线路和节点卡。 确定与预约相关联的预约类型。 预约类型是多个计算节点,基本分区列表,特定形状配置,特定作业和特定分区中的至少一个。 根据预约类型生成一组要求。 确定一组资源以满足一组要求,并保留一组资源。
    • 5. 发明授权
    • Job preempt set generation for resource management
    • 用于资源管理的作业抢占集
    • US07920282B2
    • 2011-04-05
    • US11360127
    • 2006-02-23
    • Richard J. CoppingerAlexander Druyan
    • Richard J. CoppingerAlexander Druyan
    • G06F3/12G06F9/46G06F15/16G06F15/167G06F15/173G06K15/00
    • G06F9/4843G06F9/5027G06F2209/5021
    • A method is provided for prioritizing jobs in a computing environment having a plurality of nodes sharing one or more resources. Such method includes, given a job A to be scheduled having certain resource requirements, generating a list P of already scheduled jobs which utilize resources required by job A and which can be preempted by job A. For each resource requirement of job A, an ordered list of jobs which can be preempted by job A is created which is ranked by the applicability of each job in the list relative to resource requirements of job A, so as to provide a plurality of ordered lists, one for each resource requirement. An ordered list L is generated by selecting one of the ordered lists, adding the top-ranked job from that ordered list to list L, then adding the top-ranked job from another one of the ordered lists to list L and so on, by repetitively selecting the top-ranked job from individual ones of all the ordered lists. Finally, a set of jobs to be preempted by job A is selected based on the list L of jobs.
    • 提供了一种用于在具有共享一个或多个资源的多个节点的计算环境中对作业进行优先级排序的方法。 这样的方法包括:给定要具有某些资源需求的作业A,生成利用作业A所需的资源并且可以被作业A抢占的已经调度的作业的列表P.对于作业A的每个资源要求, 创建可以被作业A抢占的作业的列表,其被列为相对于作业A的资源需求的列表中的每个作业的适用性,以便提供多个有序列表,每个资源需求一个。 通过选择一个有序列表来生成有序列表L,将排序最高的作业从该排序列表添加到列表L,然后将排序最高的作业从另一个排序列表添加到列表L,依此类推, 从所有有序列表中的单个作业重复选择排名最高的作业。 最后,根据作业列表L选择要由作业A抢占的一组作业。
    • 9. 发明授权
    • Managing preemption in a parallel computing system
    • 在并行计算系统中管理抢占
    • US08141084B2
    • 2012-03-20
    • US12098868
    • 2008-04-07
    • Richard J. CoppingerDeryck X. HongChulho KimHanhong Xue
    • Richard J. CoppingerDeryck X. HongChulho KimHanhong Xue
    • G06F11/34
    • G06F9/5022G06F9/5077
    • This present invention provides a portable user space application release/reacquire of adapter resources for a given job on a node using information in a network resource table. The information in the network resource table is obtained when a user space application is loaded by some resource manager. The present invention provides a portable solution that will work for any interconnect where adapter resources need to be freed and reacquired without having to write a specific function in the device driver. In the present invention, the preemption request is done on a job basis using a key or “job key” that was previously loaded when the user space application or job originally requested the adapter resources. This is done for each OS instance where the job is run.
    • 本发明提供了使用网络资源表中的信息的便携式用户空间应用程序释放/重新获取节点上的给定作业的适配器资源。 当某个资源管理器加载用户空间应用程序时,获取网络资源表中的信息。 本发明提供一种便携式解决方案,其可适用于任何互连,其中适配器资源需要被释放并重新获取,而不必在设备驱动器中写入特定功能。 在本发明中,使用当用户空间应用或作业最初请求适配器资源时先前加载的密钥或“作业密钥”,在作业基础上完成抢占请求。 这是为运行作业的每个操作系统实例完成的。