Huawei Technologies Co., Limited

Alexander Vladimirovich Slesarenko

Hongbo Zhang

Mikhail Levin

Junchao Ma

Alexey Romanov

Dmitry Vyacheslavovich Bushev

Anton Yurievich Orlov

Yuriy Alexandrovich Zotov

An apparatus for extracting data from a database for object initialization, and apparatus for writing object data to a database, and corresponding methods are provided. A data extraction kernel on the native-side reads database data from a plurality of locations in the database using a database interface and writes the database data to a buffer using a native-side buffer API (application programming interface). An object initialization kernel on the virtual machine (VM-) side reads the database data from the buffer using a native-side buffer API and initializes a plurality of objects. Information indicating one of the plural memory regions in the buffer where the data extraction kernel writes the database data is known to the native-side buffer API and to the VM-side buffer API. According to the application, fast and memory efficient data exchange between a native side and VM side is achieved.

System and a method of fast java object materialization from database data

A data processing device configured to provide access to a stream of data elements to a consumer. The data processing device is further configured to generate a data stream source by generating a first instance of a stream providing module such that the stream providing module provides the data stream in one of a push-mode and a pull-mode, wherein, in the push mode, the first instance of the stream providing module provides elements of the data stream according to a predefined schedule, wherein, in the pull mode, the first instance of the stream providing module provides elements of the data stream after receiving a data stream request from a consumer. Such a data processing device may provide the benefit of versatility as it can be transformed to both push and pull computation patterns.

Data processing device for providing access to a data stream

The disclosure relates to a method for constructing a graph data structure as an intermediate representation of source code for a compiler configured for compiling the source code into executable machine code running on a processor of a computer system, wherein program operations of the source code are represented in an object-oriented programming language by objects of classes that form a hierarchy growing from a base node class of the graph data structure, the method comprising: producing new nodes of the graph data structure by calling factory methods associated with existing nodes of the graph data structure based on a factory method design pattern implemented in the nodes of the graph data structure, wherein the nodes of the graph data structure are identified by symbols; and using the symbols as proxies of the nodes of the graph data structure according to a proxy design pattern.

Method for constructing a graph data structure

The invention relates to a method for compiling a source code to a program code, the method comprising: providing a pattern graph based on the source code, the pattern graph corresponding to an intermediate representation of the source code according to a set of rules in a first programming language, wherein the set of rules comprises a specific replacement rule directing a pattern graph to be replaced by a corresponding replacement graph assigned to the pattern graph, replacing the pattern graph by the replacement graph assigned to the pattern graph, and generating the program code based on the replacement graph.

Method for compiling a source code

A method for assigning a computational block of a software program to cores of a multi-processor system includes: evaluating a first number of available cores of a first type of the multi-processor system and a second number of available cores of a second type of the multi-processor system; determining a first number of loops of the computational block for binding with the cores of the first type and a second number of loops of the computational block for binding with the cores of the second type; binding the first number of loops with the cores of the first type and binding the second number of loops with the cores of the second type; and executing the loops of the computational block according to the binding.

Growing community of inventors

Moscow, Russia

Alexander Vladimirovich Slesarenko