Directory distributed data structure implementation method and system

By using a directory-based distributed data structure, distributed hash tables, and synchronizers, efficient distributed storage and operation of data are achieved in a non-cached consistent multi-core architecture. This solves the problems of scalability and low performance of traditional data structures in multi-core processors and adapts to the high-efficiency data operation requirements of non-cached consistent multi-core architectures.

CN121388043APending Publication Date: 2026-01-23YUANQIXIN (SHANDONG) SEMICONDUCTOR TECHNOLOGY CO LTD
0 Cites 0 Cited by

Patent Information

Application Number
CN202511565260.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-10-30
Publication Date
2026-01-23

AI Technical Summary

Technical Problem

Traditional fully cached coherent architectures suffer from scalability bottlenecks and low performance in multi-core processors. Existing distributed data structures cannot effectively adapt to non-cache-coherent/partially cache-coherent multi-core architectures, resulting in high communication overhead and difficulty in achieving efficient data operations.

Method used

It adopts a directory-based distributed data structure, which divides the multi-core architecture into consistency islands, uses distributed hash tables and synchronizers to achieve cross-island communication, and combines hardware FIFO mailboxes and DMA transfer to dynamically expand the data structure, ensuring linear consistency and efficient operation.

Benefits of technology

It achieves scalability and performance improvement of data structures under a non-cached consistent multi-core architecture, reduces cross-island communication overhead, supports high-concurrency operations, and is compatible with programming models of high-level languages ​​such as Java.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention discloses a directory-type distributed data structure implementation method and system, belongs to the technical field of data storage and concurrent processing, and aims to solve the technical problems of poor expandability and low performance of a traditional data structure under a non-cache consistency / partial cache consistency multi-core architecture. Comprising the following steps: dividing a multi-core architecture into a plurality of consistent islands, connecting the islands through a high-speed packet-loss-free network, and performing cross-island communication between cores through two communication primitives; a distributed hash table DHT is constructed, each server node maintains a plurality of hash buckets, the hash buckets adopt a linked list to solve conflicts, and a target server node and the hash buckets are positioned through a hash function; a server node is selected as a synchronizer, the synchronizer is used for distributing or recycling operation key values for a client side, the client side achieves data structure operation of stacks, queues and double-end queues through combination of two short messages and one DHT primitive, and linearization points of all the operations only depend on the moment when the synchronizer returns the key values.
Need to check novelty before this filing date? Find Prior Art