Hewlett-packard Development Company, L.p.

Hewlett Packard Enterprise Development LP

Compaq Computer Corporation, Inc.

Digital Equipment Corporation

Hewlett Packard Enterprise Patent Development LP

Mark David Lillibridge

Kave Eshghi

Vinay K Deolalikar

Evan Randy Kirshenbaum

Paolo Faraboschi

Henri Jacques Suermondt

Peter Thomas Camble

Chandramohan Amyangot Thekkath

Rajan Mathew Lukose

Pankaj Mehra

Thomas Lee Rodeheffer

David Malcolm Falkinder

Raymond Paul Stata

Gregory Keith Trezise

Samuel A Fineberg

George H Forman

Goetz Graefe

Harumi Kuno

Marcos Kawazoe Aguilera

Chris I Dalton

Kimberly Keeton

Alistair Veitch

Joseph Andrew Tucek

Darrell Anderson

Haris Volos

Deepavali Mahendra Bhagwat

Graham Perry

Stephen Phillip Sorkin

Parthasarathy Ranganathan

Ludmila Cherkasova

Liqun Chen

Michael Burrows

Gary Belgrave Gostin

Jichuan Chang

Derek Alan Sherlock

Andrei Z Broder

Martin Abadi

Michael Isard

Andrew David Birrell

Sheng Li

Kei Yuasa

Minwen Ji

Mark Robert Watkins

Kevin T Lim

Charles Stuart Johnson

Fraser John Dickin

Harvey Ray

Joshua Rogers Tyler

John Philip MacCormick

Kevin Jones

Kan Zhang

Charles B Morrey, Iii

Craig A Soules

K Rustan M Leino

James Benjamin Saxe

John L Byrne

Jishen Zhao

Milind M Chabbi

Cormac A Flanagan

James Hyungsun Park

Krishna Bharat

John M Czerkowicz

Simon Kai Ying Shiu

Wey Guy

K Rustan Leino

Techniques for a firewall to determine access to a portion of memory are provided. In one aspect, an access request to access a portion of memory within a pool of shared memory may be received at a firewall. The firewall may determine whether the access request to access the portion of memory is allowed. The access request may be allowed to proceed based on the determination. The operation of the firewall may not utilize address translation.

Firewall to determine access to a portion of memory

Techniques for memory store error checks are provided. In one aspect, a process running on a processor may execute an instruction to store a first value in memory. The processor may store a plurality of values, including the first value, from a plurality of processes to the memory. A check on a synchronous error notification path may be performed to determine whether an error in storing at least one of the plurality of values occurred.

Memory store error check

There is provided an example memory system comprising a plurality of memory modules, each memory module comprising a persistent memory to store root key information and encrypted primary data; a volatile memory to store a working key for encrypting data, the encrypted primary data stored in the persistent memory being encrypted using the working key; and a control unit to provide load and store access to the primary data. The memory system further comprises a working key recovery mechanism to retrieve first root key information from a first module and second root key information from a second module; and compute the working key for a given module based on the retrieved first root key information and the retrieved second root key information.

Secure memory systems

In some examples, each processor of a plurality of processors applies an interleave transform to perform interleaved access of a plurality of memory banks, where for any given memory address in use by the plurality of processors, applying any of the interleave transforms results in selection of a same memory bank of the plurality of memory banks and a same address within the same memory bank.

Interleaved access of memory

Systems and methods associated with page modification are disclosed. One example method may be embodied on a non-transitory computer-readable medium storing computer-executable instructions. The instructions, when executed by a computer, may cause the computer to fetch a page to a buffer pool in a memory. The page may be fetched from at least one of a log and a backup using single page recovery. The instructions may also cause the computer to store a modification of the page to the log. The modification may be stored to the log as a log entry. The instructions may also cause the computer to evict the page from memory when the page is replaced in the buffer pool. Page writes associated with the eviction may be elided.

Eliding memory page writes upon eviction after page modification

In one example in accordance with the present disclosure, a method may include performing a transactional operation such that if one step of the transactional operation is performed, each other step of the transactional operation is performed. The transactional operation may include making a first copy, stored in a first persistent memory, of a next ticket number stored in a second persistent memory and updating the next ticket number in the second persistent memory. The method may also include determining when to serve a first thread based on the first copy of the next ticket number.

Persistent ticket operation

Systems and methods associated with latch-free searching are disclosed. One example method includes receiving a key identifying data to be retrieved from a tree-based data structure. The method also includes performing a concurrent, latch-free search of the tree-based data structure until a leaf node is reached. The method also includes validating the leaf node. The method also includes retreading a portion of the search if the leaf node fails validation.

Latch-free concurrent searching

A technique includes acquiring a plurality of write requests from at least one memory controller and logging information associated with the plurality of write requests in persistent storage. The technique includes applying the plurality of write requests atomically as a group to persistent storage.

Atomically committing write requests

Apertures of a first size in a first physical address space of at least one processor are mapped to respective blocks of the first size in a second address space of a storage medium. Apertures of a second size in the first physical address space are mapped to respective blocks of the second size in the second address space, the second size being different from the first size.

Mapping apertures of different sizes

A method includes receiving information about a plurality of data chunks and determining if one or more of a plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks where one of the plurality of back-end nodes is designated as a sticky node. The method further includes, responsive to determining that none of the plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks, deduplicating the plurality of data chunks against the back-end node designated as the sticky node. Finally, the method includes, responsive to an amount of data being processed, designating a different back-end node as the sticky node.

Systems and methods for data chunk deduplication

Systems and methods of reducing bandwidth usage of a mobile client are disclosed. An example method may include caching a first version of network content in a mobile client. The method may also include comparing the cached content with a second version of the network content. The method may also include generating a recipe to construct the second version of the network content from the cached network content based on a result of the comparing. The method may also include sending the recipe to the mobile client.

Reducing bandwidth usage of a mobile client

Embodiments of the present invention relate to a system and method of document retention with policy-controlled deletion. Embodiments of the present invention comprise committing to a plurality of documents, deleting one of the plurality of documents, and providing a proof of authorized deletion of the one of the plurality of documents in response to an audit request.

Method and system for data retention

A plurality of differential data stores are stored in persistent storage media. In response to receiving a first request to store a particular data object, one of the differential data stores that are stored in the persistent storage media is selected, wherein selecting the one differential data store is according to a criterion relating to compression of data objects in the differential data stores. The selected differential data store is copied into temporary storage media, where the copying is not delayed after receiving the first request to await receipt of more requests. The particular data object is inserted into the copy of the selected differential data store in the temporary storage media, where the inserting is performed without having to retrieve more data from the selected differential store in the persistent storage media. The selected differential data store in the persistent storage media is replaced with the copy of the selected differential data store in the temporary storage media that has been modified.

Copying a differential data store into temporary storage media in response to a request

Information relating to monitored communications between user machines and a resource of a particular machine is received. Group information that identifies groups of the users is received. Based on the monitored communications and the group information, a summary of a subset of users that have accessed the resource is generated.

Generating a summary of users that have accessed a resource

One embodiment is a data processing apparatus that has a chunk store containing specimen data chunks, a manifest store containing a plurality of manifests, each of which represents at least a part of previously processed data and includes at least one reference to at least one of the specimen data chunks, and a sparse chunk index containing information on only some specimen data chunks. Input data is processed into a plurality of input data segments. Each manifest of the first set has at least one reference to one of said specimen data chunks that corresponds to one of the input data chunks of a first input data segment. Specimen data chunks corresponding to other input data chunks of the first input data segment are identified by using the identified first set of manifests and at least one manifest identified when processing previous data.

Data processing apparatus and method of processing data

Growing community of inventors

Mountain View, CA, United States of America

Mark David Lillibridge