公开(公告)号：US20060143517A1

公开(公告)日：2006-06-29

申请号：US11021983

申请日：2004-12-22

Applicant: John Douceur ,  Jonathan Howell

Inventor： John Douceur ,  Jonathan Howell

IPC: G06F11/00

CPC classification number: G06F11/1484

Abstract: A mechanism that enables a nondeterministic client-server application to be run as a replicated state machine without requiring the application to be modified. A replicated state machine substrate is utilized to coordinate the execution of multiple virtual machine monitors, each of which runs an identical copy of an operating system and server application. The virtual machine monitors each act as deterministic state machines, virtualizing state machine characteristics and behaviors.

Abstract translation: 一种使非确定性客户端 - 服务器应用程序作为复制状态机运行而不需要修改应用程序的机制。 复制状态机基板用于协调多个虚拟机监视器的执行，每个虚拟机监视器运行操作系统和服务器应用程序的相同副本。 虚拟机监视每个动作为确定性状态机，虚拟化状态机特性和行为。

公开(公告)号：US20060136369A1

公开(公告)日：2006-06-22

申请号：US11015227

申请日：2004-12-17

Applicant: John Douceur ,  Jonathan Howell

Inventor： John Douceur ,  Jonathan Howell

IPC: G06F17/30

CPC classification number: G06F17/30194

Abstract: Disclosed are “black-box leases” that protect information consistency and that allow for information sharing in a distributed file system while hiding from a client information about other clients' use of the file system. This information hiding also allows greater concurrency because changes to the file system are permitted as long as they do not affect the leases as observed by the clients. For each data field protected by a black-box lease, a client has a two-value data structure: SelfValue represents the client's intended use of the data field, and OtherValue is an aggregation of the other clients' intended uses of that data field. Knowing only this aggregate OtherValue, but without knowing any specifics of the other clients' usage patterns, the client knows how it may use the data field without adversely affecting the consistency of data in the distributed file system.

Abstract translation: 公开的是“黑箱租赁”，其保护信息一致性并且允许在分布式文件系统中的信息共享，同时隐藏客户端关于其他客户端使用文件系统的信息。 此信息隐藏还允许更大的并发性，因为只要不影响客户端遵守的租约，就允许对文件系统进行更改。 对于由黑盒租赁保护的每个数据字段，客户端具有两值数据结构：SelfValue表示客户端对数据字段的预期用途，而OtherValue是其他客户端该数据字段的预期用途的聚合。 只知道这个聚合的OtherValue，但是不知道其他客户端的使用模式的任何细节，客户端知道如何使用数据字段，而不会对分布式文件系统中的数据的一致性产生不利影响。

公开(公告)号：US08135987B2

公开(公告)日：2012-03-13

申请号：US12793547

申请日：2010-06-03

Applicant: John Douceur ,  Jonathan Howell ,  Jacob R. Lorch

Inventor： John Douceur ,  Jonathan Howell ,  Jacob R. Lorch

IPC: G06F11/00

CPC classification number: G06F11/187 ,  G06F11/1482 ,  G06F2201/82

Abstract: A replicated state machine with N replica servers may be configured to tolerate a count of F faults. A first operation (of a first ordering type) executes when a first quorum of correctly functioning replicas is available. A second operation (also of the first operation type) executes when a second quorum of correctly functioning replicas is available. A third operation (of a second ordering type) executes when a third quorum of correctly functioning replicas are available. The operations are executed by the replicated state machine such that: (1) the replicated state machine does not guarantee operational ordering between the first operation and the second operation; (2) the replicated state machine guarantees ordering between the first operation and the third operation; and (3) the replicated state machine guarantees ordering between the second operation and the third operation.

Abstract translation: 具有N个副本服务器的复制状态机可以被配置为容忍F个故障的计数。 当正常运行的副本的第一个法定数量可用时，执行第一个操作（第一个排序类型）。 当正常运行的副本的第二个法定值可用时，执行第二个操作（也是第一个操作类型）。 当正常运行的副本的第三个法定值可用时，执行第三次操作（第二次排序类型）。 这些操作由复制状态机执行，使得：（1）复制状态机不保证第一操作和第二操作之间的操作顺序; （2）复制状态机保证第一操作和第三操作之间的顺序; 和（3）复制状态机保证第二操作和第三操作之间的顺序。

公开(公告)号：US20110302449A1

公开(公告)日：2011-12-08

申请号：US12793547

申请日：2010-06-03

Applicant: John R. Douceur ,  Jacob R. Lorch ,  Jonathan Howell

Inventor： John R. Douceur ,  Jacob R. Lorch ,  Jonathan Howell

IPC: G06F11/07 ,  G06F17/00

CPC classification number: G06F11/187 ,  G06F11/1482 ,  G06F2201/82

Abstract: A replicated state machine with N replica servers may be configured to tolerate a count of F faults. A first operation (of a first ordering type) executes when a first quorum of correctly functioning replicas is available. A second operation (also of the first operation type) executes when a second quorum of correctly functioning replicas is available. A third operation (of a second ordering type) executes when a third quorum of correctly functioning replicas are available. The operations are executed by the replicated state machine such that: (1) the replicated state machine does not guarantee operational ordering between the first operation and the second operation; (2) the replicated state machine guarantees ordering between the first operation and the third operation; and (3) the replicated state machine guarantees ordering between the second operation and the third operation.

Abstract translation: 具有N个副本服务器的复制状态机可以被配置为容忍F个故障的计数。 当正常运行的副本的第一个法定数量可用时，执行第一个操作（第一个排序类型）。 当正常运行的副本的第二个法定值可用时，执行第二个操作（也是第一个操作类型）。 当正常运行的副本的第三个法定值可用时，执行第三次操作（第二次排序类型）。 这些操作由复制状态机执行，使得：（1）复制状态机不保证第一操作和第二操作之间的操作顺序; （2）复制状态机保证第一操作和第三操作之间的顺序; 和（3）复制状态机保证第二操作和第三操作之间的顺序。

公开(公告)号：US20080009953A1

公开(公告)日：2008-01-10

申请号：US11786756

申请日：2007-04-12

Applicant: Robin Ling ,  Jonathan Howell ,  Andrew Timperley ,  Matthew Hubble ,  Graham Gie ,  Philippe Lavieille ,  Pascal Collet ,  Alain Richard

Inventor： Robin Ling ,  Jonathan Howell ,  Andrew Timperley ,  Matthew Hubble ,  Graham Gie ,  Philippe Lavieille ,  Pascal Collet ,  Alain Richard

IPC: A61F2/32

CPC classification number: A61F2/34 ,  A61F2/30724 ,  A61F2/4684 ,  A61F2002/3008 ,  A61F2002/30115 ,  A61F2002/30619 ,  A61F2002/30822 ,  A61F2002/30827 ,  A61F2002/30831 ,  A61F2002/30894 ,  A61F2002/3266 ,  A61F2002/3412 ,  A61F2002/3422 ,  A61F2002/3429 ,  A61F2002/3446 ,  A61F2002/3493 ,  A61F2002/4631 ,  A61F2230/0006 ,  A61F2250/0097 ,  A61F2250/0098 ,  A61F2310/00011

Abstract: A kit and a method for implanting a prosthetic acetabular cup in an acetabular has a prosthetic acetabular cup having an open end for receiving a head of a prosthetic femoral component. The cup has a flange extending outwardly from a surface thereof adjacent the open end. The flange is angled toward the acetabulum. The acetabulum is prepared to receive the prosthetic acetabular cup, the preparation includes forming a circumferential rim shaped seat in the bone around the acetabulum. The cup flange has a maximum diameter less than the outer diameter of the circumferential rim.

Abstract translation: 用于在髋臼中植入假体髋臼杯的套件和方法具有假体髋臼杯，其具有用于接收假体股骨部件的头部的开口端。 杯具有从邻近开口端的表面向外延伸的凸缘。 法兰向髋臼倾斜。 髋臼准备接受假体髋臼杯，该制剂包括在髋臼周围的骨骼中形成圆周缘形座位。 杯形凸缘的最大直径小于圆周边缘的外径。

公开(公告)号：US20070168364A1

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

申请号：US11275550

申请日：2006-01-13

Applicant: John Douceur ,  Jonathan Howell

Inventor： John Douceur ,  Jonathan Howell

IPC: G06F7/00

CPC classification number: G06F17/3012 ,  Y10S707/99945

Abstract: Non-mutating tree-structured file identifiers are used to identify files stored in a file system. Each of multiple files in the file system has a corresponding non-mutating file identifier, and these file identifiers are assigned and maintained using a tree structure.

Abstract translation: 非突变树结构文件标识符用于识别存储在文件系统中的文件。 文件系统中的多个文件中的每一个具有相应的非突变文件标识符，并且使用树结构来分配和维护这些文件标识符。

公开(公告)号：US20070073693A1

公开(公告)日：2007-03-29

申请号：US11229053

申请日：2005-09-16

Applicant: Tim Harris ,  Simon Peyton-Jones ,  Jonathan Howell ,  John Douceur

Inventor： Tim Harris ,  Simon Peyton-Jones ,  Jonathan Howell ,  John Douceur

IPC: G06F17/30

CPC classification number: G06F9/524 ,  G06F9/466

Abstract: The described implementations relate to efficient scheduling of transactions and tasks. A memory location, address, or variable previously accessed by a blocked entity is observed periodically to determine an appropriate time to wake and retry the blocked entity. If the previous accessed memory location, address or variable changes state, a scheduler wakes the blocked entity and the blocked entity retries processing. A doubly-indexed data structure of blocked entities and memory locations associated with the blocked entities may be used to efficiently determine when a retrying execution would be profitable.

Abstract translation: 所描述的实现涉及事务和任务的有效调度。 周期性地观察先前被阻塞实体访问的存储器位置，地址或变量，以确定唤醒并重试被阻塞实体的适当时间。 如果先前访问的存储器位置，地址或变量改变状态，则调度器唤醒被阻止的实体，并且被阻止的实体重试处理。 被阻止的实体和与被阻止的实体相关联的存储器位置的双重索引的数据结构可以用于有效地确定重试执行何时是有利可图的。

公开(公告)号：US20060259818A1

公开(公告)日：2006-11-16

申请号：US11489819

申请日：2006-07-20

Applicant: Jonathan Howell ,  Eric Traut ,  Jacob Lorch ,  John Douceur

Inventor： Jonathan Howell ,  Eric Traut ,  Jacob Lorch ,  John Douceur

IPC: G06F11/00

CPC classification number: G06F9/45558 ,  G06F11/1484 ,  G06F2009/45566 ,  G06F2201/815

Abstract: A virtual machine monitor (VMM) is configured to enforce deterministic execution of virtual machines in a multiprocessor machine. The VMM is configured to ensure that any communication by physical processors via shared memory is deterministic. When such VMMs are implemented in a distributed environment of multiprocessor machines coupled via a logical communication link, non-deterministic server applications running on virtual machines using the VMM may be replicated.

Abstract translation: 虚拟机监视器（VMM）被配置为强制执行多处理器机器中的虚拟机的确定性执行。 VMM配置为确保物理处理器通过共享内存的任何通信是确定性的。 当这种VMM在通过逻辑通信链路耦合的多处理器机器的分布式环境中实现时，可以复制在使用VMM的虚拟机上运行的非确定性服务器应用程序。

公开(公告)号：US20060184627A1

公开(公告)日：2006-08-17

申请号：US11057591

申请日：2005-02-14

Applicant: Jonathan Howell ,  Jacob Lorch ,  John Douceur ,  Leslie Lamport

Inventor： Jonathan Howell ,  Jacob Lorch ,  John Douceur ,  Leslie Lamport

IPC: G06F15/16

CPC classification number: G06F11/187 ,  G06F11/1683 ,  G06F2201/82

Abstract: Synchronized devices comprising a distributed system attempt to agree on a compatible sequence of commands to execute. Each device in the distributed system may act as a proposer, acceptor, or a learner. Each proposer proposes a command for each device to execute. The acceptors either accept or reject the proposed commands. The learners keep track of the proposed commands and determine, using a transactional substrate, whether the acceptors have a accepted sequences of commands that commute with respect to one another. Once the learners have determined that a quorum of acceptors have accepted sequences of commands that commute with respect to one another the accepted commands are executed by each device in the distributed system.

Abstract translation: 包括分布式系统的同步设备尝试对要执行的命令的兼容序列达成一致。 分布式系统中的每个设备可以充当提议者，接受者或学习者。 每个提议者为每个设备提出一个命令来执行。 接受者接受或拒绝提出的命令。 学习者跟踪所提出的命令，并使用事务底层来确定接受者是否具有相互相互通信的接受的命令序列。 一旦学习者确定接受者的数量已经接受了相互之间通勤的命令序列，则接受的命令由分布式系统中的每个设备执行。

公开(公告)号：US20050089131A1

公开(公告)日：2005-04-28

申请号：US10694596

申请日：2003-10-23

Applicant: Jonathan Howell ,  John Douceur

Inventor： Jonathan Howell ,  John Douceur

IPC: G06F1/12 ,  G06F1/14 ,  G06F21/00 ,  G06M3/00 ,  H04L29/06

CPC classification number: H04L63/126 ,  G06F1/12 ,  G06F1/14 ,  G06F21/725

Abstract: The clocks of remote computing devices are synchronized within a range of certainty through the determination of an upper bound and a lower bound around a reference time. A message from a computing device is propagated up a network tree of devices to a device having a reference time, which encodes the reference time and returns the message down the tree. Each receiving device can determine that the reference time could not have occurred before their transmission of the message, nor could it have occurred after their receipt of the return message. Cryptographic hashes can be used to guard against malicious computing devices. Alternate paths and scheduling of messages can be used to provide a narrower spread between the upper and lower bounds, and clock drift can be accounted for by increasing the spread over time.

Abstract translation: 通过确定参考时间周围的上限和下限，远程计算设备的时钟在确定的范围内同步。 来自计算设备的消息被传播到设备的网络树到具有参考时间的设备，该参考时间对参考时间进行编码并将消息返回到树下。 每个接收设备可以确定参考时间在其发送消息之前不能发生，也不能在接收到返回消息之后发生。 密码散列可用于防范恶意计算设备。 消息的替代路径和调度可用于在上限和下限之间提供较窄的扩展，并且可以通过增加随时间推移来计算时钟漂移。