公开(公告)号：EP3846045B8

公开(公告)日：2024-05-29

申请号：EP19220089.7

申请日：2019-12-30

IPC: G06F16/21

CPC classification number: G06F16/2358 ,  G06F11/1471 ,  G06F2201/8220130101 ,  G06F2201/8020130101 ,  G06F2201/83520130101 ,  G06F11/1474 ,  G06F16/219

公开(公告)号：EP2521037B1

公开(公告)日：2018-06-27

申请号：EP12178892.1

申请日：2005-01-12

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Chandrasekaran, Sashikanth ,  Kehoe, William F.

IPC: G06F11/14 ,  G06F11/20

CPC classification number: G06F11/2079 ,  G06F11/1471 ,  G06F11/1474 ,  G06F11/2058 ,  G06F11/2069 ,  G06F11/2071 ,  G06F2201/80

Abstract: A method for mirroring data between a plurality of sites comprises: maintaining, at a first site of the plurality of sites, a record that identifies which transactions that have been executed at the first site have had their redo information replicated to the other sites of the plurality of sites; determining a priority value associated with a transaction that is to be performed at the first site, wherein the transaction specifies a modification to a data block; if the priority value is a first value in a set of possible values, then committing the transaction only after the record indicates that redo information associated with the transaction has been replicated to the other sites of the plurality of sites; and if the priority value is a second value in said set of possible values, then committing the transaction even though the record does not indicate that redo information associated with the transaction has been replicated to the other sites of the plurality of sites. The invention also comprises a machine-readable medium.

公开(公告)号：EP3193255A1

公开(公告)日：2017-07-19

申请号：EP17156952.8

申请日：2010-09-23

Applicant: Ab Initio Technology LLC

Inventor： DOUROS, Bryan, Phil ,  ATTERBURY, Matthew, Darcy ,  STANFILL, Craig, W. ,  WHOLEY, Joseph, Skeffington, III. ,  BROMLEY, Mark, H.

IPC: G06F9/46 ,  G06F9/44 ,  G06F11/14

CPC classification number: G06F9/466 ,  G06F9/4494 ,  G06F11/1474

Abstract: A graph-based computation has a plurality of nodes representing graph components connected by one or more links representing data flows between the components. Preparing (110) the computation includes: identifying (602) at least a first set of components (250, 402) to process a plurality of transactions in the computation; and associating (606) with a first transaction a first group of one or more data records and data operations corresponding to the data records, and associating (606) with a second transaction a second group of one or more data records and data operations corresponding to the data records. Executing (112) the computation to process at least the first and second transactions includes delaying execution by the first set of components of a data operation corresponding to an initial data record of the second group until after execution by the first set of components of a data operation corresponding to a final data record of the first group.

Abstract translation: 基于图的计算具有多个节点，这些节点表示通过表示组件之间的数据流的一个或多个链接所连接的图组件。 准备（110）计算包括：识别（602）至少第一组组件（250,402）以处理计算中的多个事务; 以及将对应于所述数据记录的第一组一个或多个数据记录和数据操作与（606）与第一事务相关联，以及将与第二事务相关联的第二组一个或多个数据记录和数据操作 数据记录。 执行（112）计算以至少处理第一和第二事务包括延迟与第二组的初始数据记录对应的数据操作的第一组分量的执行，直到第一组分量的数据执行之后 操作对应于第一组的最终数据记录。

公开(公告)号：EP3172668A1

公开(公告)日：2017-05-31

申请号：EP15745661.7

申请日：2015-07-16

Applicant: Cisco Technology, Inc.

Inventor： KRISHNAMURTHY, Saileshwar ,  KUMAR, Madhu ,  BHAT, Amit

IPC: G06F9/46 ,  G06F11/14

CPC classification number: H04L67/1097 ,  G06F9/466 ,  G06F11/0796 ,  G06F11/1402 ,  G06F11/1438 ,  G06F11/1471 ,  G06F11/1474 ,  G06F2201/805

Abstract: In an embodiment, a method comprises receiving a plurality of source data records from one or more source computers, wherein one or more first source data records are associated with a first source transaction and one or more second source data records are associated with a second source transaction; generating a first derived transaction comprising one or more first derived records based on the plurality of source data records; generating a first transaction mapping between the first derived transaction and the first source transaction; generating a second transaction mapping between the first derived transaction and the second source transaction; determining that the first derived transaction has ended, and in response, committing first derived transaction including the one or more first derived records to a persistent storage; receiving a first ending punctuation associated with the first source transaction, and in response, committing the first source transaction including the one or more first source data records associated with the first source transaction to the persistent storage; after committing the first derived transaction, determining that the second source transaction failed, and in response: determining that the first derived transaction should be regenerated based on the second transaction mapping, and in response, regenerating the first derived transaction.

Abstract translation: 在一个实施例中，一种方法包括从一个或多个源计算机接收多个源数据记录，其中一个或多个第一源数据记录与第一源事务相关联，并且一个或多个第二源数据记录与第二源相关联 交易; 基于所述多个源数据记录生成包括一个或多个第一导出记录的第一导出事务; 在所述第一派生事务和所述第一源事务之间生成第一事务映射; 在所述第一派生事务和所述第二源事务之间生成第二事务映射; 确定第一派生交易已经结束，并且作为响应，将包括一个或多个第一派生记录的第一派生交易提交给持久存储器; 接收与第一源事务相关联的第一结束标点符号，并且作为响应，将包括与第一源事务相关联的一个或多个第一源数据记录的第一源事务提交给持久存储器; 在提交第一派生事务之后，确定第二源事务失败，并作为响应：确定基于第二事务映射重新生成第一派生事务，并且作为响应，重新生成第一派生事务。

公开(公告)号：EP3121722A1

公开(公告)日：2017-01-25

申请号：EP16170847.4

申请日：2007-07-31

Applicant: Chicago Mercantile Exchange

Inventor： CALLAWAY, Paul J. ,  HAGEMANN, III, Robert C. ,  SHETHWALA, Zuber ,  REECE, Troy ,  BAUERSCHMIDT, Paul A. ,  FERRARI, Enrico

IPC: G06F11/16 ,  G06F11/20 ,  G06Q40/00 ,  G06Q40/04

CPC classification number: G06F11/1446 ,  G06F11/1474 ,  G06F11/1641 ,  G06F11/1687 ,  G06F11/1695 ,  G06F11/202 ,  G06F11/2028 ,  G06F11/2038 ,  G06F11/2046 ,  G06F11/2097 ,  G06Q40/00 ,  G06Q40/04

Abstract: Fault tolerant operation is disclosed for a primary match server of a financial exchange using an active copy-cat instance, a.k.a. backup match server, that mirrors operations in the primary match server, but only after those operations have successfully completed in the primary instance. Fault tolerant logic monitors inputs and outputs of the primary match server and gates those inputs to the backup match server once a given input has been processed. The outputs of the backup match server are then compared with the outputs of the primary match server to ensure correct operation. The disclosed embodiments further relate to fault tolerant failover mechanism allowing the backup match server to take over for the primary match server in a fault situation wherein the primary and backup match servers are loosely coupled, i.e. they need not be aware that they are operating in a fault tolerant environment. As such, the primary match server need not be specifically designed or programmed to interact with the fault tolerant mechanisms. Instead, the primary match server need only be designed to adhere to specific basic operating guidelines and shut itself down when it cannot do so. By externally controlling the ability of the primary match server to successfully adhere to its operating guidelines, the fault tolerant mechanisms of the disclosed embodiments can recognize error conditions and easily failover from the primary match server to the backup match server.

Abstract translation: 对于主要匹配服务器，使用活动的copy-cat实例（即备份匹配服务器）来反映容错操作，该活动副本服务器镜像主要匹配服务器中的操作，但仅在主要实例中已成功完成这些操作之后。 容错逻辑监视主要匹配服务器的输入和输出，并且一旦处理了给定的输入，就将这些输入锁定到备份匹配服务器。 然后将备份匹配服务器的输出与主要匹配服务器的输出进行比较，以确保正确的操作。 所公开的实施例还涉及容错故障转移机制，允许备份匹配服务器在主要和备份匹配服务器松耦合的故障情况下接管主要匹配服务器，即，他们不需要意识到它们在 容错环境。 因此，主要匹配服务器不需要特别设计或编程以与容错机制交互。 相反，主要匹配服务器只需要设计为遵守特定的基本操作指南，并在不能这样做时关闭自己。 通过外部控制主要匹配服务器成功遵守其操作指南的能力，所公开实施例的容错机制可以识别错误状况并且容易地从主要匹配服务器故障转移到备份匹配服务器。

公开(公告)号：EP3063631A2

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

申请号：EP14796356.5

申请日：2014-10-27

Applicant: Microsoft Technology Licensing, LLC

Inventor： BRADSHAW, Dexter Paul ,  CELIS, Pedro

IPC: G06F11/14

CPC classification number: G06F11/0793 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/079 ,  G06F11/1441 ,  G06F11/1469 ,  G06F11/1471 ,  G06F11/1474 ,  G06F11/1666 ,  G06F2201/84

Abstract: Crash recovery of a computing system in the context in which the computing system includes a volatile memory which has contents lost due to the crash, an intermediate non-volatile memory that (together with the volatile memory) contributes to the active memory of the computing system, and non-volatile storage. The recovery occurs by identifying pages that were in the volatile memory at the time of the crash. For each of these pages, the recovery determines whether to recover the page into the volatile memory from either the intermediate non-volatile memory or the storage, and then performs the recovery. In embodiments in which access speeds for the intermediate non-volatile memory may be much faster than for the storage, and in which much of the pages to be recovered are recovered from the intermediate non-volatile memory, the recovery time may be reduced.

Abstract translation: 在计算系统包括由于崩溃而丢失内容的易失性存储器的上下文中的计算系统的崩溃恢复，（与易失性存储器一起）的中间非易失性存储器有助于计算系统的活动存储器 ，和非易失性存储。 通过在崩溃时识别易失性存储器中的页面，并且位于中间非易失性存储器中并将这些页面恢复到易失性存储器中来进行恢复。 在中间非易失性存储器的访问速度可能比存储快得多的实施例中，并且其中要从中间非易失性存储器恢复大量的页面的恢复时间可以减少。

公开(公告)号：EP2633423B1

公开(公告)日：2016-05-04

申请号：EP11838404.9

申请日：2011-09-27

Applicant: Microsoft Technology Licensing, LLC

Inventor： KRISHNAPRASAD, Muralidhar ,  PARAMASIVAM, Kartik ,  KATTI, Jayteerth ,  NORI, Anil

IPC: H04L12/58

CPC classification number: H04L65/403 ,  G06F11/1446 ,  G06F11/1474 ,  H04L51/30

Abstract: A messaging entity configured in a memory of first node of a plurality communicatively coupled nodes is disclosed. The nodes are included in a distributed computing system. The messaging entity is configured to operate as a secondary messaging entity in a messaging server for the plurality communicatively coupled nodes. The messaging entity is communicatively couple to a primary messaging entity configured in a memory of a second node of the plurality of nodes. The primary messaging entity is configured to store a message; store a copy of the message. Also, the messaging entity is configured to be promoted to a new primary messaging entity in the event of failure of the primary messaging entity.

公开(公告)号：EP2977907A1

公开(公告)日：2016-01-27

申请号：EP13878987.0

申请日：2013-12-12

Applicant: Fujitsu Ten Limited ,  Toyota Jidosha Kabushiki Kaisha

Inventor： NAKASO, Yoshiaki ,  ANDO, Yuko ,  SUZUKI, Ryoh ,  KITAORI, Ichiro ,  WADA, Ryuichi

IPC: G06F12/16

CPC classification number: G06F3/0652 ,  G06F3/0619 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0679 ,  G06F11/1441 ,  G06F11/1474

Abstract: A memory having a plurality of storage blocks, and a memory control unit, are included, and each of the storage blocks is partitioned into a management data area and an actual data area. The management data area stores therein writing-in-progress management data indicating that writing of actual data has started, validity management data indicating that the writing of the actual data has been completed, and pre-erasure management data indicating that stored actual data have been brought into an erasable state. The memory control unit determines, based on a storage state of the management data, a storage block storing therein the latest data.

公开(公告)号：EP2975517A2

公开(公告)日：2016-01-20

申请号：EP15174627.8

申请日：2015-06-30

Applicant: BULL SAS

Inventor： LECOURTIER, Georges

IPC: G06F9/48 ,  G06F11/16

CPC classification number: G06F11/1474 ,  G06F9/4887 ,  G06F11/1484 ,  G06F11/1687 ,  G06F11/1691 ,  G06F11/2015 ,  G06F11/2028 ,  G06F11/2038 ,  G06F11/2046 ,  G06F11/2097 ,  G06F2201/87

Abstract: La présente invention se rapporte essentiellement à un procédé d'exécution synchronisée d'une application dans un environnement à haute disponibilité comportant une pluralité de modules de calcul interconnectés par un réseau à très haut débit, caractérisé en ce qu'il comporte les étapes suivantes :
- configuration (2000) de la pluralité de modules en une pluralité de partitions dont au moins:
o deux partitions d'exécution l'une primaire, l'autre secondaire
o une partition de contrôle;
- exécution (2100) de l'application sur chaque partition d'exécution, des entrées-sorties traitées par la partition principale étant transmises à la partition d'exécution secondaire via la partition de contrôle ;
- synchronisation (2200) des exécutions via une exploitation des changements de contexte microprocesseur ;
- transmission (2300) d'un signal d'erreur catastrophique à la partition de contrôle;
- poursuite (2500) de l'exécution en passant dans un mode dégradé, l'exécution continuant sur une seule partition.

公开(公告)号：EP2973055A1

公开(公告)日：2016-01-20

申请号：EP14768471.6

申请日：2014-03-13

Applicant: Amazon Technologies Inc.

Inventor： GUPTA, Anurag Windlass ,  MADHAVARAPU, Pradeep Jnana ,  BURCHALL, Laurion Darrell ,  FACHAN, Neal

IPC: G06F17/30

CPC classification number: G06F17/30368 ,  G06F11/1474 ,  G06F17/30575 ,  G06F2201/80 ,  G06F2201/82

Abstract: A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data page exceeds a threshold.

Abstract translation: 数据库系统可以在分布式存储系统上维护多个日志记录。 多个日志记录中的每一个可以与对数据页的相应改变相关联。 在检测到特定数据页的合并事件时，可以应用链接到特定数据页的日志记录来生成其当前状态的特定数据页。 检测合并事件可以是确定链接到特定数据页的日志记录的数量超过阈值。