41 results about "Associative array" patented technology

This invention relates to a method and processor (19) for power analysis in digital circuits. The method incorporates a main processor (19) and an associative memory mechanism (101a, 101b, 102, 104, 105, 106), the associative memory mechanism comprising a plurality of associative arrays (101a, 101b), an input value register (102), at least one result register (104) and a memory block area (29). A circuit design is transformed into a functionally equivalent model format suitable for processing in the associative array and thereafter input vectors are applied to the circuit and a record is kept of the inputs and or the outputs on each of the gates in the circuit over a specified time period. In this way, it is possible to calculate the leakage power dissipation as well as both the toggle dynamic power and the transition dynamic power.

A method for providing symbolic access to a plurality of objects stored in a data storage is provided. An associative array comprising a plurality of associative array keys and a plurality of associative array values may be generated. A data array comprising a plurality of data array elements may be generated, such that each object stores a sortable property value of the object and an original offset of the object. A mapping table to map original offsets to modified offsets is generated. The mapping table includes a plurality of mapping table elements, and each associative array value is used as an offset into the mapping table, and each mapping table element storing a modified offset, each modified offset is a numeric value used as an offset into the data array.

Systems and methods are provided to track the state of a data forwarding component, such as a USB transaction translator, included in a downstream hub within a multi-speed bus environment. The data forwarding component accommodates communication speed shifts at the hub. The method may comprise receiving a split packet request defining a transaction, performing a lookup in an associative array using hub-specific information provided in the split packet request to determine whether an identifier is allocated to the data forwarding component, and if it is determined, based on the lookup, that an identifier is allocated to the data forwarding component, storing state information associated with the split packet request. The associative array may include multiple identifiers, each of which has an associated state field configured to track information, such as the number of packets-in-progress and bytes-in-progress to a particular data forwarding component.

An embodiment of the invention provides a circuit and method for reducing power in multi-way set associative arrays. A control circuit detects when the next cache access will be taken from the same cache way that the previous cache access was taken from. If the next cache access is taken from the same cache way as the previous cache access, the control circuit signals all the cache ways, except the cache way that was previously accessed, to not access information from their arrays. The control circuit also signals the tag arrays to not access their information and disables power to all the compare circuits. In this manner, power may be reduced when sequentially accessing information from one cache way in a multi-way set associative array.

A structured document expansion method converted a structured document into a format enabling easy manipulation by an application. A structured document is expanded into a format for easy manipulation without requiring complex knowledge. A two-stage associative array structure is adopted to enable easy manipulation of various types of data spanning the entire structured document merely through intuitive array operations, and both associative arrays are linked by sequence numbers. The latter-stage associative array can be accessed from the former-stage associative array using element names, and in addition, the latter stage can be made a two-dimensional associative array to represent hierarchical levels.

A method for transforming a plurality of random biological sequence data to an ordered biological data sequence, the method comprises reading a reference biological data sequence; generating a plurality of indexes based on the reference biological data sequence; generating a library, the library including the plurality of indexes; organizing the library into an associative array; reading the plurality of random biological sequence data; encoding the plurality of random biological sequence data; comparing the encoded plurality of random biological sequence data to the reference biological sequence; and aligning the encoded plurality of random biological sequence data to the reference biological sequence using an alignment algorithm to generate a plurality of alignment data.

A method and a processor for parallel processing of logic event simulation on circuits comprising a polarity of logic gates, the logic gates having interconnect lines therebetween, the processor (1) further comprising a main processor (2) and an associative memory mechanism (3), the associative memory mechanism (3) comprising a plurality of associative arrays (5, 6) and at least one result register, and there is provided accessible external memory (4) in which a circuit representation may be stored and divided into a plurality of segments, each of the segments having a segment identifier, which in turn has segment data associated therewith. The segment identifier and segment data being stored in a segment table (14) in the associative memory mechanism. Each of the segments may then be brought into the associative memory mechanism (3) for evaluation one at a time. There is additionally provided an amended result registering mechanism (8) to allow numerous tests and gate pairs to be carried out and recorded.

A method and system for precisely tracking lines evicted from a region coherence array (RCA) without requiring eviction of the lines from a processor's cache hierarchy. The RCA is a set-associative array which contains region entries consisting of a region address tag, a set of bits for the region coherence state, and a line-count for tracking the number of region lines cached by the processor. Tracking of the RCA is facilitated by a non-tagged hash table of counts represented by a Region Victim Hash (RVH). When a region is evicted from the RCA, and lines from the evicted region still reside in the processor's caches (i.e., the region's line-count is non-zero), the RCA line-count is added to the corresponding RVH count. The RVH count is decremented by the value of the region line count following a subsequent processor cache eviction/invalidation of the region previously evicted from the RCA.

The invention discloses a universal communication protocol processing method, comprising the following steps that S1, a universal communication protocol processing system is established; S2, an establishment module establishes a universal XML protocol file comprising all communication protocols; S3, an associative array obtaining module loads the universal XML protocol file into a two-dimensionalassociative array of a C++ standard template base, thereby obtaining an associative array comprising the universal XML protocol file; and S4, after an application program receives communication data,a universal communication protocol read module selects corresponding protocols in the associative array according to message headers of the communication data, hexadecimal values of words are obtainedaccording to start/end bytes and start/end bits of the words in the corresponding protocols, and practical values of the words are obtained according to types of the communication data, thereby finishing universal communication protocol processing. According to the method, an intermediate link of paper protocols is cancelled, a protocol analysis error rate can be effectively reduced, the manpowerand time cost is reduced, and moreover, application program architecture is prevented from being bloated.

The invention provides a verification method of processor random instruction reusability. The verification method includes: running a reference model and reading a binary iss.vmem instruction file into an associative array dut_mem and iss_mem; when the address, of instructions or the associative array of the reference model does not exist, randomly generating the instructions or data and respectively filling the instructions or data into the dut_mem and the iss_mem; running a processor, reading mem_dut through an external slave memory model, and when a non-existing address is read by the processor, filling in the dut_mem with random instructions continuously; after running of the processor is completed, writing the dut_mem into dut.mem, and storing the address of the dut_mem and corresponding data; reading the dut.mem to execute the next running of the processor. With the method, the instructions and the data that truly needed by the processor can be generated randomly, and good reusability is achieved.

An apparatus for servicing connections in a telecommunications network comprises N ports in communication with the connections through the network. Each port supporting a plurality of virtual links, and each virtual link supporting a plurality of rate groups. The apparatus comprises a processor for providing service to the connections. The apparatus comprises an associative array that stores timestamps of the virtual links and the rate groups. The apparatus comprises a scheduler which chooses which virtual link and rate group is to receive service from the processor as a function of a timestamp. An apparatus for servicing connections in a telecommunications network. The apparatus comprises N ports in communication with the connections through the network. Each port supporting a plurality of virtual links, and each virtual link supporting a plurality of rate groups. The apparatus comprises a processor for providing service to the connections. The apparatus comprises a memory that stores timestamps of the virtual links and the rate groups. The apparatus comprises a scheduler which chooses which virtual link and rate group is to receive service from the processor as a function of a timestamp by searching the timestamps while the timestamps are stored in the memory. A method for servicing connections in a telecommunications network.

The invention discloses a small-scale index data storage method for off-line searching. The method comprises the following steps: numbering data contents according to the sequence from 0, and storing titles into an array; splitting keywords of the data contents one by one; storing the split keywords into an associative array structure one by one, wherein keys of the associative array are the keywords per se, the value of the associative array is a large binary number, if the bit n is 1, the keywords exist in the nth piece of webpage or document, and if the bit n is 0, the keywords do not exist; after finishing analyzing all contents, conducting content compression on the associative array, namely compressing the value of the associative array, and conducting first compression on the continuous same bits by adopting a stroke compression method; conducting serialization output on the associative array into character strings, and conducting recompression on the character strings. The provided index data storage method has the characteristics of being simple in structure, compact in data, quick in query speed and friendly to combination query computation.

The invention provides an anti-fake system for fireworks and crackers based on a dot-matrix graph, and the system comprises a dot-matrix graph generation module which is used for generating the dot-matrix graph with a logic relation; a dot-matrix graph database which is used for storing the dot-matrix graph with the logic relation; a dot-matrix graph transmitting module which is used for enabling the dot-matrix graph to be transmitted to an external packaging printing end; a dot-matrix graph printing module which is used for printing the dot-matrix graph on each external package of the same batch, wherein one dot-matrix graph is just corresponding to the external package of one batch and the products of one batch; a correlation database which is used for carrying out the information binding of the dot-matrix graph, the external package and the products, forming a correlation array and storing the correlation array; and a cloud server which is used for storing the correlation array at a cloud side. According to the invention, the external packages of fireworks are printed with the dot-matrix graphs and two-dimensional codes for achieving fake prevention and tracing, and the system enables the producer, certificate, circulating and storage information of products to be able to be traced in the whole process, thereby facilitating the supervision and guaranteeing the safety of people's lives and properties.

The invention discloses a stamp album information management method based on a 2 dimensional code. The method includes the following steps: generating and storing an initial 2 dimensional code; printing the initial 2 dimensional code on a predetermined position of a stamp album; analyzing the initial 2 dimensional code and redefining the content of the 2 dimensional code so as to generate a self-defined 2 dimensional code which includes the index information of the stamp album; binding the self-defined 2 dimensional code to the index information to form an associative array and store the associative array; and uploading the associative array to a cloud server. The index information includes the types, themes, numbers, issuing years and other basic information of the stamps contained in the stamp album. The method assigns the 2 dimensional code to the stamp album, and redefines the 2 dimensional code so as to contain the index information of the stamp album, so that when it is needed to find a certain stamp album or a certain stamp in the stamp album, a user does not need to browse the stamp albums one by one, and can check the index information by scanning the 2 dimensional code to learn of substantial content. Therefore, the method can provide content indexing for the stamp albums and provide convenience for follow up indexing.

Implementations of the present specification provide a method and an apparatus for grouping transactions in a blockchain. The method includes: obtaining a first transaction in multiple transactions; obtaining a first variable accessed in the first transaction; reading a first value of a first belonging variable corresponding to the first variable; reading a first value of a first associated variable corresponding to the first transaction; if the first value of the first belonging variable is a numbering value of a second transaction in the multiple transactions, recording an association relationship between the first transaction and the second transaction in the associative array by performing an atomic comparative change operation on an atomic variable in an associative array; and grouping the multiple transactions based on the associative array.

The invention provides an autograph album information management method based on a two-dimensional code, and the method comprises the steps: generating and storing an initial two-dimensional code; enabling the initial two-dimensional code to be printed at a preset position of an autograph album; carrying out the analysis and content redefining of the initial two-dimensional code, so as to generate a customized two-dimensional code, wherein the customized two-dimensional code comprises the brief introduction information of the autograph album; enabling the customized two-dimensional code to be bound with the brief introduction information, and forming and storing a correlation array; and uploading the correlation array to a cloud server, wherein the brief introduction information comprises at least one of the following parts: the type of the autograph album, involved events, time section, place and content. Through adding the two-dimensional code to the autograph album, the method carries out the customization of the two-dimensional code, so as to enable the two-dimensional code to be embedded in the brief introduction information of the autograph album. When one autograph or one picture is needed, there is no need to check pages one by one, and even no need to take out the autograph album from a bookcase. The main content can be obtained through scanning the two-dimensional code, thereby providing a content index for the autograph album, and bringing convenience to users for subsequent look-up.