Research on Network Control System Using Improved EDF Dynamic Scheduling Algorithm

DTS: Dynamic TDMA scheduling for Networked Control Systems

With the rise of wireless power transfer technology, charging scheduling issue is prevalent in wireless rechargeable sensor networks (WRSNs). Most prior arts focused on two-dimensional (2-D) networks with homogeneous mobile chargers. However, three-dimensional (3-D) networks with collaborations among heterogeneous mobile chargers are more practical. In this paper, we consider 3-D networks in which wireless charging vehicles (WCVs) are employed with unmanned aerial vehicles (UAVs). To prolong network lifetime, we focus on device sleep time and energy usage and propose a 3-D Dynamic Collaborative Scheduling scheme (3DCS). Theoretical values of energy threshold and partition number are determined to assign charging tasks to chargers. Then, scheduling algorithms that include target selection, infeasibility test, and target update, are developed. In addition, a collaborative algorithm is developed to re-assign charging tasks from busy chargers toward their neighboring chargers to further improve charging efficiency. Test-bed experiments and extensive simulations reveal that, compared with several distinguished scheduling schemes, our scheme has a superior performance in charging throughput, energy efficiency, and other characteristics.

Enhanced wireless communication improves the connectivity of vehicular networks in which vehicles are utilized as infrastructures for communication and computation. Thus, a new concept “Vehicular Edge Computing (VEC)” is formed. As VEC utilizes a collaborative multitude of near-user edge resources (i.e. vehicles) in the Internet of Vehicles, the capability of these joint resources becomes heterogeneous especially in their movements. Therefore, one critical problem is how to efficiently schedule each task under such mobile environments. For the reason, we propose a hybrid dynamic scheduling scheme (HDSS) that has the ability to optimize the task scheduling dynamically based on the changeable system environments. HDSS provides a decision function (DF) to select a better-performed scheduling algorithm from two provided candidates: the queue-based dynamic scheduling (QDS) algorithm and the time-based dynamic scheduling (TDS). QDS coincides with the Join-the-Shortest Queue scheme, which decides the scheduling by sorting out a server with the shortest queue-length; nevertheless, TDS is novel scheme that is designed to implement task allocation by estimating the waiting time of each server in order to select a server with the fastest response. Finally, this research generates formal models of each scheduling algorithm and the hybrid scheduling scheme to conduct performance evaluation with a fluid flow approximation technique. The analysis results in a superior performance of HDSS in the unstable VEC environments.

Co-design of dynamic scheduling and quantized control for networked control systems

Body Area Networks (BANs), targeting everywhere anytime health monitoring, operate in license-exempt frequency bands. They require a cross layer design that jointly considers the requirements of (1) access delay to the medium and (2) packet delivery ratio (PDR). In this paper, we experimentally evaluate the PDR of a BAN under static and dynamic scheduling schemes. Investigations show that static multi-hop routing enhances PDR with the help of packet relaying, but at the cost of using more transmission slots in the shared medium, which may compromise access delay. To reduce this cost, we propose a dynamic scheduling approach that adapts to BAN topology changes resulting from body movements. Our extensive experimental results indicate that for BANs colloccated with other wireless systems, our dynamic multi-hop scheduling is mandatory for satisfaction of the PDR constraint.

In the formulation of single process fault free intelligent RGV dynamic scheduling strategy, a double objective optimization model is established to improve the efficiency of RGV and shorten the production time of single material. For the solution of the model, firstly, the shortest moving path of RGV is determined according to Greedy algorithm and Tabu search algorithm, and the loading and unloading sequence of RGV is determined according to the short job priority scheduling algorithm. For intelligent RGV dynamic scheduling problem with single process failure, The failure time is determined by the cumulative failure probability model of the system, According to the period of the fault point, after determining the fault CNC, a new dynamic scheduling model is obtained according to the no fault scheduling strategy. Finally, the model and the algorithm are verified by the data.

In this paper, the optimal dynamic scheduling of electric vehicles (EVs) in a parking lot (PL) is proposed to minimize the charging cost. In static scheduling, the PL operator can make the optimal scheduling if the demand, arrival, and departure time of EVs are known well in advance. If not, a static charging scheme is not feasible. Therefore, dynamic charging is preferred. A dynamic scheduling scheme means the EVs may come and go at any time, i.e., EVs’ arrival is dynamic in nature. The EVs may come to the PL with prior appointments or not. Therefore, a PL operator requires a mechanism to charge the EVs that arrive with or without reservation, and the demand for EVs is unknown to the PL operator. In general, the PL uses the first-in-first serve (FIFS) method for charging the EVs. The well-known optimization techniques such as particle swarm optimization and shuffled frog leaping algorithms are used for the EVs’ dynamic scheduling scheme to minimize the grid’s charging cost. Moreover, a microgrid is also considered to reduce the charging cost further. The results obtained show the effectiveness of the proposed solution methods.

Research on Design Method of Dynamic Shop Floor Scheduling System Based on Human-computer Interaction

Heterogeneous systems with multiple different compute devices have come into common use recently, and the heterogeneity of the compute device is mainly reflected in three aspects: hardware architecture, instruction set architecture, and processing capability. Heterogeneous CPU-accelerator systems have attracted increasing attention especially. To make full use of multiple CPUs and accelerators to execute data-parallel applications, programmers may need to manually map computation and data to all available compute devices, which is tedious, error-prone, and difficult. Especially for some data-parallel applications, the inter-device communication could easily become the performance bottleneck of multi-device co-execution. Therefore, firstly, a runtime system is designed for supporting heterogeneous cooperative execution (HCE) of data-parallel applications, which can help programmers to automatically and efficiently map computation and data to multiple compute devices. Secondly, an incremental data transfer method is designed to avoid redundant data transfers between devices, and a three-way overlapping communication optimization method based on software pipelining is designed to effectively hide the inter-device communication overhead. Based on our previously proposed feedback-based dynamic and elastic task scheduling (FDETS) scheme and asynchronous-based dynamic and elastic task scheduling (ADETS) scheme, the modified FDETS that supports incremental data transfer and the modified ADETS that supports three-way overlapping communication optimization are proposed, which not only can effectively partition and balance the workload among multiple compute devices but also can significantly reduce data transfer overhead between devices. Thirdly, a prototype of the proposed runtime system is implemented, which provides a set of runtime APIs for task scheduling, device management, memory management, and transfer optimization. Our experimental results show that the communication overhead between devices is greatly reduced using the proposed inter-device communication optimization methods and the multi-device co-execution significantly outperforms the best single-device execution.

In the Software Defined Networking (SDN) based Data Center Networks (DCN), load balancing is one of the research hotspots. This paper proposes a Dynamic Traffic Scheduling (DTS) strategy for load balancing taking the advantages of the SDN central controller. Considering the realtime network status, the paths can be adjusted during the flow transmission. A flow equilibrium degree is defined as the trigger of enabling DTS. The implementation process of DTS are also described in detail. An OpenFlow based SDN simulation platform is constructed. The experimental results indicate that DTS strategy generate better performance compared with other routing strategy without dynamic rerouting mechanism under various load.

In response to the optimization scheduling problem in the dyeing production process, the author proposes a hierarchical scheduling method for dyeing vats based on genetic algorithm and multi-agent. In this method, a hierarchical scheduling algorithm is used to decompose production scheduling into static and dynamic strategies. The static strategy adopts a genetic algorithm that supports batch processing of multiple products, non equality of equipment, order delivery time, switching cost, and other constraints: Dynamic strategy is a coordinated dynamic optimization algorithm that uses multi-agent systems to support the running status of dye tanks based on static strategies. By solving the algorithm with multiple constraints and dynamic factors in the production process, the final result of the dyeing tank operation task is obtained. The simulation compared pure genetic algorithm with manual scheduling, and the results showed that the hierarchical dynamic scheduling strategy based on data-driven achieved the goal of optimizing the production scheduling of dyeing vats. The practical application results also demonstrate the feasibility of this method.

<span>The distributed fog node network and variable workloads make task distribution difficult in fog computing. Optimizing computing resources for dynamic workloads with heuristic and metaheuristic algorithms has shown potential. To address changing workloads, these algorithms enable real-time decision-making. This systematic review examines heuristic, meta-heuristic, and real-time dynamic job scheduling strategies in fog computing. Static methods like heuristic and meta-heuristic algorithms can help modify dynamic task scheduling in fog computing situations. This paper covers a current study area that stresses real-time approaches, meta-heuristics, and fog computing environments' dynamic nature. It also helps build reliable and scalable fog computing systems by spotting dynamic task scheduling trends, patterns, and issues. This study summarizes and analyzes the latest fog computing research on task-scheduling algorithms and their pros and cons to adequately address their issues. Fog computing task scheduling strategies are detailed and classified using a technical taxonomy. This work promises to improve system performance, resource utilization, and fog computing settings. The work also identifies fog computing job scheduling innovations and improvements. It reveals the strengths and weaknesses of present techniques, paving the way for fog computing research to address unresolved difficulties and anticipate future challenges.</span>

Although wireless control is one of the key technologies for future industries, most wireless networks are only used for monitoring. When wireless networks are applied to transmit control commands, the uncertain link qualities and limited network resources may destroy the performance of multi-loop control systems. Hence, it is critical to allocate these resources to optimize the control performance as the network condition changes and plants evolve. This article presents comprehensive optimal scheduling strategies for wireless control systems based on adaptive dynamic programming. First, we propose an effective adaptive dynamic programming scheduling (ADPS) strategy to solve the optimal scheduling problem based on the single-step control performance at runtime while significantly reducing computational complexity. Moreover, to overcome the “short-sightedness” of single-step performance prediction, we extend ADPS to ADPS-m ( m ulti-step prediction), which optimizes multi-step performance by incorporating a longer-horizon evolution of the plants. Furthermore, we propose ADPS-H ( H eterogeneous flow scheduling) to support heterogeneous flows with different data rates and sizes and ADPS-H-m ( m ulti-step prediction for H eterogeneous flow scheduling), which schedules heterogeneous flows in a longer prediction horizon. We prove that all these scheduling strategies can achieve optimality and stability under mild assumptions. Extensive experiments integrating TOSSIM and MATLAB/Simulink are performed to evaluate all of the proposed methods in case studies of four- and ten-loop control systems. The simulation results demonstrate that these strategies can effectively improve the control performance at lower computing costs under both cyber and physical disturbances. Under the noise level of \(-\) 76 dBm, for the four-loop case, ADPS achieves the same control performance as the linear programming while saving 99.5% of the execution time. ADPS-m further improves the control performance by up to 27.0% compared with ADPS at the prediction horizon of 3, and ADPS-H-m improves the performance by up to 32.3% and 8.4% compared with round-robin and ADPS-H, respectively. The ten-loop case indicates the effectiveness and scalability of the proposed approaches.

Modular quantum computing scales quantum systems by connecting Quantum Processing Units (QPUs) through a quantum network. A key challenge in such architectures is efficiently scheduling entanglement generation to enable distributed circuit execution. This work investigates how architectural factors—such as network topology, switch placement, and communication qubit allocation—impact entanglement scheduling and resource utilization. Through simulation, we evaluate static and dynamic scheduling strategies under realistic constraints including probabilistic entanglement generation, limited communication qubits, reconfiguration delays, and qubit coherence time. Our results show that dynamic scheduling performs better in highly connected architectures, while sparse topologies lead to contention and entanglement loss. We also profile Bell State Measurement (BSM) demand to identify architectural bottlenecks and inform provisioning. These insights highlight the critical role of architecture in enabling scalable, efficient distributed quantum computing.

The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore, dynamic solutions, where scheduling decisions are made at runtime have overpassed static allocation strategies. The simplicity and efficiency of dynamic schedulers such as Hadoop are a key of the success of the MapReduce framework. Dynamic schedulers such as StarPU, PaRSEC or StarSs are also developed for more constrained computations, e.g. task graphs coming from linear algebra. To make their decisions, these runtime systems make use of some static information, such as the distance of tasks to the critical path or the affinity between tasks and computing resources (CPU, GPU,...) and of dynamic information, such as where input data are actually located. In this paper, we concentrate on two elementary linear algebra kernels, namely the outer product and the matrix multiplication. For each problem, we propose several dynamic strategies that can be used at runtime and we provide an analytic study of their theoretical performance. We prove that the theoretical analysis provides very good estimate of the amount of communications induced by a dynamic strategy and can be used in order to efficiently determine thresholds used in dynamic scheduler, thus enabling to choose among them for a given problem and architecture.