Research on parallelization of shortest path for graph and its application
Hong Li · Computer Engineering and Applications Journal · 2012
The current computer has been brought into the age of mobile computing that generates a number of applications.As one of these applications,the navigation is considered to be the map inquiry based on the geographical information system and location-based service.This application can be converted into achieving the shortest path.Due to the large number of nodes,the traditional method can't satisfy the user with the response time.In order to meet the actual requirement,this paper assigns tasks reasonably via the C/S framework and parallelizes the shortest path in the server side using polykaryon,multimachine and so on.Comparing with the traditional methods,the proposed approach saves latency time,increases the degree of satisfaction,and decreases the electricity consumption for the mobile device.