Time Sensitive Networks (TSN) is a set of revisions to the IEEE 802.1 standard enabling safety-critical and real-time transmission over Ethernet. It is crucial in TSN to use a reasonable scheduling algorithm to guaran...
详细信息
In an electric power system, the main goal of Hydrothermal Generation scheduling (HTGS) is to effectively manage hydrothermal unit power generation while abiding by system restrictions. The scheduling timeframe can ra...
详细信息
Cloud computing (CC) is a modern technology which deploys networks of servers, positioned in extensive remote areas, for conducting operations on a larger quantity of data. In CC, a workflow module is employed for rep...
详细信息
In order to address the issue of excessive resource consumption due to frequent context switching when running a large number of compute-intensive tasks in high-load scenarios on Linux. The paper proposes a scheduling...
详细信息
This study explores the application of artificial intelligence technology in the optimization and scheduling of photovoltaic storage and charging microgrid parks. By analyzing the characteristics and requirements of m...
详细信息
In this paper, a new energy scheduling system based on improved grey model algorithm is proposed, and its performance is evaluated comprehensively. Firstly, aiming at the uncertainty and volatility problems in new ene...
详细信息
We study the resilient scheduling of moldable parallel jobs on high-performance computing (HPC) platforms. Moldable jobs allow for choosing a processor allocation before execution, and their execution time obeys vario...
详细信息
We study the resilient scheduling of moldable parallel jobs on high-performance computing (HPC) platforms. Moldable jobs allow for choosing a processor allocation before execution, and their execution time obeys various speedup models. The objective is to minimize the overall completion time or the makespan, when jobs can fail due to silent errors and hence may need to be re-executed after each failure until successful completion. Our work generalizes the classical scheduling framework for failure-free jobs. To cope with silent errors, we introduce two resilient scheduling algorithms, Lpa-List and Batch-List, both of which use the List strategy to schedule the jobs. Without knowing a priori how many times each job will fail, Lpa-List relies on a local strategy to allocate processors to the jobs, while Batch-List schedules the jobs in batches and allows only a restricted number of failures per job in each batch. We prove approximation ratios for the two algorithms under several prominent speedup models (e.g., roofline, communication, Amdahl, power, monotonic, and a mix model). An extensive set of simulations is conducted to evaluate different variants of the two algorithms, and the results show that they consistently outperform some baseline heuristics. Overall, our best algorithm is within a factor of 1.6 of a lower bound on average over the entire set of experiments, and within a factor of 4.2 in the worst case.
As quantum computing technology matures, the availability and performance of quantum devices are steadily improving. However, in the NISQ (Noisy Intermediate-Scale Quantum) era, the quantum bit error rate caused by qu...
详细信息
With the proliferation of heterogeneous services in scalable Internet-of-Things (IoT) architectures, the Cloud of Things begins to face latency-based network challenges. As a solution to these problems, the Fog-of-Thi...
详细信息
With the proliferation of heterogeneous services in scalable Internet-of-Things (IoT) architectures, the Cloud of Things begins to face latency-based network challenges. As a solution to these problems, the Fog-of-Things (FoT) paradigm has emerged. This paradigm promises numerous benefits for latency-sensitive IoT service design, by reducing IoT data traffic toward the cloud. Since FoT utilizes heterogeneous services, the decision outputs of these services are transmitted by multipriority data packet traffic patterns. For the full utilization of fog computing benefits, we need to model this traffic and apply an efficient data traffic scheduling approach. In this study, we address the starvation challenge of multipriority FoT data traffic scheduling in a scalable fog architecture and propose a complex event processing-based efficient scheduling policy for its prevention. We first give the arrival-service model for FoT data traffic using finite-size multilevel waiting lines. Then, we compare the proposed policy with the first-in-first-out and multipriority-discipline queue policies through a comprehensive analysis of waiting times and wait-time gap characteristics. We have also conducted extensive simulation tests to explore the performance of these policies in our testbed for up to 800 clients communicating with the fog system. The results reveal that the empirical values obtained from the tests verify the theoretical model and the proposed approach can successfully relieve the waiting-time gaps observed in priority levels.
With the widespread adoption of intelligent in-vehicle devices, demands for server computing performance and network transmission speed have significantly increased, while resources in vehicle-edge computing remain li...
详细信息
暂无评论