7 results about "Election algorithm" patented technology

An information handling system may include at least one processor and a memory. The information handling system may be configured to: perform a first primary node election among a plurality of nodes of an information handling system cluster to determine a first primary node, wherein the first election is based on a common election algorithm; determine a cloud intent associated with the plurality of nodes; in response to a determination that the cloud intent is associated with an additional primary node requirement, perform a second primary node election among the plurality of nodes to determine a second primary node different from the first primary node, wherein the second election is based on a vertical election algorithm; and cause the second primary node to act as a primary node of the cluster of information handling systems.

The embodiment of the application provides a policy processing method and device, equipment and medium, and belongs to the technical field of databases. The method comprises the following steps: allocating task instances to a plurality of settlement databases through a target task instance, and executing the unsettled policies in the corresponding settlement databases through the task instances in parallel; for a first settlement database for which the unsettled policies have been executed, recording the task instance corresponding to the first settlement database as an idle task instance, finding a second settlement database for which the unsettled policies have not been executed through a preset election algorithm, allocating the idle task instance to the second settlement database, and executing the unsettled policies of the second settlement database through the idle task instance in parallel until the unsettled policies of all the settlement databases are executed. The embodiment can guarantee the consistency of the allocation of the task instances, and through the dynamic allocation of the task instances, the multiple utilization of the task instances is realized, and the overall settlement efficiency of the settlement databases is improved.

The invention relates to the field of organization and scheduling of computing resources, in particular to a computing resource scheduling allocation method based on self-organization. The method comprises the following steps that a resource tree network model based on self-organization is constructed, computing resources in the resource tree network model are spontaneously added into a resource set according to the processing capacity and availability of the computing resources, management nodes are generated through a distributed election algorithm, and a system updates a scheduling allocation strategy in real time according to dynamic changes of the computing resources. According to the self-organization-based computing resource scheduling and allocation method provided by the invention, the self-organization-based resource tree network model is constructed, the management nodes and the index nodes are utilized to efficiently schedule and allocate the computing resources, and meanwhile, each computing resource is dynamically maintained in real time; and fault-tolerant processing is carried out on abnormal situations possibly occurring in the resource scheduling and allocation process, so that efficient positioning, scheduling and allocation and collaborative sharing of the computing resources are realized.

The invention provides a dynamic access method and system for a wireless ad hoc network system, and the method comprises the steps: obtaining a central control node through a preset election algorithm based on a plurality of pre-obtained node parameters; based on pre-acquired initial position information of each node, calibrating the initial position information of each node through a preset ranging algorithm, and constructing a node physical space topology; obtaining real-time traffic data of each node based on a preset statistical period, and obtaining predicted traffic data of each node through a preset prediction algorithm and the real-time traffic data; sending the node physical space topology and the predicted flow data to a central control node, and performing time slot allocation on node resources through a preset resource allocation algorithm to obtain a resource allocation strategy; and sending the resource allocation strategy to each node so as to control the dynamic access of the nodes according to the resource allocation strategy. According to the invention, the space position information of the node is fully considered to carry out time slot allocation, and the access reliability of the wireless ad hoc network is improved.

Disclosed in the present application a method for electing a master node in a cluster. The method comprises the following steps: on the basis of a hyper-converged cloud platform, creating a storage cluster, and configuring a status detection program and a full response operation function; performing active node screening on the storage cluster, so as to obtain an active node set and a candidate node set; setting a first data situation, detecting a second data situation of the active node set, and executing a determination step on the basis of the first data situation and the second data situation, so as to obtain a determination result; when the determination result is a first result, setting an arrangement sequence and a first selection position, and electing a first master node according to the arrangement sequence, the first selection position and the active node set; and when the determination result is a second result, configuring a consistency election algorithm and a distributed election algorithm, and electing a second master node on the basis of the candidate node set, the consistency election algorithm and the distributed election algorithm. By means of the present application, an excessively long election time of a master node and unsuccessful election of the master node are avoided, thereby improving the deployment efficiency of a cluster.

This invention seeks protection for a consensus method for vehicle-to-everything (V2X) networks based on a two-layer blockchain, belonging to the field of V2X security technology. It includes: S1, constructing a two-layer architecture of a bottom-layer sharded chain and a top-layer main chain; S2, selecting vehicle nodes participating in the sharded chain consensus through a multi-dimensional consensus node election algorithm; S3, determining the sharded chain consensus master node using a hidden master node election mechanism; S4, completing consensus within the sharded chains using a practical Byzantine fault-tolerant algorithm; S5, the main chain adopts a directed acyclic graph consensus mechanism and introduces a dynamic verification quantity calculation model. The advantages of this invention are: (1) The multi-dimensional election algorithm selects high-quality nodes, improving consensus stability and security; (2) The layered architecture divides the V2X network into parallel consensus domains, with the bottom layer handling local consensus in parallel to reduce communication complexity, and the top layer coordinating cross-shard transactions to improve scalability; (3) The dynamic verification quantity calculation model adaptively adjusts the verification quantity according to network load, significantly improving system throughput.

An information handling system may include at least one processor and a memory. The information handling system may be configured to: perform a first primary node election among a plurality of nodes of an information handling system cluster to determine a first primary node, wherein the first election is based on a common election algorithm; determine a cloud intent associated with the plurality of nodes; in response to a determination that the cloud intent is associated with an additional primary node requirement, perform a second primary node election among the plurality of nodes to determine a second primary node different from the first primary node, wherein the second election is based on a vertical election algorithm; and cause the second primary node to act as a primary node of the cluster of information handling systems.