利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

17 条记录 (耗时 0.022 秒)

    Recovery segments
    2.
    发明授权
    Recovery segments 有权
    恢复细分

    公开(公告)号：US08909987B2

    公开(公告)日：2014-12-09

    申请号：US13458680

    申请日：2012-04-27

    申请人： Alan H. Karp ,  Dhruva Chakrabarti ,  Wojciech Golab ,  Terence P. Kelly

    发明人： Alan H. Karp ,  Dhruva Chakrabarti ,  Wojciech Golab ,  Terence P. Kelly

    IPC分类号： G06F11/00

    CPC分类号： G06F11/1482 ,  G06F11/1438 ,  G06F2201/82

    摘要： In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message.

    摘要翻译： 在一个示例中，用于实现恢复段的方法包括将由第一计算设备执行的父进程的应用消息发送到由第二计算设备执行的子进程，并识别由应用消息创建的依赖关系。 这个确定的依赖项被包含在子进程的依赖集中并被保存。 检查点由父进程生成，并且包含依赖关系信息的检查点消息从父进程发送到子进程。 子进程根据依赖关系信息修改依赖关系，并生成保存在第二计算装置的非易失性存储器中的第二检查点。 在发生父进程失败时，子进程恢复到由子进程生成的最新检查点，该检查点不包括处理孤立消息的效果。

    RECOVERY SEGMENTS
    3.
    发明申请
    RECOVERY SEGMENTS 有权
    恢复部分

    公开(公告)号：US20130290780A1

    公开(公告)日：2013-10-31

    申请号：US13458680

    申请日：2012-04-27

    申请人： Alan H. Karp. ,  Dhruva Chakrabarti ,  Wojciech Golab ,  Terence P. Kelly

    发明人： Alan H. Karp. ,  Dhruva Chakrabarti ,  Wojciech Golab ,  Terence P. Kelly

    IPC分类号： G06F11/14

    CPC分类号： G06F11/1482 ,  G06F11/1438 ,  G06F2201/82

    摘要： In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message.

    摘要翻译： 在一个示例中，用于实现恢复段的方法包括将由第一计算设备执行的父进程的应用消息发送到由第二计算设备执行的子进程，并识别由应用消息创建的依赖关系。 这个确定的依赖项被包含在子进程的依赖集中并被保存。 检查点由父进程生成，并且包含依赖关系信息的检查点消息从父进程发送到子进程。 子进程根据依赖关系信息修改依赖关系，并生成保存在第二计算装置的非易失性存储器中的第二检查点。 在发生父进程失败时，子进程恢复到由子进程生成的最新检查点，该检查点不包括处理孤立消息的效果。

    SHIFTABLE MEMORY
    4.
    发明申请
    SHIFTABLE MEMORY 有权

    公开(公告)号：US20140126309A1

    公开(公告)日：2014-05-08

    申请号：US14126732

    申请日：2011-06-28

    申请人： Terence P. Kelly ,  Alan L. David ,  Matthew D. Pickett

    发明人： Terence P. Kelly ,  Alan L. David ,  Matthew D. Pickett

    IPC分类号： G11C7/10

    CPC分类号： G11C7/1006 ,  G11C8/04 ,  G11C8/10 ,  G11C8/12 ,  G11C19/28 ,  G11C19/287

    摘要： A shiftable memory is employed in a system and a method to shift a contiguous subset of stored data within the shiftable memory. The shiftable memory includes a memory having built-in shifting capability to shift a contiguous subset of data stored by the memory from a first location to a second location within the memory. The contiguous subset has a size that is smaller than a total size of the memory. The system further includes a processor to provide an address and the length of the contiguous subset. The method includes selecting the contiguous subset of data and shifting the selected contiguous subset.

    摘要翻译： 在可移动存储器中使用可移位存储器和用于移位存储数据的连续子集的方法。 可移位存储器包括具有内置移位能力的存储器，用于将存储器存储的数据的连续子集从第一位置移动到存储器内的第二位置。 连续子集的大小小于存储器的总大小。 该系统还包括处理器，用于提供连续子集的地址和长度。 该方法包括选择连续的数据子集并移动所选择的连续子集。

    Scheduling computer processing jobs that have stages and precedence constraints among the stages
    5.
    发明授权
    Scheduling computer processing jobs that have stages and precedence constraints among the stages 有权
    调度在阶段之间具有阶段和优先级约束的计算机处理作业

    公开(公告)号：US08281313B1

    公开(公告)日：2012-10-02

    申请号：US11241720

    申请日：2005-09-29

    申请人： Cipriano A. Santos ,  Dirk Beyer ,  Yunhong Zhou ,  Terence P. Kelly

    发明人： Cipriano A. Santos ,  Dirk Beyer ,  Yunhong Zhou ,  Terence P. Kelly

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5038 ,  G06F2209/506

    摘要： An embodiment of a method of scheduling computer processing begins with a first step of receiving job properties for a plurality of jobs to be processed in a multi-processor computing environment. At least some of the jobs each comprise a plurality of stages, one or more tasks for each stage, and precedence constraints among the stages. The method continues with a second step of determining a schedule for processing at least a subset of the plurality of jobs on processors within the multi-processor computing environment from a solution of a mathematical program that provides a near maximal completion reward. The schedule comprises a sequence of tasks for each processor. In a third step, the computer processing jobs are processed on the processors according to the sequence of tasks for each processor.

    摘要翻译： 调度计算机处理方法的一个实施例开始于在多处理器计算环境中接收要处理的多个作业的作业属性的第一步骤。 至少一些作业各自包括多个阶段，每个阶段的一个或多个任务以及阶段之间的优先约束。 该方法继续第二步骤，从提供接近最大完成奖励的数学程序的解决方案确定用于处理多处理器计算环境中的处理器上的多个作业的至少一个子集的调度表。 该计划包括每个处理器的一系列任务。 在第三步骤中，根据每个处理器的任务顺序在处理器上处理计算机处理作业。

    Method of allocating computing resources
    8.
    发明授权
    Method of allocating computing resources 有权
    分配计算资源的方法

    公开(公告)号：US07844967B2

    公开(公告)日：2010-11-30

    申请号：US10850318

    申请日：2004-05-19

    申请人： Terence P. Kelly

    发明人： Terence P. Kelly

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5061

    摘要： An embodiment of a method of allocating computing resources begins with a first step of identifying applications which comprise candidates for execution on a shared computing system. In a second step, the method identifies at least one subset of the computing resources for each application. Each subset for a particular application comprises sufficient resources to support the particular application. The method continues with a third step of assigning a value to each subset. The method concludes with a fourth step of determining an assignment of the computing resources to the applications which provides a near maximal overall value.

    摘要翻译： 分配计算资源的方法的实施例从识别包括在共享计算系统上执行的候选的应用的第一步骤开始。 在第二步中，该方法识别每个应用的计算资源的至少一个子集。 用于特定应用的每个子集包括足以支持特定应用的资源。 该方法继续为向每个子集分配值的第三步骤。 该方法的结论是确定计算资源对于提供接近最大总体值的应用的分配的第四步骤。

    Shiftable memory
    9.
    发明授权
    Shiftable memory 有权
    可移动内存

    公开(公告)号：US09390773B2

    公开(公告)日：2016-07-12

    申请号：US14126732

    申请日：2011-06-28

    申请人： Terence P. Kelly ,  Alan L. Davis ,  Matthew D. Pickett

    发明人： Terence P. Kelly ,  Alan L. Davis ,  Matthew D. Pickett

    IPC分类号： G11C7/00 ,  G11C7/10 ,  G11C19/28 ,  G11C8/04 ,  G11C8/10 ,  G11C8/12

    CPC分类号： G11C7/1006 ,  G11C8/04 ,  G11C8/10 ,  G11C8/12 ,  G11C19/28 ,  G11C19/287

    摘要： A shiftable memory is employed in a system and a method to shift a contiguous subset of stored data within the shiftable memory. The shiftable memory includes a memory having built-in shifting capability to shift a contiguous subset of data stored by the memory from a first location to a second location within the memory. The contiguous subset has a size that is smaller than a total size of the memory. The system further includes a processor to provide an address and the length of the contiguous subset. The method includes selecting the contiguous subset of data and shifting the selected contiguous subset.

    摘要翻译： 在可移动存储器中使用可移位存储器和用于移位存储数据的连续子集的方法。 可移位存储器包括具有内置移位能力的存储器，用于将存储器存储的数据的连续子集从第一位置移动到存储器内的第二位置。 连续子集的大小小于存储器的总大小。 该系统还包括处理器，用于提供连续子集的地址和长度。 该方法包括选择连续的数据子集并移动所选择的连续子集。

    Process for preparing substituted aromatic carboxylic acids
    10.
    发明授权
    Process for preparing substituted aromatic carboxylic acids 有权
    制备取代芳族羧酸的方法

    公开(公告)号：US08710260B2

    公开(公告)日：2014-04-29

    申请号：US12719257

    申请日：2010-03-08

    申请人： Crist N. Filer ,  Terence P. Kelly ,  Chrisopher Wright

    发明人： Crist N. Filer ,  Terence P. Kelly ,  Chrisopher Wright

    IPC分类号： C07C51/16 ,  C07C51/255

    CPC分类号： C07C253/30 ,  C07C255/35 ,  C07C303/22 ,  C07D215/50 ,  C07D217/26 ,  C07C309/58

    摘要： A process for preparing an aromatic carboxylic acid having a heteroatom containing substituent is provided that includes reaction in a vessel of an aromatic precursor having an aromatic core with at least one heteroatom containing substituent and at least one hydrogen extending from the core, with a haloacetonitrile under reaction conditions to form an aromatic acetonitrile with an acetonitrile moiety. The aromatic acetonitrile is exposed to an oxidizing agent under conditions to convert the acetonitrile moiety to a carboxylic acid group to prepare the aromatic carboxylic acid having the heteroatom containing substituent.

    摘要翻译： 提供了一种制备具有含杂原子的取代基的芳族羧酸的方法，其包括在具有芳族核心与至少一个含杂原子的取代基的芳族前体和至少一个从核心延伸的氢的容器中反应， 形成具有乙腈部分的芳族乙腈的反应条件。 在将乙腈部分转化成羧酸基团的条件下，将芳香族乙腈暴露于氧化剂，制备具有含杂原子的取代基的芳族羧酸。