Hewlett-packard Development Company, L.p.

Amazon Technologies, Inc.

Hewlett Packard Enterprise Development LP

Hewlett-packard Development, L.p.

Nathan Lorenzo Binkert

Moray McLaren

Norman Paul Jouppi

Robert S Schreiber

Alan Lynn Davis

Jung Ho Ahn

Raymond G Beausoleil

Marco Fiorentino

Mehul A Shah

Qianfan Xu

Indrajit Roy

Al Davis

Ron Diamant

Michael Renne Ty Tan

Parthasarathy Ranganathan

Jichuan Chang

Andrea Olgiati

Niraj Tolia

Benjamin Albert Sowell

Stavros Harizopoulos

Wojciech Golab

Norm Jouppi

Dana M Vantrease

David A Fattal

Anurag Windlass Gupta

Michael S Schlansker

Michael R Tan

Jeffrey Clifford Mogul

Mehul Jayant Shah

Yoshio Frank Turner

Ippokratis Pandis

Mengchu Cai

Michail Petropoulos

Jayaram Mudigonda

Marco Florentino

Martin Grund

Greg Astfalk

Carlos Garcia-Alvarado

Zhuzeng Lu

Shivaram Venkataraman

Jayaram Mudlgonda

Maor Kleider

Robert Schraiber

Robert Samuel Schreiber

Dimitrios Tsirogiannis

Benjamin A Sowell

Moray Mclaren

Relocating data sharing operations for query processing may be implemented when generating plans to perform a query. A query operation that causes a node to share data obtained from a different set of nodes with other nodes in a same set of nodes may be identified. The identified query operation may be replaced with another operation that causes the different set of nodes to share the data directly with the other nodes in the same set of nodes.

Relocating data sharing operations for query processing

Techniques for performing incremental block compression using a processor are described herein. The processor receives a request to compress input data, the request including compression parameters for the compression and a target block size. The processor divides the input data into portions. The processor iteratively compresses the input data to an output block, until compressing another portion of data would increase a file size of the output block over a threshold value that is based at least on the target block size.

Incremental block compression

A first column of a first database table may be transferred to a second table in a combined truncate and append operation in a transaction that may be atomic and reversible. References data for the first column may be removed from the first table and added to the second table. The combined operation may be reversed by removing, from the second table, references to blocks of data added to the second table prior to commencing the combined operation. A second column corresponding on a row-by-row basis to the first column may be added to the second table, where the data is indicative of visibility of data in the first column to other transactions on the second table.

Truncate and append database operation

A system comprises a data storage, a decompression accelerator configured to decompress compressed data and thereby generate decompressed data, and a direct memory access (DMA) engine coupled to the data storage and the decompression accelerator. The DMA engine comprises a buffer for storage of a plurality of descriptors containing configuration parameters for a block of compressed data to be retrieved from the data storage and decompressed by the decompression accelerator, wherein at least one of the descriptors comprises a threshold value. The DMA engine, in accordance with one or more of the descriptors, is configured to read compressed data from data storage and transmit the threshold value and the compressed data to the decompression accelerator. The decompression accelerator is configured to decompress the compressed data until the threshold value is reached and then to abort further data decompression and to assert a stop transaction signal to the DMA engine.

Random access to decompressed blocks

According to an example, nodes request access to a shared resource in a prioritized optical arbitration system. Each node attempts to extract a wavelength corresponding to a priority level selected by the node from a waveguide. A node is granted access to the resource according to priority level, and is to extract from the waveguide the corresponding wavelength.

Prioritized optical arbitration systems and methods

An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.

Transaction commitment and replication in a storage system

Optical interconnect fabrics and optical switches are disclosed. In one aspect, an optical interconnect fabric comprises one or more bundles of optical broadcast buses. Each optical broadcast bus is optically coupled at one end to a node and configured to transmit optical signals generated by the node. The optical fabric also includes a number of optical tap arrays distributed along each bundle of optical broadcast buses. Each optical tap array is configured to divert a portion of the optical power associated with the optical signals carried by a bundle of optical broadcast buses to one of the nodes.

Optical interconnect fabrics and optical switches

A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.

Managing array computations during programmatic run-time in a distributed computing environment

As described herein, a network device includes an optical circuit switch to perform circuit switching. The network device also has a plurality of removable line cards, each of which includes a packet switch. A switching manager automatically reconfigures the optical circuit switch based on a configuration of the removable line cards to maintain a guaranteed packet switching bandwidth between active line cards.

Switching in a network device

Embodiments of the present invention are directed to optoelectronic network switches. In one embodiment, an optoelectronic switch includes a set of roughly parallel input waveguides and a set of roughly parallel output waveguides positioned roughly perpendicular to the input waveguides. Each of the output waveguides crosses the set of input waveguides. The optoelectronic switch includes at least one switch element configured to switch one or more optical signals transmitted on one or more input waveguides onto one or more crossing output waveguides.

Optoelectronic switches using on-chip optical waveguides

Various embodiments of the present invention relate to systems and methods for achieving low-latency, prioritized, distributed optical-base arbitration. In one embodiment, an optical arbitration system () comprises a waveguide () having a first end and a second end, and a source () optically coupled to the first end of the waveguide and configured to input at least one wavelength of light into the waveguide. The system also includes a number of wavelength selective elements (--) optically coupled to the waveguide. Each wavelength selective element is capable of extracting a wavelength of light from the waveguide when activated by an electronically coupled node. An arbiter () is optically coupled to the second end of the waveguide and to the waveguide between the source and a wavelength selective element located closest to the source along the waveguide.

In one example, a composite processor includes a circuit board, a first processor element package, and a second processor element package. The circuit board has an optical link and an electrical link. The first processor element package includes a substrate with an integrated circuit, a sub-wavelength grating optical coupler, and an electrical coupler coupled to the electrical link of the circuit board. The second processor element package includes a substrate with an integrated circuit, a sub-wavelength grating optical coupler, and an electrical coupler coupled to the electrical link of the circuit board. The sub-wavelength grating optical coupler of the first processor element package, the optical link of the circuit board, and the sub-wavelength grating optical coupler of the second processor element package collectively define an optical communications path between the substrate of the first processor element package and the substrate of the second processor element package.

Composite processors

A circuit switched optical interconnection fabric includes a first hollow metal waveguide and a second hollow metal waveguide which intersects the first hollow metal waveguide to form an intersection. An optical element within the intersection is configured to selectively direct an optical signal between the first hollow metal waveguide and a second hollow metal waveguide.

Circuit switched optical interconnection fabric

A multi-core processor includes at least one first core and at least one second core. The first core is optimized to run applications, and the second core is optimized to meet the computing demands of operating-system-like code. The first core and the second core execute the same instruction set.

Switching to core executing OS like codes upon system call reading greater than predetermined amount of data

A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.

Validation of distributed balanced trees

Growing community of inventors

Redwood City, CA, United States of America

Nathan Lorenzo Binkert