G06F8/312

Information processing apparatus, non-transitory computer-readable medium, and information processing method
11163570 · 2021-11-02 · ·

An information processing apparatus includes: a memory; and a processor configured to: acquire an instruction sequence including plural instructions; generate plural candidates of new instruction sequences capable of obtaining an execution result as same as in the instruction sequence, by replacing at least a part of plural nop instructions included in the instruction sequence with a wait instruction that waits for completion of all preceding instructions; delete any one of the nop instructions and the wait instruction from each of the new instruction sequences, when the execution result does not change in case any one of the nop instructions and the wait instruction is deleted from the new instruction sequences in the candidates; and select a one candidate among the candidates subjected to the delete, the one candidate including the number of instructions equal to or less than a certain number, and having a smallest number of execution cycles.

METHOD AND APPARATUS REUSING LISTCELL IN HYBRID APPLICATION

A prototype of a ListCell is defined using a front end of a hybrid software application. A ListCell template is created based on the prototype of the ListCell. A ListCell is obtained by copying the ListCell template. The ListCell is filled with obtained ListCell content. Display of the ListCell is initiated.

Method and apparatus reusing ListCell in hybrid application

A prototype of a ListCell is defined using a front end of a hybrid software application. A ListCell template is created based on the prototype of the ListCell. A ListCell is obtained by copying the ListCell template. The ListCell is filled with obtained ListCell content. Display of the ListCell is initiated.

Digital Processing Connectivity
20200301876 · 2020-09-24 ·

A connectivity has a first network (25) of signal-links interconnecting a large plurality of address-bearing, computing cells (20 and 22). Some of the links are selectable according to addresses hierarchically ordered along a recursive curve. Most of the address-designated links that form the network are switchably operable between cells such that a first selectable set of cells along one segment of the recursive curve form signal-routes to a second selectable set of cells, along a second segment. For receipt of instructions and for synchronisation, some segments have a switchable signal-path from one controlling cell of that segment. A second network (23) has signal-links interconnecting a plurality of processing cells (19 and 21) some of which control the loading of data into cells of the first network. The computing and processing cells have pairwise matching of addresses and are pairwise coterminous, which ensures that control of the connectivity by second network (23) is directed to localisably-selectable segments of first network (25).

INFORMATION PROCESSING APPARATUS, NON-TRANSITORY COMPUTER-READABLE MEDIUM, AND INFORMATION PROCESSING METHOD
20200249945 · 2020-08-06 · ·

An information processing apparatus includes: a memory; and a processor configured to: acquire an instruction sequence including plural instructions; generate plural candidates of new instruction sequences capable of obtaining an execution result as same as in the instruction sequence, by replacing at least a part of plural nop instructions included in the instruction sequence with a wait instruction that waits for completion of all preceding instructions; delete any one of the nop instructions and the wait instruction from each of the new instruction sequences, when the execution result does not change in case any one of the nop instructions and the wait instruction is deleted from the new instruction sequences in the candidates; and select a one candidate among the candidates subjected to the delete, the one candidate including the number of instructions equal to or less than a certain number, and having a smallest number of execution cycles.

Method and apparatus reusing listcell in hybrid application

A prototype of a ListCell is defined using a front end of a hybrid software application. A ListCell template is created based on the prototype of the ListCell. A ListCell is obtained by copying the ListCell template. The ListCell is filled with obtained ListCell content. Display of the ListCell is initiated.

Distributed build and compile statistics
10303442 · 2019-05-28 · ·

The present technology adds code to a top level build configuration file of a configuration program that will gather metrics for each invocation of a build. These metrics are sent to a commonly accessible metric server for future analysis. The metrics are collected for a distributed engineering team over several machines. Compilation time metrics may then be collected for each compilation event and those metrics are analyzed by a common aggregator.

METHOD AND APPARATUS REUSING LISTCELL IN HYBRID APPLICATION

A prototype of a ListCell is defined using a front end of a hybrid software application. A ListCell template is created based on the prototype of the ListCell. A ListCell is obtained by copying the ListCell template. The ListCell is filled with obtained ListCell content. Display of the ListCell is initiated.

DISTRIBUTED BUILD AND COMPILE STATISTICS
20170220325 · 2017-08-03 · ·

The present technology adds code to a top level build configuration file of a configuration program that will gather metrics for each invocation of a build. These metrics are sent to a commonly accessible metric server for future analysis. The metrics are collected for a distributed engineering team over several machines. Compilation time metrics may then be collected for each compilation event and those metrics are analyzed by a common aggregator.

Distributed build and compile statistics
09628544 · 2017-04-18 · ·

The present technology adds code to a top level build configuration file of a configuration program that will gather metrics for each invocation of a build. These metrics are sent to a commonly accessible metric server for future analysis. The metrics are collected for a distributed engineering team over several machines. Compilation time metrics may then be collected for each compilation event and those metrics are analyzed by a common aggregator.