Map Matching Task Dispatching in Cluster Servers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing load balancing technologies for cluster servers in the Internet of Vehicles fail to effectively manage conflicts between map matching requests, leading to degraded computing efficiency due to conflicts between path search tasks at adjacent geographical locations, caused by temporary nodes and frequent write operations in parallel computing.
Innovation Solution
A method and apparatus for dispatching map matching tasks by determining a road segment group set corresponding to a current time period and assigning computing nodes based on the number of computing nodes and dissimilarity between road segments, ensuring that map matching requests are sent to appropriate computing nodes to reduce conflicts and enhance computing efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Power
If parallel computing capabilities of multiple cores are used to implement parallel short-distance path searches, then the overall computing power of the cluster is enhanced, but conflicts occur between path search tasks at adjacent geographical locations causing lock queues and degraded computing efficiency
Solution Approach 1:
The patent segments the road network into multiple independent partitions, each assigned to a specific computing core. By dividing the road network data into discrete segments and assigning them to different cores, the system enables parallel processing while eliminating conflicts between adjacent geographical locations, as each core operates independently on its assigned segment without interfering with others.
2Speed
If temporary nodes are added to the road network model and frequent write operations are performed in heuristic search, then the search speed is accelerated, but serious conflict problems occur in parallel computing
Solution Approach 1:
The patent applies local quality by allowing each computing core to independently manage its own road network partition with local temporary nodes and data structures. Each core has its own isolated working memory for heuristic search operations, eliminating write conflicts while maintaining the speed benefits of frequent local write operations within each partition.
3Reliability
If map matching services are uniformly provided at a server end, then map version discrepancies and updating latency are avoided, but a high-performance load-balanced cluster server is required to provide low-latency services
Solution Approach 1:
The patent transitions from a single centralized server architecture to a multi-dimensional cluster architecture where multiple servers work in parallel. This dimensional expansion allows the system to maintain map version consistency across all nodes while distributing the computational load, thereby reducing service latency through parallel processing capabilities.
Data Source
AI summary
There is disclosed a method, comprising: determining a road segment group set that corresponds to a current time period, and a correspondence relationship between each road segment group in the road segment group set and a computing node of the cluster server, wherein the road segment group is a group of road segments which are grouped according to the number of computing nodes of the cluster server and the dissimilarity between divided road segments in a road network; in response to receiving multiple GPS sampled data from a vehicle, generating a map matching request according to the multiple GPS sampled data; and in response to generating a map matching request and obtaining a road segment to which the latest location of the vehicle belongs, sending the map matching request to a computing node that corresponds to a road segment group to which the obtained road segment belongs.