33results about How to "Reduce update overhead" patented technology

The invention provides a hashing method for realizing hashing insert operation on a hash table; the hash table comprises a plurality of buckets, the bucket comprises an insert counter and a delete counter, the insert counter is used for recording the number of insert elements in the bucket, and the delete counter is used for recording the number of the delete elements in the bucket; the method comprises the following steps: the element to be operated is mapped to at least one bucket of the hash table according to hash function, and the bucket is called as a candidate bucket; a target bucket isfound from the candidate buckets according to selection principle of the target bucket; the elements to be inserted are inserted in the target bucket; weather the inserted elements have effect on thestorage position of the stored elements in the candidate bucket is judged, if the storage positions of the stored elements can not meet the selection principle of the target bucket, the storage positions of the stored elements are re-adjusted; the hashing method also comprises the step of accumulating the value of the insert counter of the bucket.

The invention discloses a hybrid cloud storage method based on multi-level cache. The method comprises the following steps: a user joins a user group for login according to the local area network where the user is, and sends a user name and a password for user authentication to a super node of the region where the user group is, the super node achieves authentication of the user according to the received user name and password, the user receives a catalog view returned from the super node and metadata information of all files and sends the catalog view to a group leader node of the user group, the group leader node judges whether the buffer memory space of the group contains files in the catalog view according to the received catalog view, and if yes, feeds the IP address of the node in which the files are saved in the buffer memory space of the group to the user, and the user determines the optimal access path of each file in the catalog view according to the received feedback information. The hybrid cloud storage method allows the user to access data from the user group cache and the super node layer cache which have lower network delay, thereby lowering the network delay of the user data access.

The invention discloses a method for realizing transverse expansion of a distributed account book based on a fragmentation mechanism. The method comprises the following steps: (1) formulating a verifier fragmentation time period, within any time period, carrying out fragmentation combination on all verifiers by using a distributed random number generation protocol, and dividing the verifier fragmentation into a plurality of fragmentations; (2) carrying out concurrent processing transaction in each fragment, and regularly generating consistent state blocks; (3) selectively carrying out double verification in the transaction process to guarantee the security of the transaction; and (4) adopting a cross-fragment submission protocol, carrying out a locking/unlocking mechanism on the client, sothat the cross-fragment atomic processing transaction of the client is realized. Based on the above steps, in order to provide a horizontally extended method which does not damage long-term security,the method deploys a state block in each fragment to reduce storage space and update overhead, adopts a trusted but verified two-layer model to reduce small transaction delay, and adopts an atomic submission protocol among multiple fragments to realize a cross-fragment atomic submission transaction function.

The invention discloses a large-scale-cloud-data-center-oriented server cooperative monitoring method. The mode that servers sense and monitor each other replaces a monitoring mode of a centralized structure, the self-managing capacity of the servers is improved, the monitoring burden of the monitoring servers is effectively lowered, and performance bottlenecks and singe point failure risks are removed. A cooperative monitoring mechanism and a functional component are provided, and the working steps of the cooperative monitoring mechanism are given when data servers are added into a system and a single data server and a group of data servers lose efficacy. The method is used in a large-scale cloud data center, system response time is obviously shorter than the response time of a centralized monitoring mechanism, load balance is effectively achieved, low updating expenditure is achieved, and under the situations that the data servers lose efficacy in a discrete mode and in a group mode, all the data servers which lose efficacy can be detected effectively.

The invention discloses an optimization processing method for an error correcting code in a solid state disk system. The optimization processing method is characterized by comprising the steps of combining a plurality of continuous logic data pages into a data page group, storing data pages and overlong error correcting codes in a flash memory according to a page view, and intensively storing the overlong error correcting codes of a data page group in the flash memory into a special flash memory page. According to the method, the read-write visiting time is saved, the problems of read amplification and high visit expense caused when the data pages in the other flash memory page are read are avoided, and the integral performance of a solid state disk is optimized. The invention further discloses application of the optimization processing method. By virtue of the method, the read and write caching algorithms are optimized; by caching the overlong error correcting codes, the cache hit ratio is increased; and by virtue of batch write-back of the overlong error correcting codes of multiple data pages, the updating expense is reduced, furthermore, the integral performance of the system is improved, and the service life of the solid state disk is prolonged.

The invention provides a user access cancelling control method based on agent re-encryption. The user access cancelling control method comprises the following steps: when a user needs to be canceled from a system, generating relevant parameters of key updating by an attribute management mechanism related with user attributes; updating an accessing private key of a non-cancelled user in the system, so as to receive a data access request of the non-cancelled user by the system; sending a secret key for updating an information ciphertext to a cloud service region by the attribute management mechanism and carrying out ciphertext updating on a ciphertext without attributes by a cloud server; and deleting the user and the relevant data from an accessible user list in the system so as to cancel an access authority of the user to the system. According to the user access cancelling control method, only the ciphertext related to the attributes to the cancelled user is updated, without the need of updating all the ciphertexts, so that the communication expenditure of the whole system is reduced, the operation efficiency of the whole system is improved and the safety of the system is also guaranteed.

The embodiment of the invention provides a rule set updating method and device and a rule matching method and device and relates to the technical field of computers. The rule set updating method and device and the rule matching method and device are applied to a tristate content addressing memory. The rule set updating method comprises the steps that in first rule groups obtained by dividing target rule sets of the tristate content addressing memory, target rule groups which target rules belong to are determined; then, the target rules are inserted into the target rule groups to complete updating of the target rule sets, wherein for any rule having overlapping relation in the target rule sets, the quantity of rules, overlapped with the rule, in the first rule groups is not greater than thetotal quantity of the rules, overlapped with the rule, in the target rule sets. By applying the rule set updating method and device, updating expenditure for rule sets can be reduced during rule setupdating.

The invention discloses a routing processing method and device under an EVPN, and a medium. The method is applied to a first VTEP and comprises the steps that in response to a switching instruction ofswitching from a two-layer VNI to a three-layer VNI, related routing information of the two-layer VNI is deleted, and the switching instruction is issued by binding the two-layer VNI to a corresponding VRF; and after the switched three-layer VNI takes effect, full-amount routing update is carried out through interaction with a second VTEP, and the second VTEP is a BGP neighbor of the first VTEP.According to the invention, switching between the two-layer VNI and the three-layer VNI can be realized, configuration is simple, and the cost is low.

The invention relates to an X-coding extension method capable of quickly recovering and realizing load balance. The method comprises the following steps: performing coding extension based on X-coding used in various storage array systems, additionally arranging redundancy equipment, further reducing the total quantity of blocks required for single disk recovery on the premise of ensuring that double-disk error is allowed and reducing the IO bottleneck of the single disk recovery, thereby improving the system single disk recovery efficiency, shortening the reconstruction time, realizing the system load balance and finally realizing the improvement of system service quality. With respective to any single data disk error in an original system, the total quantity of fragment required for system single disk recovery can be reduced; with respective to any single disc error in the original system, the possible load bottleneck of the original system in the single disk recovery process can be eliminated, so that the load balance of the equipment is realized; by using binary AND-XOR, the update overhead of an additionally-arranged redundant disk is reduced, so that the service life of the redundant disk is prolonged.

This invention relates to a method for realizing the longest prefix address route look up which sets up two stages of route information lists: a 64 segment list and a compressed offset list, among which, the route index value in the offset list is compressed to the difference between the said index value and the primary route index for storing route look-up information. When looking up, high 16 order of the being looked-up target IPV4 address is used as the index value to position the item in 64k segment list and judge if the compressed offset list pointer is invalid, if so, the route index is the next jump route index value corresponding to IPV 4 address, if not, the pointer value, primary value and width corresponding to compressed offset list are got to get the next jump route index value of IPV4by accessing offset list items with the low 16 order of the IPV4.

The invention discloses a virtual object display method and a related device, when a plurality of virtual objects comprising a plurality of parts need to be displayed, each part has a corresponding skeleton grid, so skeleton grids of a plurality of virtual objects are loaded, a plurality of virtual objects are grouped according to the motion information corresponding to a plurality of virtual objects to obtain a plurality of virtual object groups; the movement of the virtual objects in the same virtual object group at the same moment is consistent; a plurality of skeleton grids corresponding to the virtual objects in the same virtual object group are combined to obtain a main skeleton grid, and the corresponding virtual object is drawn and displayed according to the main skeleton grid. According to the method, a plurality of position updating nodes are reduced into one position updating node, so the position updating expenditure of a plurality of skeleton grids is greatly reduced, the drawing speed of the display card is increased, and fluency of a picture displayed on a screen is improved; the overhead is greatly reduced, so the number of players on the same screen does not need to be reduced, and the player experience is improved.