Digital Equipment Corporation

Google Inc.

Hewlett-packard Development Company, L.p.

Alta Vista Company

Microsoft Technology Licensing, LLC

Overture Services, Inc.

Compaq Computer Corporation, Inc.

Hewlett-packard Company

Compaq Information Technologies Group, L.p.

Michael Burrows

Himabindu Pucha

Jeffrey Adgate Dean

Andrew Fikes

Raja Daoud

Sanjay Ghemawat

Martin Abadi

Marius P Schilder

Robert C Pike

Ankur Taly

Sean Quinlan

Edward Pearce Wobber

Janet Lynn Wiener

Raymond Paul Stata

Jatin Lodhia

Monika Hildegard Henzinger

Andrei Z Broder

Andrew David Birrell

Joshua A Redstone

Deborah Anne Wallach

Fay Wen Chang

Wilson C Hsieh

Andrew L Hisgen

Carl Alan Waldspurger

Daniel Ron Simon

Butler W Lampson

Mark David Lillibridge

Jeffrey Clifford Mogul

Mark Steven Manasse

Michael Isard

Darren Arthur Shakib

Juan Carlos Arevalo Baeza

Jason Matthew Gould

Olcan Sercinoglu

Gaurav Sareen

Sean Matthew Dorward

David Floyd Aronson

Matthew William Lee

Charles Gregory Nelson

Keith H Randall

John H Palevich

Adam Sadovsky

Asim Shankar

Parham Mohadjer

Cormac A Flanagan

Gauthaum K Thambidorai

Matthew Russell Kimball

Karen Elaine Stevens

Rajiv G Wickremesinghe

Mark Thierry Vandervoorde

Suresh Venkatasubramanian

Puneet Kumar

Stefan Savage

Patrick G Sobalvarro

Andrew Goossen

Andrew B Fikes

A system for creating a sync group in a distributed system may include an offline electronic device having a short range communication transmitter and a storage service, and a computer-readable storage medium comprising one or more programming instructions. The system may receive a request from an application to create a sync group, and verify that the application has read access to the storage service. In response to verifying that the application has read access to the storage service, the system may create the sync group by receiving an indication of one or more objects stored in the storage service that are to be shared, identifying one or more members of the sync group, and assigning one or more permissions to the one or more members that are identified. The system may synchronize access to the objects among the electronic device and one or more member electronic devices.

Peer-to-peer syncable storage system

In a distributed system, data is shared between three or more electronic devices. The first device generates and signs an object that includes the data. A second device receives the signed object and determines whether the signed object is valid. If valid, the second device will generate a validated signed object and send it to a third device. The third device will validate the object by determining whether the object includes valid signatures of both the first and second devices.

Signatures of updates exchanged in a binary data synchronization protocol

In a method of controlling sharing of an object between entities in a distributed system, a processor will identify an object and generate an access control list (ACL) for the object so that the ACL includes a list of clauses. Each clause will include a blessing pattern that will match one or more blessings, and at least one of the clauses also may include a reference to one or more groups. Each group represents a set of strings that represent blessing patterns or fragments of blessing patterns. The processor may generate each clause of the ACL as either a permit clause or a deny clause to indicate whether an entity or entities that have a blessing matched by the blessing pattern are permitted to access the object. The processor will save the ACL to a data store for use in responding to a request to access the object.

Authorization in a distributed system using access control lists and groups

A server receives a request from the client. The request includes a cryptographically protected object that includes a respective user identifier and validation value. When the respective user identifier is valid, the validation value fails a first requirement in a predefined manner, and a count of consecutively received cryptographically protected objects whose validation value has failed the first validation requirement is less than a threshold value that is greater than one, the server returns to the client a response to the request in accordance with the respective user identifier, the response including an updated cryptographically protected object that includes the respective user identifier and an updated validation value, and updates the count. When the respective user identifier is valid, the validation value fails a first requirement in the predefined manner, and the count is equal to or exceeds the threshold value, the server performs a predefined remedial action.

Cookie security system with interloper detection and remedial actions to protest personal data

A first server associated with a first URL receives a request from a client, including a first object having a respective user identifier and validation value. The server evaluates the validation value of the received first object with respect to a first validation requirement. When the validation value of the first object fails the first validation requirement, the server sends a response to the client that causes the client to send a second request to a second URL that is distinct from the first URL. A second server associated with the second URL receives a request from the client that includes a second object, distinct from the first object. The second server evaluates the received second object with respect to a second validation requirement, and when the second object fails the second validation requirement, the second server invalidates the respective user identifier.

Dual cookie security system with interlocking validation requirements and remedial actions to protect personal data

A server system includes a processor and a data structure having an entry for a resource, the entry including a first sequence number. The server has communication procedures for receiving a request from a client to access the resource, where the request includes a second sequence number obtained from a service, and a resource request handling program. Upon receiving the request, the resource request handling program determines whether the server has any record of having previously received a request to access the resource. If not, the server returns a provisional rejection to the client, requiring the client to verify that it holds a lock on the specified resource. A provisional bit in the entry is initially set to indicate that the resource has not been accessed since the system was last initialized. The provisional bit is reset when a request to access the resource is granted.

System and method for managing access to a resource

A method for analyzing the performance of a video game uses a diagnostic tool that is associated with application code of the video game. The diagnostic tool is activated when the video game is in operation, and real-time performance data is captured and displayed. A warning is generated when a performance metric violates a pre-set condition. The warning may be displayed on a display screen that is used to provide information for rectifying the violation.

Real-time analysis of performance data of a video game

System and method for resource locking

One or more servers receive requests from clients and send responses. At least a subset of the responses including cookies produced by the one or more servers, and at least a subset of the received requests including cookies that were previously produced by the one or more servers and sent to the clients with responses to previously processed requests. Each of the cookies includes a respective user identifier. The one or more servers analyzing the received cookies to detect a first condition, which indicates that a respective plurality of clients may be using cookies that have a shared user identifier. Upon detecting the first condition, the one or more servers send at least one of the clients of the respective plurality of clients a response that includes a new cookie having a user identifier that is distinct from the shared user identifier.

Dual cookie security system

A tokenspace repository stores documents as a sequence of tokens. In each of a sequence of non-overlapping epochs, execution of a respective set of queries against the repository is initiated in a plurality of threads. During each epoch, entries identifying portions of the repository to be deleted are added to a respective epoch-specific list. The system or process maintains a respective epoch-specific count of the number of threads that potentially reference any of the portions of the repository identified by entries in the respective epoch-specific list; and it also maintains the epoch-specific count of each prior epoch whose epoch-specific count is not equal to a predefined final value. After the end of each epoch, when the corresponding epoch-specific count reaches the predefined final value, the system or process deletes from the repository all portions of the repository corresponding to the entries in the corresponding epoch-specific list.

Low overhead thread synchronization system and method for garbage collecting stale data in a document repository without interrupting concurrent querying

Growing community of inventors

Palo Alto, CA, United States of America

Michael Burrows