23 results about "Doubly linked list" patented technology

The application discloses a kind of real-time database monitoring methods based on ordered queue, including according to system design throughput and machine configuration, set initial parameter respectively set working thread and distribution thread number and memory capacity alarm threshold, according to the number of working thread adjustment shunt storage queue number ensure that thread queue number match, management node starts, start receiving heartbeat request, and according to preset hash algorithm is shunted storage, new received heartbeat request is stored in ordered double linked list queue head, then according to host IP information to hash table inquires whether heartbeat record exists, if the new received heartbeat record does not exist, for new online client, client information is stored to hash table then triggers new online event and persists to client database table write-in process ends.The application solves the problem that a large amount of data heartbeat information detection detection complexity rises exponentially with data volume rising by hash and double linked list structure.

The application provides a method for optimizing virtual NVMe read-write performance through an LRU algorithm and a virtual NVMe system, and the method comprises the following steps: constructing a cache management architecture in cooperation with a hash table and a double-linked list, quickly positioning a cache node corresponding to an internal address of an SSD through the hash table, and managing the access order of the SSD address through the double-linked list; when the NVMe performs an SSD read-write operation, the LRU algorithm is first called, and if there is no address in the hash table to execute the read-write file; a linked list order adjustment thread is created when the LRU algorithm is initialized, the node data of the longest non-accessed node exceeding the length of the linked list is flushed to the SSD mirror file, and then the node is deleted; when the read-write data is greater than the size of the linked list node data, the hash mapping is refreshed. The application combines the LRU algorithm, maps the commonly used internal address of the SSD and the corresponding data block, directly operates the memory to read and write the commonly used data, optimizes the read-write mode of the existing virtual simulation NVMe, and further improves the performance of the virtual simulation NVMe in the virtual hardware system.

According to the updating method of the FC switch monitoring lookup table based on the LFU, the storage of the monitoring port lookup table is realized by adopting the idea of Robin Hood Hashing, and according to the strategy, a key with a longer detection distance hijacks the position of a key with a shorter detection distance when a Hash conflict occurs during insertion, so that the query performance is optimized, and the updating method is suitable for a high-performance network scene; secondly, modular design is adopted, message IDs existing in a monitoring port lookup table are stored in a grouped mode according to the access frequency through a dictionary and a double-linked list structure, and global sorting is avoided; thirdly, when the message ID stored in the monitoring port query table is full and updated, a double-layer elimination strategy is adopted, the message ID which is least recently used can be efficiently positioned, all frequencies do not need to be traversed, rapid updating is achieved, the method is suitable for a high-concurrency or large-scale FC network communication scene, and therefore the judgment efficiency of the target motion state is improved.

This application provides an intelligent routing function optimization method and system based on an intelligent vehicle power domain control platform, belonging to the field of intelligent vehicle electronic control technology. It addresses the problems of resource contention, excessive processor load, insufficient real-time performance, and poor scalability in in-vehicle network routing functions in related technologies. This method employs an architecture that separates the management plane and data plane. It pre-generates routing numbers encoding source, path, and destination information for communication relationships, and quickly extracts information based on these numbers through bit operations to execute routing decisions. Furthermore, it combines doubly linked list cache management, multi-core affinity scheduling, and multi-level resource provisioning strategies to achieve efficient cache resource management, significant optimization of processor load, and an overall improvement in system real-time performance and reliability.

This invention discloses a workshop-attached mother-daughter vehicle joint scheduling method and system, belonging to the field of intelligent manufacturing and automated logistics technology. The method is based on the Discrete Invading Weeds Optimization Algorithm. First, it reads task and vehicle information and encodes the scheduling solution using a doubly linked list structure, uniformly representing the task sequences of the mother and daughter vehicles. It calculates the fitness of the scheduling solution and determines the number of seed individuals to be generated based on the fitness. New scheduling solutions are generated using neighborhood insertion, neighborhood swapping, and path swapping operations, ensuring the logical consistency of the mother and daughter vehicle sequences and that dependency constraints are not violated. The current population is merged with the newly generated seed individuals, sorted by fitness, and the optimal individual is retained to update the global optimal solution. When the termination condition is met, the optimal solution is output as the mother-daughter vehicle scheduling scheme. This invention effectively solves the problems of complex dependency constraints, deadlock susceptibility, and low optimization efficiency in mother-daughter vehicle collaborative scheduling, achieving efficient collaborative utilization of vehicle resources.

The invention discloses an inter-core communication method based on a PLC multi-core system, and relates to the technical field of inter-core communication, the PLC multi-core system is divided into a control core and a calculation core, and initialization configuration is carried out for different types of cores; a hybrid communication mechanism is set, the hybrid communication mechanism comprises an openAMP architecture and a shared memory mechanism, and environment establishment is carried out for the two communication modes; establishing a message type identification mechanism, and automatically classifying according to message features; constructing a self-adaptive routing algorithm to select an optimal communication mode; constructing a double linked list optimization management mechanism, calculating message priorities, and setting message sending time in a double linked list; when the PLC multi-core system sends a message, a sending core selects a core type according to the optimal communication mode, and openAMP architecture communication and shared memory mechanism communication are executed respectively according to the core type; and checking a communication result, executing an automatic retransmission strategy when the communication fails, and calculating retransmission times and retransmission intervals.

This invention relates to a dynamic bidirectional skip list storage structure and processing method for matrix data sets. The dynamic bidirectional skip list storage structure includes a data field at the bottom and an index field above the data field. The data field stores the original data, and the index field stores index data. The data field includes multiple data unit structures at the same level, and the index field includes multiple levels, each level containing multiple data unit structures. Data unit structures within the same level are linked from smallest to largest using a doubly linked list, and data unit structures at different levels are linked to the same data range using inter-level linked lists. Based on this dynamic bidirectional skip list storage structure, the calculation processes of dataset merging, difference, searching, and deletion during the optimal reordering of the power flow Jacobian matrix can be efficiently implemented, thus achieving a balance between storage and computational efficiency.

The embodiment of the invention provides a page updating method based on a double linked list, electronic equipment, a storage medium and a program product. The method comprises the following steps: in response to an updating instruction of a target page, synchronizing updating information in the updating instruction to a linked list node matched with the updating information in a preset double linked list; wherein the updating instruction is used for indicating to update contents in a target page, and the updating instruction comprises updating information; the double linked list comprises at least one linked list node, and the linked list node corresponds to a sub-view in a target page; the preset double linked list is a double linked list corresponding to a target page; and based on the preset double linked list, updating a sub-view corresponding to a linked list node in the preset double linked list so as to update the target page. The method is used for achieving the effects of saving the maintenance cost and realizing stable updating of the front-end page.

The application discloses a search method and system for a Costas sequence based on multithreading, and the method comprises the following steps: inputting the order of the Costas sequence to be searched; establishing a framework data structure of a bidirectional linked list, and generating a permutation matrix corresponding to the order through recursive iteration; generating a task for judging a check matrix corresponding to the permutation matrix, and submitting the task; submitting the task received by S2 and S3, creating a thread pool by using a thread pool technology, and performing multithread operation by combining a task stealing technology, so as to accelerate the judgment on the check matrix; and collecting the tasks, finally obtaining the number of the Costas sequences and the search time, and comparing with a traditional multithread search. The search method and system for the Costas sequence based on the multithreading realize efficient utilization of threads, improve the search speed, and provide a wider application prospect.

The embodiment of the application is suitable for the technical field of computers, and provides a resource lock management method and device, electronic equipment and a storage medium, wherein the resource lock management method comprises the following steps: determining a hash value corresponding to a unique identifier of a to-be-locked resource; and determining a first hash bucket corresponding to the hash value in a preset hash table; wherein the preset hash table comprises a plurality of hash buckets, the plurality of hash buckets correspond to a same bidirectional linked list, and each hash bucket corresponds to a linked list interval of the bidirectional linked list; each lock node on the bidirectional linked list represents a resource lock of a to-be-locked resource; determining a lock node of the to-be-locked resource based on a linked list interval corresponding to the first hash bucket; and obtaining the resource lock of the to-be-locked resource from the lock node of the to-be-locked resource.

The invention relates to the technical field of software, and discloses a manufacturing industry task and resource matching method and system, and the method comprises the steps: obtaining tasks and resources, including time constraint information and resource demand information of the tasks; processing the available time of each resource, and converting the available time period of the resource into a double linked list structure formed by a plurality of time slice nodes; calculating a corresponding task priority field for each task object based on the time constraint information of the task, the resource demand information and a preset business rule, and sorting the task objects according to the task priority fields; and according to the sequence of the sorted task objects, performing resource matching processing on each task object in sequence, and generating a task and resource allocation result. The resource time slices are managed by using the double linked list, so that the query, insertion and deletion operations of the time window are very efficient, and the method is particularly suitable for a frequently and dynamically updated manufacturing environment.

The application discloses a method and device for improving the quality of job category prediction samples, comprising the following steps: S1, improving the data quality by using a double-linked list, and cleaning the data by using a clustering method; S2, sequentially using a pre-training labeling model, a vector model and a classification model to label, vector and classify the input processing, and integrating a job category tree knowledge graph into the model in advance; and S3, using a multi-task training method to reduce the model perplexity. In the method for improving the quality of job category prediction samples, the data quality is improved by using a double-linked list, the data is cleaned by using a clustering method, the data accuracy is enhanced, a large pre-training model is integrated with hierarchical features, the iteration efficiency is improved, a multi-task joiner training method is adopted to reduce the perplexity, a business database is used to train a vector model, a section vector model and a job category prediction model, the representation of the vector is enriched, and the quality of the job category prediction samples is improved.

The application relates to a memory data operation method, device and computer readable storage medium. The method comprises the following steps: when a memory data operation request is received, performing corresponding operation on a high-concurrency hash mapping corresponding to a client memory; if the corresponding operation on the high-concurrency hash mapping corresponding to the client memory is successful, acquiring a linked list lock of a bidirectional linked list corresponding to the high-concurrency hash mapping, wherein a head node of the bidirectional linked list is used for storing the latest data, and the linked list lock is used for locking the operation on the bidirectional linked list; if the linked list lock of the bidirectional linked list is successfully acquired, performing an operation corresponding to the client memory data operation request on the bidirectional linked list; and releasing the linked list lock of the bidirectional linked list after the operation corresponding to the client memory data operation request on the bidirectional linked list is completed. The technical scheme can realize the fast operation of the memory data on the client.

The invention relates to the technical field of whiteboard software handwriting storage modeling, and provides a handwriting erasing and segmenting method for solving the problem that an existing handwriting erasing and segmenting method is not perfect and accurate enough, which comprises the following steps of: dividing handwriting drawing into a mode of connecting a plurality of path graphs and a method of erasing based on 2D (two-dimensional) graph intersection calculation and difference set taking; any position of the handwriting can be accurately erased; meanwhile, the position of the path of the rest part of the erased handwriting in the linked list can be quickly positioned by adopting an adjacent calculation mode, the handwriting can be quickly segmented while being erased through the double linked list, and the segmented handwriting can be immediately dragged, zoomed and the like after being erased, so that the operation efficiency after the handwriting is erased is improved.

The invention discloses a first-in first-out data structure based on key value pair search and a processing method, relates to data processing and data storage technologies, and comprises a three-layer closed-loop architecture controlled by a hash index, an annular array and metadata. Wherein the Hash index layer is used for receiving an external key value operation request and positioning a data position in an annular array through index mapping; the annular array storage layer is used for physical storage and sequence management of data, an annular array of a continuous memory is adopted, and FIFO sequence management is achieved through a compact data unit and head and tail pointers; and the metadata control layer is used for maintaining the running state of the structure and providing parameter support for operation execution, and the metadata control layer adopts atomic variables to store core state parameters and realizes lock-free synchronization through CAS operation. The storage structure is optimized, the precursor / subsequent pointers of the double linked list are cancelled, a compact storage mode is adopted, and the memory utilization rate in a small data scene is improved.

The application discloses an IP address management method and device. The method comprises the following steps: in response to a request of a client for applying for an IP address, determining an allocable IP address through a target bidirectional linked list corresponding to a target array, wherein the target array stores data objects of each IP address in an IP address pool, the target bidirectional linked list stores data objects of unallocated IP addresses, and the data objects comprise a host number of the IP address, an allocation state and linked list pointer information; allocating the IP address to the client, adjusting the allocation state in the corresponding data object, and unbinding the data object from the target bidirectional linked list; in response to a request of the client for returning the IP address, determining the data object of the IP address in the target array by taking the host number of the IP address as an array index; adjusting the allocation state in the data object, and adding the data object to the target bidirectional linked list. The application solves the technical problem that the allocation and recovery management of IP addresses in the related art cause large performance overhead.

The invention discloses a cache elimination method and device, equipment, a storage medium and a computer program product, and relates to the technical field of data processing.The method comprises the steps that cache data are grouped, a plurality of cache data groups are obtained, and the cache data in the cache data groups are stored in corresponding double linked lists; when it is detected that the cache space is insufficient, non-critical cache data groups are determined from the cache data groups; and determining and eliminating to-be-eliminated cache data in the target double linked list corresponding to the non-critical cache data group. The cache data can be grouped, and the to-be-eliminated data in the double linked list corresponding to the non-key cache data group is eliminated when the cache space is insufficient, so that the technical problem that the cache data cannot be effectively eliminated when large-scale data is processed by an LRU cache elimination algorithm in the prior art is solved.

The application discloses a serial image multi-connected domain segmentation method based on a linked list structure and belongs to the field of image real-time processing. The method flexibly uses a bidirectional linked list data structure, uses row section statistical information to reserve feature judgment on an upper neighborhood, and uses a connected domain linked list to perform real-time calculation on a centroid positioning key quantity. The method can realize the effect of centroid positioning of a whole image through one-time sequential traversal and is suitable for serial stream form image information output on a real-time hardware image platform and is very suitable for application scenes such as high-frame-rate point target measurement and high-dynamic weak small target continuous tracking.

The application belongs to the field of computer systems and storage, and discloses a Linux system memory allocation accurate statistics method, device, equipment and storage medium, the method comprises the following steps: classifying memory space; when system memory application is successful each time, creating a node structure body for memory statistics, and filling the classified memory space information of the successful application into the node structure body; creating a chain type double-linked list for memory statistics; when system memory application is successful each time, adding the node structure body information to the tail of the double-linked list; when the successfully applied memory is released in the subsequent running process, removing the corresponding node structure body information from the double-linked list; and based on the node structure body information in the double-linked list, the system memory is counted. The application can accurately count the number and direction of memory allocation in the system, and can quickly count the leaked memory and locate the memory leakage position when the system has memory leakage.

The disclosure provides a method, device, equipment and medium for preventing business repeated submission, and relates to the technical field of big data. The method comprises the following steps: providing a token generator, the token generator comprising a ring token issuing queue and storing a plurality of token identifiers; providing a first database and a second database, the first database storing token identifiers in transactions, and the second database storing token identifiers of completed transactions; in response to an instruction that a business request is verified, obtaining a token identifier as a business token identifier; before executing a business transaction, judging whether the first and second double-linked lists contain the business token identifier; in response to the first and second double-linked lists not containing the business token identifier, inserting the business token identifier into the first double-linked list, and enabling a target node to execute a business transaction associated with the business request; and in response to the business transaction being executed, inserting the business token identifier into the second double-linked list, and deleting the business token identifier in the first double-linked list.

The invention discloses a dynamic full-redundancy synchronization method for data of a redundant controller. The method comprises the following steps: dividing to-be-synchronized data into a plurality of data blocks; when the data block is modified, quickly positioning the position of the data block in the double linked list through the hash table and moving the data block to the head of the double linked list so as to mark the data block as the latest data; if the data is new data, creating a new node, inserting the new node into the head of the double linked list, and recording in the hash table; starting a priority synchronization task, regularly selecting data from the head of the double linked list, and synchronizing the data to a standby controller; and starting a periodic synchronization task, and regularly selecting a data synchronization standby controller from the tail part of the double linked list. Through the dynamic priority synchronization task and the full-coverage periodic synchronization task, full-automatic and full-coverage data synchronization without manual intervention is realized, and the reliability and synchronization efficiency of the redundancy control system are effectively improved.

The invention relates to a matrix data set dynamic bidirectional skip list storage structure and a processing method, and the structure comprises a data field part located at a bottom layer and an index field part located above the data field part. The data field part is used for storing original data, and the index field part is used for storing index data; the data field part comprises a plurality of data unit structures located at the same hierarchy, the index field part comprises a plurality of hierarchies, and each hierarchy comprises a plurality of data unit structures; wherein the data unit structures in the same hierarchy are linked from small to large through a double linked list, and the data unit structures among different hierarchies are linked with the same data interval range through inter-hierarchy linked lists. Based on the dynamic bidirectional skip list storage structure, calculation processes such as union set, difference set, search and deletion of data sets in the optimal reordering process of the load flow Jacobian matrix can be efficiently realized, so that the balance of storage and calculation efficiency is realized.

The application provides a session management method and device, electronic equipment and storage medium, relates to the technical field of communication, and the method comprises the following steps: receiving a session request for a target device; obtaining a target network address translation (NAT) session to which the session request belongs; determining a timeout duration of the target NAT session according to a target data transmission protocol corresponding to the session request; updating a timeout time of the target NAT session according to the timeout duration and a current time; adding the updated target NAT session into a double-linked list corresponding to the target data transmission protocol; and deleting a NAT session that is timed out in the double-linked list corresponding to the target data transmission protocol. By setting the double-linked list and the corresponding timeout duration according to the data transmission protocol, the deleted session can be deleted in time, and the retained session exists in the session all the time, so that the data packet forwarding efficiency is effectively improved, and resource waste is reduced.