RFID: Towards Low Latency and Reliable DAG Task Scheduling Over Dynamic Vehicular Clouds

Abstract

Vehicular cloud (VC) platforms integrate heterogeneous and distributed resources of moving vehicles to offer timely and cost-effective computing services. However, the dynamic nature of VCs (i.e., limited contact duration among vehicles), caused by vehicles' mobility, poses unique challenges to the execution of computation-intensive applications/tasks with a directed acyclic graph (DAG) structure, where each task consists of multiple interdependent components (subtasks). In this paper, we study the scheduling of DAG tasks over dynamic VCs, where multiple subtasks of a DAG task are dispersed across vehicles and processed by vehicles cooperatively. We formulate DAG task scheduling as a 0-1 integer programming problem, aiming to minimize the overall task completion time while ensuring a high execution success rate, which turns out to be NP-hard. To tackle the problem, we develop a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</u> anking and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</u> oresight- <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</u> ntegrated <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</u> ynamic scheduling scheme (RFID). RFID consists of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i)</i> a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dynamic downward ranking</i> mechanism that sorts the scheduling priority of different subtasks, while explicitly taking into account the sequential execution nature of DAG; <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ii)</i> a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">resource scarcity-based priority changing</i> mechanism that overcomes possible performance degradations caused by the volatility of VC resources; and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">iii)</i> a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">degree-based weighted earliest finish time</i> mechanism that assigns the subtask with the highest scheduling priority to the vehicle which offers rapid task execution along with reliable transmission links. Simulation results reveal the effectiveness of our proposed scheme in comparison to benchmark methods.