Multi-Resource List Scheduling of Moldable Parallel Jobs under Precedence Constraints

The scheduling literature has traditionally focused on a single type of resource (e.g., computing nodes). However, scientific applications in modern High-Performance Computing (HPC) systems process large amounts of data, hence have diverse requirements on different types of resources (e.g., cores, cache, memory, I/O). All of these resources could potentially be exploited by the runtime scheduler to improve the application performance. In this paper, we study multi-resource scheduling to minimize the makespan of computational workflows comprised of parallel jobs subject to precedence constraints. The jobs are assumed to be moldable, allowing the scheduler to flexibly select a variable set of resources before execution. We propose a multi-resource, list-based scheduling algorithm, and prove that, on a system with $d$ types of schedulable resources, our algorithm achieves an approximation ratio of $1.619d+2.545\sqrt{d}+1$ for any $d$, and a ratio of $d+O(\sqrt[3]{d^2})$ for large $d$. We also present improved results for independent jobs and for jobs with special precedence constraints (e.g., series-parallel graphs and trees). Finally, we prove a lower bound of $d$ on the approximation ratio of any list scheduling scheme with local priority considerations. To the best of our knowledge, these are the first approximation results for moldable workflows with multiple resource requirements

Global EDF Scheduling for Parallel Real-Time Tasks

As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic graph (DAG) where nodes represent computational work and edges represent dependences between nodes. In this model, we prove that GEDF provides a capacity augmentation bound of 4-2/m and a resource augmentation bound of 2-1/m. The capacity augmentation bound acts as a linear-time schedulability test since it guarantees that any task set with total utilization of at most m/(4-2/m) where each task\u27s critical-path length is at most 1/(4-2/m) of its deadline is schedulable on m cores under GEDF. In addition, we present a pseudo-polynomial time fixed-point schedulability test for GEDF; this test uses a carry-in work calculation based on the proof for the capacity bound. Finally, we present and evaluate a prototype platform --- called PGEDF --- for scheduling parallel tasks using GEDF. PGEDF is built by combining the GNU OpenMP runtime system and the LITMUS_RT operating system. This platform allows programmers to write parallel OpenMP tasks and specify real-time parameters such as deadlines for tasks. We perform two kinds of experiments to evaluate the performance of GEDF for parallel tasks. (1) We run numerical simulations for DAG tasks. (2) We execute randomly generated tasks using PGEDF. Both sets of experiments indicate that GEDF performs surprisingly well and outperforms an existing scheduling techniques that involves task decomposition

Real-Time Wireless Sensor-Actuator Networks for Cyber-Physical Systems

A cyber-physical system (CPS) employs tight integration of, and coordination between computational, networking, and physical elements. Wireless sensor-actuator networks provide a new communication technology for a broad range of CPS applications such as process control, smart manufacturing, and data center management. Sensing and control in these systems need to meet stringent real-time performance requirements on communication latency in challenging environments. There have been limited results on real-time scheduling theory for wireless sensor-actuator networks. Real-time transmission scheduling and analysis for wireless sensor-actuator networks requires new methodologies to deal with unique characteristics of wireless communication. Furthermore, the performance of a wireless control involves intricate interactions between real-time communication and control. This thesis research tackles these challenges and make a series of contributions to the theory and system for wireless CPS. (1) We establish a new real-time scheduling theory for wireless sensor-actuator networks. (2) We develop a scheduling-control co-design approach for holistic optimization of control performance in a wireless control system. (3) We design and implement a wireless sensor-actuator network for CPS in data center power management. (4) We expand our research to develop scheduling algorithms and analyses for real-time parallel computing to support computation-intensive CPS

Study on application possibilities of Case-Based Reasoning on the domain of scheduling problems

Ces travaux concernent la mise en place d'un système d'aide à la décision, s'appuyant sur le raisonnement à partir de cas, pour la modélisation et la résolution des problèmes d'ordonnancement en génie des procédés. Une analyse de co-citation a été exécutée afin d'extraire de la littérature la connaissance nécessaire à la construction de la stratégie d'aide à la décision et d'obtenir une image de la situation, de l'évolution et de l'intensité de la recherche du domaine des problèmes d'ordonnancement. Un système de classification a été proposée, et la nomenclature proposée par Blazewicz et al. (2007) a été étendue de manière à pouvoir caractériser de manière complète les problèmes d'ordonnancement et leur mode de résolution. Les difficultés d'adaptation du modèle ont été discutées, et l'efficacité des quatre modèles de littérature a été comparée sur trois exemples de flow-shop. Une stratégie de résolution est proposée en fonction des caractéristiques du problème mathématique. ABSTRACT : The purpose of this study is to work out the foundations of a decision-support system in order to advise efficient resolution strategies for scheduling problems in process engineering. This decision-support system is based on Case-Based Reasoning. A bibliographic study based on co-citation analysis has been performed in order to extract knowledge from the literature and obtain a landscape about scheduling research, its intensity and evolution. An open classification scheme has been proposed to scheduling problems, mathematical models and solving methods. A notation scheme corresponding to the classification has been elaborated based on the nomenclature proposed by Blazewicz et al. (2007). The difficulties arising during the adaptation of a mathematical model to different problems is discussed, and the performances of four literature mathematical models have been compared on three flow-shop examples. A resolution strategy is proposed based on the characteristics of the scheduling problem