11 results about "Limited capacity" patented technology

The invention relates to the technical field of industrial personal computers, and discloses a built-in power supply and self-adaptive expansion interface system of an industrial personal computer, and the system comprises an obtaining module which is used for obtaining a power feature table of a plurality of expansion interfaces in the industrial personal computer; the calculation module is used for calculating the distributable total power of each expansion interface and creating a power distribution table of each expansion interface; the power capping module is used for detecting the actually measured power of each expansion interface based on the power distribution table, and when the actually measured power exceeds a first peak power value, each expansion interface executes power capping and outputs an execution result; and the peak power adjustment module is used for dynamically adjusting the first peak power value according to the heat dissipation area temperature and the execution result of each expansion interface to obtain a second peak power value. The power distribution problem of the multiple PCIe expansion interfaces under the limited capacity of a built-in power supply of the industrial personal computer is solved by constructing a guarantee power and elastic power pool; and the stability of concurrent work of multiple expansion cards is improved.

A method and apparatus for placing data in a hierarchical memory are disclosed. A computing device comprising a hierarchical memory composed of a first memory and a second memory, wherein the first memory has a faster access speed than the second memory but has a limited capacity, and the second memory has a slower access speed than the first memory but provides a larger capacity, and a method for placing a packet received through a network into the hierarchical memory comprises: a step of extracting layout information from the payload of the packet; a step of storing the layout information in a queue corresponding to the socket in which the packet was received; a step of determining a destination memory among the first memory or the second memory based on the size of a data field included in the layout information stored in the queue; a step of allocating a space corresponding to the size of the data field to the determined destination memory using a memory allocator; and a step of reading data from the socket in which the packet was received and storing it in the allocated space.

The application discloses a longest prefix matching storage device, method and chip based on TCAM, and relates to the technical field of data communication. The device comprises a TCAM and an AD SRAM, the TCAM comprises a plurality of memory banks and is virtually divided into a non-tail sub-table and a tail sub-table; the non-tail sub-table stores non-tail sub-sections in the LPM common prefix which are not masked and need to be accurately matched with full memory bank bit width; the tail sub-table stores tail sub-sections in the LPM common prefix with masks; each non-tail sub-section of the same common prefix is stored in an independent entry; and the AD SRAM corresponding to the tail sub-section stores a non-common prefix subset pointer. The application solves the problems of TCAM resource waste and limited LPM rule storage capacity in the prior art, improves the TCAM resource utilization rate and the chip LPM capacity specification through sub-table division and sub-section sharing.

The application discloses a longest prefix matching storage device, method and chip based on TCAM, and relates to the technical field of data communication. The device comprises a TCAM and an AD SRAM, the TCAM comprises a plurality of memory banks and is virtually divided into a non-tail sub-table and a tail sub-table; the non-tail sub-table stores non-tail sub-sections in the LPM common prefix which are not masked and need to be accurately matched with full memory bank bit width; the tail sub-table stores tail sub-sections in the LPM common prefix with masks; each non-tail sub-section of the same common prefix is stored in an independent entry; and the AD SRAM corresponding to the tail sub-section stores a non-common prefix subset pointer. The application solves the problems of TCAM resource waste and limited LPM rule storage capacity in the prior art, improves the TCAM resource utilization rate and the chip LPM capacity specification through sub-table division and sub-section sharing.

Embodiments of the present application relate to the technical field of computer, and particularly relate to a distributed system and a data processing method, which are used to solve the problem of limited capacity of database nodes in a deposit core system and the upper limit of capacity expansion. The distributed system comprises N nodes, wherein each node comprises a database, the database structures and parameters of any two nodes are the same, and N≥2; any node in the N nodes is taken as a first type node, and the first type node is used for: receiving a first instruction; analyzing the first instruction to determine identification information involved in the first instruction; when the identification information involved in the first instruction further comprises second identification information, processing the first instruction, and generating a second instruction according to the first instruction, wherein the second identification information is located in a database of a second type node; and sending the second instruction to the second type node, so that the second type node processes the second instruction.

The invention relates to the field of electric energy quality treatment of an electric power system, and discloses a method for improving the electric energy quality of a limited-capacity system containing a pulse load, and the method comprises the following steps: S1, Clark conversion; s2, positive and negative sequence separation and Park transformation; s3, direct current component extraction; s4, performing inverse transformation and instruction synthesis, and synthesizing required compensation instruction current; s5, on the basis of a timing hysteresis comparison method, a fixed-frequency timer is used for replacing a traditional hysteresis comparator, current tracking of a fixed switching frequency is achieved, and the electric energy quality of a limited-capacity system containing a pulse load is improved, and the system is characterized by comprising a limited-capacity power source, the pulse load and an SVG device connected to an alternating-current bus in parallel; according to the scheme, through an improved SVG detection and control strategy, the electric energy quality problem of a limited capacity system containing a pulse load is effectively solved, and the power supply reliability and stability of the system are improved.

The application relates to the technical field of network communication, in particular to a network communication device deployment method in an SDN network and a network communication device. The method comprises the following steps: a controller detects the flow table capacity of an access switch, and establishes a unique identifier and a capacity archive; a service flow table request from an upper layer is analyzed, matching fields and action instructions are extracted, and the same action flow table is aggregated according to user groups / service categories, priority of the aggregated flow table is allocated, the usage rate of the flow table is monitored in real time, when the threshold is reached, the flow table with low priority and the latest missed flow table is unloaded and backed up, when the corresponding traffic is detected, the flow table is retransmitted and the current lowest level flow table is unloaded, the aggregated flow table is sent to a target switch and an acknowledgement is received, if the capacity is insufficient, dynamic scheduling is carried out, and after the success, relevant information is recorded. The process reduces the number of flow tables, guarantees core services, avoids flow table exhaustion, and realizes efficient service support under limited capacity.

A memory sub-system configured to schedule the transfer of data from a host system for write commands to reduce the amount and time of data being buffered in the memory sub-system. For example, after receiving a plurality of streams of write commands from a host system, the memory sub-system identifies a plurality of media units in the memory sub-system for concurrent execution of a plurality of write commands respectively. In response to the plurality of commands being identified for concurrent execution in the plurality of media units respectively, the memory sub-system initiates communication of the data of the write commands from the host system to a local buffer memory of the memory sub-system. The memory sub-system has capacity to buffer write commands in a queue, for possible out of order execution, but limited capacity for buffering only the data of a portion of the write commands that are about to be executed.

The invention discloses a diversified interaction implementation method integrating social binding and multi-type games, belongs to the technical field of internet social and game application, and aims to solve the problems that the existing platform social and game functions are separated, the bearing capacity is limited, the compliance is insufficient and the user stickiness is low. A hardware architecture of'independent server cluster + multi-level cache + load balancing 'is adopted, independent research and development free games and third-party external games are integrated, and the problem of compatibility of multi-type game interfaces is solved through an adapter mode; a close friend and CP bidirectional binding mechanism is designed, interaction functions such as team-forming privilege, accompanying order receiving and exclusive room are matched, and a'social contact-game-compliance income 'closed loop is constructed; deep fusion of social contact and multi-type games is realized, high-concurrency smooth interaction without upper limit players is supported, krypton threshold is reduced, virtual currency transaction risk is avoided, user stickiness and platform universality are remarkably improved, and the method is suitable for diversified interactive APP development and application.

In known implementations of distributed ledgers, all of the transactions linked to a service are archived in nodes involved in the implementation of the service. This makes it possible to verify the authenticity and the integrity of the transactions and to ensure that the service that is provided is compliant. This poses a problem for nodes having limited storage capacities, some ledgers possibly reaching a significant size and ultimately potentially making it impossible for some modes to be able to record new transactions, thus causing a problem in terms of controlling the actual execution of the operations linked to these transactions. The present solution allows some nodes involved in the implementation of a service to be able to empty their local ledgers without this jeopardizing the correct operation of the associated distributed ledger. The transparency and the permanence of the transactions relating to the service are thus guaranteed.