Nowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In this article, a summary of heuristic and meta-heuristic methods for solving the task scheduling optimization in cloud-fog systems is presented. The cost and time aware scheduling methods for both bag of tasks and workflow tasks are reviewed, discussed, and analyzed thoroughly to provide a clear vision for the readers in order to select the proper methods which fulfill their needs.
Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mobile vehicles. Several studies have tackled the task offloading problem in the VFC field. However, recent studies have not carefully addressed the transmission path to the destination node and did not consider the energy consumption of vehicles. This paper aims to optimize the task offloading process in the VFC system in terms of latency and energy objectives under deadline constraint by adopting a Multi-Objective Evolutionary Algorithm (MOEA). Road Side Units (RSUs) x-Vehicles Mutli- Objective Computation offloading method (RxV-MOC) is proposed, where an elite of vehicles are utilized as fog nodes for tasks execution and all vehicles in the system are utilized for tasks transmission. The well-known Dijkstra's algorithm is adopted to find the minimum path between each two nodes. The simulation results show that the RxV-MOC has reduced significantly the energy consumption and latency for the VFC system in comparison with First-Fit algorithm, Best-Fit algorithm, and the MOC method.