A novel parallelization method of genetic algorithm (GA) solution of the Traveling Salesman Problem (TSP) is presented. The proposed method can considerably accelerate the solution of the equivalent TSP of many complex vehicle routing problems (VRPs) in the cloud implementation of intelligent transportation systems. The solution provides routing information besides all the services required by the autonomous vehicles in vehicular clouds. GA is considered as an important class of evolutionary algorithms that can solve optimization problems in growing intelligent transport systems. But, to meet time criteria in time-constrained problems of intelligent transportation systems like routing and controlling the autonomous vehicles, a highly parallelizable GA is needed. The proposed method parallelizes the GA by designing three concurrent kernels, each of which running some dependent effective operators of GA. It can be straightforwardly adapted to run on many-core and multi-core processors. To best use the valuable resources of such processors in parallel execution of the GA, threads that run any of the triple kernels are synchronized by a low-cost switching mechanism. The proposed method was experimented for parallelizing a GA-based solution of TSP over multi-core and many-core systems. The results confirm the efficiency of the proposed method for parallelizing GAs on many-core as well as on multi-core systems.

No abstract

Nowadays, renewable energies have been considered as one of the important sources of energy supply in delaysensitive fog computations in intelligent transportation systems due to their cheapness and availability. This study addresses the challenges of using renewable power supplies in delay-sensitive fogs and proposes an efficient workload allocation method based on a learning classifier system. The system dynamically learns the workload allocation policies between the cloud and the fog servers and then converges on the optimal allocation that fulfils the energy and delay requirements in the overall transportation system. Simulation results confirm that the proposed algorithm reduces the long-term costs of the system including service delay and operating costs. Also, compared to some other techniques, when the proposed method presents the most successful solution for reducing the average delay of the workloads and converging on the minimum value as well as retaining or even increasing the battery levels of fog nodes up to 100%. The lowest cost of the delay is 5 among other available methods, whereas in the proposed method, this value approaches 4.5.

No abstract

No abstract

No abstract

Packet classification is a computationally intensive, highly parallelizable task in many advanced network systems like high-speed routers and firewalls that enable different functionalities through discriminating incoming traffic. Recently, graphics processing units (GPUs) have been exploited as efficient accelerators for parallel implementation of software classifiers. The aggregated bit vector is a highly parallelizable packet classification algorithm. In this work, first we present a parallel kernel for running this algorithm on GPUs. Next, we adapt an asymptotic analysis method which predicts any empirical result of the proposed kernel. Experimental results not only confirm the efficiency of the proposed parallel kernel but also reveal the accuracy of the analysis method in predicting important trends in experimental results.

No abstract