8 results about "Array data structure" patented technology

The computer implementation method includes the steps of: (I) receiving user program code (UC) having sequences of array instructions, each configured to receive array data structures (A, B, C, D, E, F, G) capable of storing multiple elements of each common data type as input; and generating segmented program code (TCC) from the user program code (UC) that can be executed on a processing unit (PU, CPU, GPU) including several subunits (core #1 to core #4). The segmented program code includes program segments (S1, S2, S3, S4, S5) each containing an array operation, where the array operation corresponds to an array instruction. Each program segment is configured to receive a partially configured runtime instance (A1, B1, C1) of each array data structure as its runtime input, and to partially configure runtime instances (B1, C1, C2) of array data structures (B, C) as its runtime output, and at least partially configure each executable code (KC) containing each array operation, using information from each partially configured runtime instance. The executable code is configured to update the configuration of the runtime instance, which is partially configured as the runtime output of each program segment. The method further includes the steps of: (III) starting execution of the segmented program code on a first subunit (core #1) of the processing unit; (IV) completing the configuration of each executable code when the configuration of the runtime instance received as its respective runtime input is complete and / or updated; and (V) executing each executable code on the processing unit when the respective executable code is only partially configured.

The invention relates to the technical field of circuit testing, in particular to a chip testing method and system and a storage medium. The chip testing method comprises the following steps: translating symbol information such as a channel name and a test vector label into index values in a compiling period / loading period; and an array data structure based on the indexes is initialized in advance. When the test is executed, the channel object or the test vector address can be directly obtained through a time group index operation instead of analyzing the symbols through character string search and hash calculation during operation in the prior art. In this way, a large amount of redundant runtime calculation is eliminated, the execution time of each test instruction is greatly shortened, and the test efficiency is improved.

The invention relates to the technical field of data stream processing, in particular to a method and system for efficiently detecting persistent items in a small memory environment. The method comprises the following steps of: constructing a two-dimensional array data structure: adopting a two-dimensional array as a data structure which comprises d rows and l columns, and mapping items to a specific counter column; each bucket comprises two fields, one field is used for storing a key of a persistent item, and the other field is used as a flag bit; executing a conservative updating strategy: when an item is inserted, calculating d hash functions, mapping the item to the positions of different counters in d rows, checking the current values of the different counters, selecting the minimum count value min, and marking the row as a target row; and when the counters are updated, only the smallest active counter in the current target row is updated. According to the method, by introducing a conservative updating strategy and a two-dimensional array data structure, the efficiency and precision of detecting the persistent items in a small memory environment are improved.

A GPU-based integrated processing method for geochemical data, includes the following steps: S1, storing geochemical data in a format of a preset three-dimensional array data structure Struct_A, S2, iteratively processing the formatted geochemical data by using a compute shader in a GPU, calculating a mean value and a standard deviation of content of each chemical element, calculating a threshold value of the chemical element, eliminating sampling points according to the threshold value, repeating the operations until there is no sampling point to be eliminated, and calculating a final mean value as a background value and a final threshold value as a lower limit value of anomaly; and S3, constructing spatial coordinates according to the obtained new geochemical data set, loading the spatial coordinates into a fragment shader for rendering, and completing anomaly delineation according to the background value and the lower limit value of anomaly.

A computer-implemented method and computer readable medium is disclosed. In one example, the method includes receiving a user program code; and generating, from the user program code, a segmented program code executable on a processing unit comprising several sub-units. The segmented program code comprises program segments. Each of the program segments being configured to receive, as a respective runtime input, a partially configured runtime instance of a respective array data structure, and to use information from the respective partially configured runtime instance. The method includes executing the segmented program code on a first sub-unit of the processing unit, and, when a configuration of the runtime instance is complete and / or updated, completing configuration of the respective executable code, when the respective executable code is only partially configured, and executing the respective executable code on the processing unit.

A multidimensional data aggregation and ingestion system includes a multidimensional data aggregation and ingestion computing device that ingests data received from one or more sources. During operation, data is received from one or more internal or external data sources. Next, received data is aggregated in accordance with aggregation rules. Next, delta information is determined by comparing received data to stored data in accordance with delta determination rules. Next, delta information is appended to the stored data. Data is ingested without deleting stored data. A stored multidimensional array data structure is updated based on received data without generating a new stored multidimensional array data structure. For example, a “Process Add” method provided by SQL Server Analysis Services (SSAS) is used to append delta information to a stored Online Analytical Processing (OLAP) cube. The novel system ingests significant quantities of data without needing to generate new OLAP cubes on each ingestion operation.

A computer-implemented method comprises: receiving (I) a user program code (UC), the code comprising a series of array instructions, each instruction configured to receive as input an array data structure (A, B, C, D, E, F, G) capable of storing a plurality of respective common data type elements; and generating (II), from the user program code (UC), a segmented program code (TCC) executable on a processing unit (PU, CPU, GPU) comprising a plurality of sub-units (core # 1-core # 4). The segmented program code comprises a plurality of program segments (S1, S2, S3, S4 and S5), each program segment comprises a corresponding array operation, and the array operation corresponds to an array instruction. Each program segment is configured to receive a runtime instance (A1, B1, C1) of a respective array data structure of a partial configuration as a respective runtime input and to use information from the runtime instance of the respective partial configuration to partially configure a runtime instance (B1, C1, C2) of an array data structure (B, C) as a runtime output of a respective program segment, and at least partially configuring a respective executable code (KC) comprising a respective array operation. The executable code is configured to update a configuration of a runtime instance that is partially configured as a runtime output of a respective program segment. The method further comprises starting (III) execution of the segmented program code on a first sub-unit (core # 1) of the processing unit and, when the configuration of runtime instances received as respective runtime inputs is completed and / or updated, completing (IV) the configuration of the respective executable code if the respective executable code is only partially configured, and if the respective executable code is only partially configured, completing (IV) the execution of the segmented program code on a second sub-unit (core # 1) of the processing unit. And executing (V) the respective executable code on the processing unit.

The present invention relates to the field of data stream processing technology, and in particular to a method and system for efficiently detecting persistent items in a small memory environment. The method comprises the following steps: constructing a two-dimensional array data structure: using a two-dimensional array as a data structure, comprising d rows and l columns, and mapping items to specific counter columns; each bucket comprises two fields, one of which is used to store the key of the persistent item, and the other is used as a flag; executing a conservative update strategy: when inserting an item, calculating d hash functions, mapping the item to the position of different counters in d rows, checking the current values of different counters, selecting the smallest count value min, and marking the row as the target row; when updating the counter, only updating the smallest active counter in the current target row. The present invention improves the efficiency and accuracy of detecting persistent items in a small memory environment by introducing a conservative update strategy and a two-dimensional array data structure.