Huawei Technologies Co., Limited

Future Wei Technologies, Inc.

Shanghai Biren Technology Co., Ltd

Haichuan Wang

Peng Wu

Kai-Ting Amy Wang

Man Pok Ho

Brice Adam Dobry

Gang Yu

Handong Ye

Mingfa Wang

Shiqiang Cui

Bo Qi

Chao Wang

Zhou Hong

ChengPing Luo

Song Zhao

GuoFang Jiao

Fei Yang

Wei Tang

Ruohuang Zheng

Lin Ma

Xuejun Yang

The invention relates to an apparatus for second offloads in a graphics processing unit (GPU). The apparatus includes an engine; and a compute unit (CU). The engine is arranged operably to store an operation table including entries. The CU is arranged operably to fetch computation codes including execution codes, and synchronization requests; execute each execution code; and send requests to the engine in accordance with the synchronization requests for instructing the engine to allow components inside or outside of the GPU to complete operations in accordance with the entries of the operation table.

Apparatus and method for secondary offloads in graphics processing unit

Compiling source code objects to improve efficiency of compiling is described herein. The compiling includes determining, by a compiler, an object type of a to-be-compiled object in source code. A counter is set for the to-be-compiled object. When the object type of the to-be-compiled object is an object type that can be operated by only one thread at one moment, the compiler sets a counter counting rule for the counter of the to-be-compiled object.

Method and apparatus for compiling source code object, and computer

Embodiments of this disclosure allow non-position-independent-code to be shared between a closed application and a subsequent application without converting the non-position-independent-code into position-independent-code. In particular, embodiment techniques store live data of a closed application during runtime of the closed application, and thereafter page a portion of the live data that is common to both the closed application and a subsequent application back into volatile memory at the same virtual memory address in which the portion of live data was stored during runtime of the closed application so that the paged lived data may be re-used to execute the subsequent application in the managed runtime environment. Because the paged live data is stored at the same virtual memory address during the runtimes of both applications, non-position-independent-code can be shared between the applications.

Re-playable execution optimized for page sharing in a managed runtime environment

A computer implemented method manages execution of applications within a memory space of a multi-tenant virtual machine (MVM). The method includes instantiating a container for an application. The container has a thin client and a name space that is part of a memory space of the MVM. Threads of the application are moved from the MVM to the container. The threads are executed using the thin client in the name space of the container.

Virtual machine container for applications

Embodiments of the present invention relate to the field of computer technologies. The embodiments of the present invention provide a debugging method, including: stopping running, by a core A of a multi-core processor, and sending a running stop signal to other cores in a process of stopping running; after receiving a first stop termination instruction and resuming running, executing a debugging information collection function and stopping running after completing the execution of the debugging information collection function; after receiving a second stop termination instruction and resuming running, sending a running resumption instruction to the other cores; and knocking a pending breakpoint in a process of running an operation object of the preset event, so as to enter a debugging state. According to the technical solutions provided in the embodiments of the present invention, kernel mode code and user mode code can be debugged on a same debugging platform.

Debugging method, multi-core processor, and debugging device

A method and system for using multiple versions of a software component, includes storing, in memory, a first function table that points to executable code in the memory for functions from a first version of the software component, and storing, in the memory, a second function table that points to executable code in the memory for functions from a second version of the software component, referencing the first function table, when running a first application thread, to execute the functions from the first version of the software component; and referencing the second function table, when running a second application thread that is active concurrently with the first application thread, to execute the functions from the second version of the software component.

Multi-version asynchronous dynamic software update system and method for applications with multiple threads

Embodiments of the present invention relate to the field of computer technologies. The embodiments of the present invention provide a debugging method, including: starting, by a core A of a multi-core processor after completing execution of a preset event processing routine, to stop running, and sending a running stop signal to other cores in a process of stopping running; after receiving a first stop termination instruction and resuming running, executing a debugging information collection function to collect debugging information of the preset event, and stopping running after completing the execution of the debugging information collection function; and after receiving a second stop termination instruction and resuming running, sending a running resumption instruction to the other cores. By means of the technical solutions provided in the embodiments of the present invention, kernel mode code and user mode code can be masked on a same debugging platform.

Debugging method, multi-core processor and debugging device

A computer-implemented method and system for reducing the amount of memory space required to store applications written in dynamic scripting languages loads a program module into memory and removes a category of program code, such as debug information or function definitions, from the program module. The method and system also receives a request for debug information, or a function call or query, and determines whether or not the corresponding program code is in memory. If not, then the location in storage is identified where the program module is stored, and another copy containing the corresponding program code is loaded into memory. The corresponding program code is located and copied into the program module in memory, and a response is provided to the request.

On-demand loading of dynamic scripting language code for reduced memory usage

Methods and systems that facilitate efficient and effective application program maintenance and patch distribution are described. A device comprises: a memory that stores application source code files and instructions for creating a hot patch file, wherein the application source code files include an update source code file and initial source code files before an application update; and a processor operable to create the hot patch file, wherein the hot patch file is created based upon differences between a pair of optimized source code file sets that result from optimization of a first set of the initial source code files and separate optimization of a second set of source code files; wherein the second set includes an update source code file and associated files selected from the first set based on results from a graph indicating manners in which said source code files related to one another.

Growing community of inventors

San Jose, CA, United States of America

Haichuan Wang