专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07984155B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US07984155B2
公开(公告)日：2011-07-19
申请号：US12815373
申请日：2010-06-14
申请人： Michael T. Massa , David A. Dion , Raj Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit N. Jain , Sunita V. Nishanov
发明人： Michael T. Massa , David A. Dion , Raj Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit N. Jain , Sunita V. Nishanov
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

2. 发明授权

US07774469B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US07774469B2
公开(公告)日：2010-08-10
申请号：US11225222
申请日：2005-09-12
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

3. 发明授权

US08850007B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US08850007B2
公开(公告)日：2014-09-30
申请号：US13156315
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173 , G06F11/08 , G06F11/18 , G06F11/14 , G06F11/20 , G06F17/30 , G06F11/16
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

4. 发明授权

US08850018B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
公开(公告)号：US08850018B2
公开(公告)日：2014-09-30
申请号：US13156305
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173 , G06F11/08 , G06F17/30 , G06F11/18 , G06F11/14 , G06F11/20 , G06F11/16
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

5. 发明申请

US20110238842A1 CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS 有权
标题翻译：服务器群集中的一致性集群数据使用REPLICAS的一个QUORUM
公开(公告)号：US20110238842A1
公开(公告)日：2011-09-29
申请号：US13156305
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

6. 发明申请

US20110238813A1 CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS 有权
公开(公告)号：US20110238813A1
公开(公告)日：2011-09-29
申请号：US13156315
申请日：2011-06-08
申请人： MICHAEL T. MASSA , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： MICHAEL T. MASSA , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

7. 发明授权

US06938084B2 Method and system for consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：使用复制数量的服务器集群中一致的集群操作数据的方法和系统
公开(公告)号：US06938084B2
公开(公告)日：2005-08-30
申请号：US09895810
申请日：2001-07-02
申请人： Rod Gamache , Michael T. Massa , Sunita Shrivastava , Gor V. Nishanov , David B. Lomet , Philip A. Bernstein , Rohit Jain
发明人： Rod Gamache , Michael T. Massa , Sunita Shrivastava , Gor V. Nishanov , David B. Lomet , Philip A. Bernstein , Rohit Jain
IPC分类号： G06F7/00 , G06F9/50 , G06F11/20 , G06F12/00 , G06F15/16 , G06F15/173 , G06F17/30
CPC分类号： G06F11/182 , G06F11/1425 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/2023 , G06F11/2035
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。独立于节点的副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

8. 发明授权

US5212788A System and method for consistent timestamping in distributed computer databases 失效
标题翻译：分布式计算机数据库中的一致性计算的系统和方法
公开(公告)号：US5212788A
公开(公告)日：1993-05-18
申请号：US527087
申请日：1990-05-22
申请人： David B. Lomet , Philip A. Bernstein , James Johnson , Kenneth Wilner
发明人： David B. Lomet , Philip A. Bernstein , James Johnson , Kenneth Wilner
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F17/30309 , G06F17/30551 , Y10S707/99952
摘要： A distributed database system has a plurality of databases located at distinct nodes, at least one of the databases comprising a timestamping database. Distributed transactions are committed using a two phase protocol. During the first phase, each cohort to the transaction votes to commit or abort the transaction, and also votes an earliest time and a latest time at which the transaction is to be committed. If all the cohorts vote to commit the transaction and the intersection of the voted time ranges is not empty, then the transaction is committed during the second phase of the protocol. A transaction time is selected from the intersection of the voted time ranges and is used to timestamp all updated data that is durably stored when the transaction is committed. Before the first phase of the two phase commit protocol, each transaction read or write locks data at each node for which it needs read or write access. Whenever a transaction enters the first phase of the commit protocol, read locks for that transaction can be converted into delay locks. Any transaction which obtains a write lock on delay locked data is a "delayed transaction". The delayed transaction votes a time range which guarantees that it will commit at a time which is later than the time at which the transactions with the delay locks commit. This combination of time range voting and delay locking ensures that the timestamp order of transactions is consistent throughout the distributed database and is consistent with a valid serialization order of the transactions.

9. 发明申请

US20110295969A1 TOTALLY ORDERED LOG ON APPENDABLE STORAGE 有权
标题翻译：完全登录可以使用的存储
公开(公告)号：US20110295969A1
公开(公告)日：2011-12-01
申请号：US12786447
申请日：2010-05-25
申请人： Philip A. Bernstein , Dahlia Malkhi , Colin Wilson Reid , Mahesh Balakrishnan
发明人： Philip A. Bernstein , Dahlia Malkhi , Colin Wilson Reid , Mahesh Balakrishnan
IPC分类号： G06F15/16
CPC分类号： G06F11/1471 , G06F11/2094 , G06F2201/82
摘要： Computers are provided with a totally ordered, durable shared log. Shared storage is used and can be directly accessed by the computers over a network. Append-log operations are made atomic in the face of failures by committing provisional append ordering information onto a log. The log may comprise multiple flash packages or non-volatile memory devices, referred to as segments, although any shared storage device(s) may be used. Each log record is a multi-page stripe, where each page of a stripe is written to a different segment. Fault-tolerant protocol variants append stripes to the log, such that stripes are totally ordered in the log and each stripe is written atomically.
摘要翻译：计算机提供了一个完全有序，耐用的共享日志。共享存储被使用，可以由网络上的计算机直接访问。通过将临时附加订单信息提交到日志，Append-log操作在面临故障时被做成原子。尽管可以使用任何共享的存储设备，该日志可以包括被称为段的多个闪存包或非易失性存储设备。每个日志记录是一个多页条带，其中每个条带的页面被写入不同的段。容错协议变体将条纹附加到日志，使得条纹在日志中完全排序，每个条带是原子写入的。

10. 发明授权

US07647298B2 Generation of query and update views for object relational mapping 有权
标题翻译：生成对象关系映射的查询和更新视图
公开(公告)号：US07647298B2
公开(公告)日：2010-01-12
申请号：US11724991
申请日：2007-03-16
申请人： Atul Adya , Philip A. Bernstein , Sergey Melnik
发明人： Atul Adya , Philip A. Bernstein , Sergey Melnik
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30418 , Y10S707/99932
摘要： A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.
摘要翻译：数据访问架构可以包括映射体系结构，用于将应用程序可能使用的数据映射为持久存储在数据库中的数据。这种映射架构使用两种类型的“映射视图” - 一种用于翻译查询，另一种用于翻译更新。提供了一种自动生成来自高级映射规范的查询和更新视图的机制。可以执行验证以确保映射规范在与映射体系结合使用时允许数据从应用程序“往返”到数据库，而不会丢失数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式