International Business Machines Corporation

Mathew S Thoennes

Bharat Sukhwani

Hong Min

Sameh W Asaad

Parijat Dube

Balakrishna Raghavendra Iyer

Donald W Schmidt

Peter Bergersen Yocom

Jacquelyn Annette Martino

Rahul P Akolkar

Donna N Eng Dillenberger

Bernard V Brezzo

Joao P Goncalves

Peter Kenneth Malkin

Yuk Lung Chan

Petr Novotny

Qi Zhang

Gong Su

Salman Abdul Baset

Hiren Ramlal Shah

Jeffrey David Aman

Yuksel Gunal

Sameh W Assad

An example operation may include one or more of receiving, by a lead peer, a new block from an orderer node over a blockchain network that includes a plurality of peers, acquiring, by the lead peer, a shared memory handler for a channel of the blockchain network from an anchor peer, appending, by the lead peer, the new block to a shared memory buffer based on the handler, and notifying the plurality of the peers that the new block is available on the shared memory buffer.

Secure data dissemination

Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator having an external memory. The method includes receiving a plurality of key values by the hardware accelerator, assigning each of the plurality of key values a sequential key number as the plurality of key values are received and performing pairwise comparisons of each of the plurality of key values to identify a winning key and a losing key. The method also includes storing the losing key of each pairwise comparison in a first section of the external memory, wherein a location in the first section is based on the key number of the losing key and storing the winning key of each pairwise comparison in a second section of the external memory, wherein a location in the second section is based on the key number of the winning key.

Hardware implementation of a tournament tree sort algorithm using an external memory

Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

Scalable acceleration of database query operations

Embodiments include methods, systems and computer program products a for offloading multiple processing operations to an accelerator includes receiving, by a processing device, a database query from an application. The method also includes performing analysis on the database query and selecting an accelerator template from a plurality of accelerator templates based on the analysis of the database query. The method further includes transmitting an indication of the accelerator template to the accelerator and executing at least a portion of the database query on the accelerator.

Accelerating multiple query processing operations

Methods and arrangements for mapping a query operation to an accelerator are provided. The method includes receiving, by a processor, a query operation and determining the design logic of the query operation, receiving a configuration of one or more available accelerators and a design logic of each of the one or more available accelerators, and determining if the query operation can be offloaded to one or more of the one or more available accelerators. Based on a determination that the query operation can be offloaded to one or more of the one or more available accelerators, the method also includes creating software structures to interface with a selected accelerator and executing the query operation on the selected accelerator. Based on a determination that the query operation cannot be offloaded to one or more of the one or more available accelerators, the method further includes executing the query operation in software.

Mapping query operations in database systems to hardware based query accelerators

Content of a web-based application is displayed in a window of a web browser application. A selection of the display region is received from a user or a computer implemented system. A locked region is defined based on the selection. When instructions to modify the content of web-based application is received, the instructions are executed except those to modify the locked region.

Managing a web-based application's display

Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys.

Tunable hardware sort engine for performing composite sorting algorithms

Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Hardware implementation of a tournament tree sort algorithm

In some embodiments, a query recipient is configured to determine that a database query warrants a first projection operation to project a plurality of input rows to a plurality of projected rows. Each of the input rows has one or more variable-length columns. A projection controller is configured to construct a first projection control block to describe the first projection operation. For this construction, the projection controller is configured to construct a plurality of projection control elements, each one corresponding to a corresponding column in the input rows, and a header to specify the order of the projection control elements. The projection controller is further configured to offload the first projection operation to a hardware accelerator, and to provide the first projection control block to the hardware accelerator, where the first projection control block enables the hardware accelerator to perform the first projection operation at streaming rate.

Growing community of inventors

West Harrison, NY, United States of America

Mathew S Thoennes