公开(公告)号：US07716249B2

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

申请号：US11229053

申请日：2005-09-16

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

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

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

公开(公告)号：US20090210526A1

公开(公告)日：2009-08-20

申请号：US12031105

申请日：2008-02-14

Applicant: Jonathan Ryan Howell ,  John R. Douceur ,  Jeremy Eric Elson

Inventor： Jonathan Ryan Howell ,  John R. Douceur ,  Jeremy Eric Elson

IPC: G06F15/173

CPC classification number: H04L29/12811 ,  H04L29/12066 ,  H04L29/12132 ,  H04L61/1511 ,  H04L61/1552 ,  H04L61/303 ,  H04L61/6009 ,  H04L67/28 ,  H04L67/2842

Abstract: Domain name caching is controlled by adding a nonce to a domain name to force propagation of lookup to an authoritative server or service. Desired caching behavior is dictated by controlling when a new and unique nonce-bearing name is created. For example, caching can be completely eliminated by generating a new nonce-bearing name for every request. While a nonce can simply correspond to a random or pseudo random value, it can also be time based. Furthermore, nonces can be phase or time shifted to limit authoritative server load as well as improve response time.

Abstract translation: 通过将域名添加到域名来强制将查询传播到权威服务器或服务来控制域名缓存。 期望的缓存行为是通过控制何时创建新的和唯一的不占用名称来决定的。 例如，可以通过为每个请求生成一个新的nonce-bearing名称来完全消除缓存。 虽然随机数可以简单地对应于随机值或伪随机值，但也可以基于时间。 此外，随机可以是相位或时间偏移以限制权威服务器负载以及改善响应时间。

公开(公告)号：US07574457B2

公开(公告)日：2009-08-11

申请号：US11275550

申请日：2006-01-13

Applicant: John R. Douceur ,  Jonathan R. Howell

Inventor： John R. Douceur ,  Jonathan R. Howell

IPC: G06F17/30 ,  G06F17/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: 非突变树结构文件标识符用于识别存储在文件系统中的文件。 文件系统中的多个文件中的每一个具有相应的非突变文件标识符，并且使用树结构来分配和维护这些文件标识符。

公开(公告)号：US07571186B2

公开(公告)日：2009-08-04

申请号：US10991989

申请日：2004-11-18

Applicant: John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

Inventor： John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

IPC: G06F17/00

CPC classification number: G06F17/30156 ,  Y10S707/99944 ,  Y10S707/99946 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.

Abstract translation: 基于工作负载的随机划分，潜在地相同的对象（例如，文件）位于多个计算机之间。 对于存储在网络中的多个计算机上的多个对象中的每一个，选择与对象相对应的对象信息的一部分。 可以以各种方式生成对象信息（例如，基于对象的散列，基于对象的特征等）。 可以使用对象信息的各种部分中的任何一个（例如，对象信息的最低有效位）。 然后使用随机划分过程来识别多个计算机中的哪个计算机传达对象信息以便在多个计算机上识别可能相同的对象。

公开(公告)号：US07555656B2

公开(公告)日：2009-06-30

申请号：US10985202

申请日：2004-11-10

Applicant: John R. Douceur ,  Josh D. Benaloh ,  Gideon A. Yuval ,  Atul Adya

Inventor： John R. Douceur ,  Josh D. Benaloh ,  Gideon A. Yuval ,  Atul Adya

IPC: G06F11/30

CPC classification number: H04L63/0428 ,  G06F21/6209 ,  G06F21/6218 ,  G06F2221/2107

Abstract: An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the privacy created by the encryption (e.g., so the other computing device cannot see the plaintext). The exclusive encryption system may be implemented as part of a serverless distributed file system with directory entries (e.g., file names or folder names) being the plaintext, or alternatively as part of other systems.

公开(公告)号：US07487245B2

公开(公告)日：2009-02-03

申请号：US11139364

申请日：2005-05-27

Applicant: John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

Inventor： John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

IPC: G06F15/16

CPC classification number: G06F17/30156 ,  Y10S707/99944 ,  Y10S707/99946 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.

公开(公告)号：US07475258B2

公开(公告)日：2009-01-06

申请号：US11275201

申请日：2005-12-19

Applicant: John R. Douceur ,  Josh D. Benaloh ,  Gideon A. Yuval ,  Atul Adya

Inventor： John R. Douceur ,  Josh D. Benaloh ,  Gideon A. Yuval ,  Atul Adya

IPC: G06F11/30 ,  G06F12/14

CPC classification number: H04L63/0428 ,  G06F21/6209 ,  G06F21/6218 ,  G06F2221/2107

Abstract: An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the privacy created by the encryption (e.g., so the other computing device cannot see the plaintext). The exclusive encryption system may be implemented as part of a serverless distributed file system with directory entries (e.g., file names or folder names) being the plaintext, or alternatively as part of other systems.

公开(公告)号：US07454521B2

公开(公告)日：2008-11-18

申请号：US10694596

申请日：2003-10-23

Applicant: Jonathan R. Howell ,  John R. Douceur

Inventor： Jonathan R. Howell ,  John R. Douceur

IPC: G06F15/173

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

公开(公告)号：US07444387B2

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

申请号：US10991990

申请日：2004-11-18

Applicant: John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

Inventor： John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

IPC: G06F15/16

CPC classification number: G06F17/30156 ,  Y10S707/99944 ,  Y10S707/99946 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.

Abstract translation: 基于工作负载的随机划分，潜在地相同的对象（例如，文件）位于多个计算机之间。 对于存储在网络中的多个计算机上的多个对象中的每一个，选择与对象相对应的对象信息的一部分。 可以以各种方式生成对象信息（例如，基于对象的散列，基于对象的特征等）。 可以使用对象信息的各种部分中的任何一个（例如，对象信息的最低有效位）。 然后使用随机划分过程来识别多个计算机中的哪个计算机传达对象信息以便在多个计算机上识别可能相同的对象。

公开(公告)号：US07428751B2

公开(公告)日：2008-09-23

申请号：US10310440

申请日：2002-12-05

Applicant: Miguel Oom Temudo de Castro ,  Atul Adya ,  John R. Douceur ,  William J. Bolosky

Inventor： Miguel Oom Temudo de Castro ,  Atul Adya ,  John R. Douceur ,  William J. Bolosky

IPC: H04L29/00 ,  G06F21/00

CPC classification number: H04L63/0435 ,  G06F17/30194 ,  G06F21/40 ,  G06F21/62 ,  G06F2221/2101 ,  H04L9/3236 ,  H04L9/3247 ,  H04L9/3255 ,  H04L63/0442 ,  H04L63/0823

Abstract: Systems and methods for secure file writes after a catastrophic event are allowed over an unauthenticated channel in a serverless distributed file system if an authenticator accompanies the secure file writes. The authenticator can be a power-of-attorney certificate with time limitations, a vector of message authenticated code, or a single message authenticator with secured with a secret shared among members of the serverless distributed file system. The serverless distributed file system includes at least 3f+1 participating computer members, with f representing a number of faults tolerable by the system. The group requires at least one authenticator for file creation and file uploads. Any changes to files stored among the members can be made over an unauthenticated channel if the file changes are secured by the authenticator and the group is able to verify the authenticator.

Abstract translation: 如果认证者伴随着安全文件写入，则在无故障分布式文件系统中，通过未经身份验证的通道允许灾难性事件之后的安全文件写入的系统和方法。 验证器可以是具有时间限制的授权证书，消息认证代码的向量，或者具有在无服务器分布式文件系统的成员之间共享的秘密的单个消息认证器。 无服务器分布式文件系统至少包括3f + 1个参与的计算机成员，其中f表示系统可容忍的许多故障。 该组至少需要一个身份验证器用于文件创建和文件上传。 如果文件更改由验证者保护，并且该组能够验证验证器，则可以通过未经身份验证的通道对存储在成员中的文件进行任何更改。