A real-time performance improvement method for composite time scale

The composite time scale(CTS)provides a stable,accurate,and reliable time scale for modern society.The improvement of CTS’s real-time performance will improve its stability,which strengths related applications’performance.Aiming at this goal,a method achieved by determining the optimal calculation interval and accelerating adjustment stage is proposed in this paper.The determinants of the CTS’s calculation interval(characteristics of the clock ensemble,the measurement noise,the time and frequency synchronization system’s noise and the auxiliary output generator noise floor)are studied and the optimal calculation interval is obtained.We also investigate the effect of ensemble algorithm’s initial parameters on the CTS’s adjustment stage.A strategy to get the reasonable initial parameters of ensemble algorithm is designed.The results show that the adjustment stage can be finished rapidly or even can be shorten to zero with reasonable initial parameters.On this basis,we experimentally generate a distributed CTS with a calculation interval of 500 s and its stability outperforms those of the member clocks when the averaging time is longer than1700 s.The experimental result proves that the CTS’s real-time performance is significantly improved.

ROS2 Real-time Performance Optimization and Evaluation

Real-time interaction with uncertain and dynamic environments is essential for robotic systems to achieve functions such as visual perception,force interaction,spatial obstacle avoidance,and motion planning.To ensure the reliability and determinism of system execution,a flexible real-time control system architecture and interaction algorithm are required.The ROS framework was designed to improve the reusability of robotic software development by providing a distributed structure,hardware abstraction,message-passing mechanism,and application prototypes.Rich ecosystems for robotic development have been built around ROS1 and ROS2 architectures based on the Linux system.However,because of the fairness scheduling principle of the default Linux system design and the complexity of the kernel,the system does not have real-time computing.To achieve a balance between real-time and non-real-time computing,this paper uses the transmission mechanism of ROS2,combines it with the scheduling mechanism of the Linux operating system,and uses Preempt_RT to enhance the real-time computing of ROS1 and ROS2.The real-time performance evaluation of ROS1 and ROS2 is conducted from multiple perspectives,including throughput,transmission mode,QoS service quality,frequency,number of subscription nodes and EtherCAT master.This paper makes two significant contributions:firstly,it employs Preempt_RT to optimize the native ROS2 system,effectively enhancing the real-time performance of native ROS2 message transmission;secondly,it conducts a comprehensive evaluation of the real-time performance of both native and optimized ROS2 systems.This comparison elucidates the benefits of the optimized ROS2 architecture regarding real-time performance,with results vividly demonstrated through illustrative figures.

Layered power scheduling optimization of PV hydrogen production system considering performance attenuation of PEMEL

To analyze the additional cost caused by the performance attenuation of a proton exchange membrane electrolyzer(PEMEL)under the fluctuating input of renewable energy,this study proposes an optimization method for power scheduling in hydrogen production systems under the scenario of photovoltaic(PV)electrolysis of water.First,voltage and performance attenuation models of the PEMEL are proposed,and the degradation cost of the electrolyzer under a fluctuating input is considered.Then,the calculation of the investment and operating costs of the hydrogen production system for a typical day is based on the life cycle cost.Finally,a layered power scheduling optimization method is proposed to reasonably distribute the power of the electrolyzer and energy storage system in a hydrogen production system.In the up-layer optimization,the PV power absorbed by the hydrogen production system was optimized using MALTAB+Gurobi.In low-layer optimization,the power allocation between the PEMEL and battery energy storage system(BESS)is optimized using a non-dominated sorting genetic algorithm(NSGA-Ⅱ)combined with the firefly algorithm(FA).A better optimization result,characterized by lower degradation and total costs,was obtained using the method proposed in this study.The improved algorithm can search for a better population and obtain optimization results in fewer iterations.As a calculation example,data from a PV power station in northwest China were used for optimization,and the effectiveness and rationality of the proposed optimization method were verified.

Seismic performance evaluation of VCFPB isolated storage tank using real-time hybrid simulation

Variable curvature friction pendulum bearings(VCFPB)effectively reduce the dynamic response of storage tanks induced by earthquakes.Shaking table testing is used to assess the seismic performance of VCFPB isolated storage tanks.However,the vertical pressure and friction coefficient of the scaled VCFPB in the shaking table tests cannot match the equivalent values of these parameters in the prototype.To avoid this drawback,a real-time hybrid simulation(RTHS)test was developed.Using RTHS testing,a 1/8 scaled tank isolated by VCFPB was tested.The experimental results showed that the displacement dynamic magnification factor of VCFPB,peak reduction factors of the acceleration,shear force,and overturning moment at bottom of the tank,were negative exponential functions of the ratio of peak ground acceleration(PGA)and friction coefficient.The peak reduction factors of displacement,acceleration,force and overturning moment,which were obtained from the experimental results,are compared with those calculated by the Housner model.It can be concluded that the Housner model is applicable in estimation of the acceleration,shear force,and overturning moment of liquid storage tank,but not for the sliding displacement of VCFPBs.

Performance analysis model for real-time Ethernet-based computer numerical control system

In order to optimize the embedded system implementation for Ethernet-based computer numerical control （CNC） system, it is very necessary to establish the performance analysis model and further adopt the codesign method from the control, communication and computing perspectives. On the basis of analyzing real-time Ethemet, system architecture, time characteristic parameters of control-loop ere, a performance analysis model for real-time Ethemet-based CNC system was proposed, which is able to include the timing effects caused by the implementation platform in the simulation. The key for establishing the model is accomplished by designing the error analysis module and the controller nodes. Under the restraint of CPU resource and communication bandwidth, the experiment with a case study was conducted, and the results show that if the deadline miss ratio of data packets is 0.2%, then the percentage error is 1.105%. The proposed model can be used at several stages of CNC system development.

Performance evaluation of near real-time condition monitoring in haul trucks

Strategic maintenance plays a key role in ensuring high availability and utilization of the haul trucks,and as equipment began to grow more complex towards the end of the 20th century,there was a need for a proactive maintenance strategy,which led to the development of condition-based maintenance.Realtime condition monitoring(RTCM)is the ability to perform condition monitoring in real-time and has the ability to alert maintenance and operations of abnormal conditions.These alarms can be used as an indication leading to a problem,and if a suitable corrective action is initiated in time,it could result in significant savings of equipment downtime and repair costs.This study aims to compare some maintenance performance indicators prior to and after implementation of RTCM strategy at a mine site using some tests of statistical significance.The study also indicated the presence of seasonality in the data,and thus the data was deseasonalized and detrended prior to being subjected to the statistical tests.Finally,the results indicated that RTCM strategy has proven to be successful in improving the availability for some of the failure categories chosen in this study.

Optimizing Real-Time Performance of 3D Virtual Mining Environment with MultiGen Creator

System optimization plays a crucial role in developing VR system after 3D modeling, affecting the system's Immersion and Interaction performance enormously. In this article, several key techniques of optimizing a virtual mining system were discussed: optimizing 3D models to keep the polygon number in VR system within target hardware's processing ability; optimizing texture database to save texture memory with perfect visual effect; optimizing database hierarchy structure to accelerate model retrieval; and optimizing LOD hierarchy structure to speed up rendering.

Real-time performance of periodic data transmission in EPA industrial Ethernet

To evaluate and improve the real-time performance of Ethernet for plant automation（EPA） industrial Ethernet,the real-time performance of EPA periodic data transmission was theoretically and experimentally studied.By analyzing information transmission regularity and EPA deterministic scheduling mechanism,periodic messages were categorized as different modes according to their entering-queue time.The scheduling characteristics and delivery time of each mode and their interacting relations were studied,during which the models of real-time performance of periodic information transmission in EPA system were established.On this basis,an experimental platform is developed to test the delivery time of periodic messages transmission in EPA system.According to the analysis and the experiment,the main factors that limit the real-time performance of EPA periodic data transmission and the improvement methods were proposed.

MapReduce Scheduler by Characterizing Performance Interference

Recently, virtualization has become more and more important in the cloud computing to support efficient flexible resource provisioning. However, performance interference among virtual machines(VMs) has become a challenge which may affect the effectiveness of resource provisioning. In a virtual cluster which runs the Map Reduce applications, the performance interference can also affect the performance of the Map and Reduce tasks and thus cause a performance degradation of the Map Reduce job. Accordingly, this paper presents a Map Reduce scheduling framework to mitigate this performance degradation caused by the performance interference. The framework includes a performance interference prediction module and an interference aware scheduling algorithm. To verify its effectiveness, we have done a set of experiments on a 24-node virtual Map Reduce cluster. The experiments illustrate that the proposed framework can achieve a performance improvement in the virtualized environment compared with other Map Reduce schedulers.

An On-Line Scheduler over Hard Real-Time Communication System

By thorough research on the prominent periodic and aperiodic scheduling algorithms,anon-line hard real-time scheduler is presented,which is applicable to the scheduling of packets over a link.This scheduler,based on both Rate Monotonic,pinwheel scheduling algorithm Sr and Polling Serverscheduling algorithms,can rapidly judge the schedulability and then automatically generate a bus tablefor the scheduling algorithm to schedule the packets as the periodic packets.The implementation of thescheduler is simple and easy to use,and it is effective for the utilization of bus link.The orderly executionof the bus table can not only guarantee the performance of the hard real time but also avoid the blockageand interruption of the message transmission.So the scheduler perfectly meets the demand of hard real-time communication system on the field bus domain.

Long-release-interval-first real-time scheduling algorithm and its schedulability test

To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks. By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks. The schedulability test approach for the LRIF algorithm is presented. The implementation issues of the LRIF algorithm are also discussed. Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first （MUF） algorithm, the earliest deadline first （EDF） algorithm and EDF for hybrid tasks. LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks.

Modeling and performance evaluation of QoS-aware job scheduling of computational grids

To achieve high quality of service （QoS） on computational grids, the QoS-aware job scheduling is investigated for a hierarchical decentralized grid architecture that consists of multilevel schedulers. An integrated QoS-aware job dispatching policy is proposed, which correlates priorities of incoming jobs used for job selecting at the local scheduler of the grid node with the job dispatching policies at the global scheduler for computational grids. The stochastic high-level Petri net （SHLPN） model of a two-level hierarchy computational grid architecture is presented, and a model refinement is made to reduce the complexity of the model solution. A performance analysis technique based on the SHLPN is proposed to investigate the QoS-aware job scheduling policy. Numerical results show that the QoS-aware job dispatching policy outperforms the QoS-unaware job dispatching policy in balancing the high-priority jobs, and thus enables priority-based QoS.

Performance analysis of active schedules in identical parallel machine

Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs＇ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

Real-time scheduling strategy for microgrids considering operation interval division of DGs and batteries

Real-time scheduling as an on-line optimization process must output dispatch results in real time. However, the calculation time required and the economy have a trade-off relationship. In response to a real-time scheduling problem, this paper proposes a real-time scheduling strategy considering the operation interval division of distributed generators(DGs) and batteries in the microgrid. Rolling scheduling models, including day-ahead scheduling and hours-ahead scheduling, are established, where the latter considers the future state-of-charge deviations. For the real-time scheduling, the output powers of the DGs are divided into two intervals based on the ability to track the day-ahead and hours-ahead schedules. The day-ahead and hours-ahead scheduling ensure the economy, whereas the real-time scheduling overcomes the timeconsumption problem. Finally, a grid-connected microgrid example is studied, and the simulation results demonstrate the effectiveness of the proposed strategy in terms of economic and real-time requirements.

SWARM INTELLIGENCE BASED DYNAMIC REAL-TIME SCHEDULING APPROACH FOR SEMICONDUCTOR WAFER FAB

Based on the analysis of collective activities of ant colonies, the typicalexample of swarm intelligence, a new approach to construct swarm intelligence basedmulti-agent-system (SMAS) for dynamic real-time scheduling for semiconductor wafer fab is proposed.The relevant algorithm, pheromone-based dynamic real-time scheduling algorithm (PBDR), is given.MIMAC test bed data set mini-fab is used to compare PBDR with FIFO (first in first out),SRPT(shortest remaining processing time) and CR(critical ratio) under three different release rules,i.e. deterministic rule, Poisson rule and CONWIP (constant WIP). It is shown that PBDR is prior toFIFO, SRPT and CR with better performance of cycle time, throughput, and on-time delivery,especially for on-time delivery performance.

Adaptive Resource Planning for AI Workloads with Variable Real-Time Tasks

AI(Artificial Intelligence)workloads are proliferating in modernreal-time systems.As the tasks of AI workloads fluctuate over time,resourceplanning policies used for traditional fixed real-time tasks should be reexamined.In particular,it is difficult to immediately handle changes inreal-time tasks without violating the deadline constraints.To cope with thissituation,this paper analyzes the task situations of AI workloads and findsthe following two observations.First,resource planning for AI workloadsis a complicated search problem that requires much time for optimization.Second,although the task set of an AI workload may change over time,thepossible combinations of the task sets are known in advance.Based on theseobservations,this paper proposes a new resource planning scheme for AIworkloads that supports the re-planning of resources.Instead of generatingresource plans on the fly,the proposed scheme pre-determines resourceplans for various combinations of tasks.Thus,in any case,the workload isimmediately executed according to the resource plan maintained.Specifically,the proposed scheme maintains an optimized CPU(Central Processing Unit)and memory resource plan using genetic algorithms and applies it as soonas the workload changes.The proposed scheme is implemented in the opensourcesimulator SimRTS for the validation of its effectiveness.Simulationexperiments show that the proposed scheme reduces the energy consumptionof CPU and memory by 45.5%on average without deadline misses.

A Model Predictive Scheduling Algorithm inReal-Time Control Systems

Abstract-The ineffective utilization of power resources has attracted much attention in current years. This paper proposes a real-time distributed load scheduling algorithm considering constraints of power supply. Firstly, an objective function is designed based on the constraint, and a base load forecasting model is established when aggregating renewable generation and non-deferrable load into a power system, which aims to transform the problem of deferrable loads scheduling into a distributed optimal control problem. Then, to optimize the objective function, a real-time scheduling algorithm is presented to solve the proposed control problem. At every time step, the purpose is to minimize the variance of differences between power supply and aggregate load, which can thus ensure the effective utilization of power resources. Finally, simulation examples are provided to illustrate the effectiveness of the proposed algorithm.

Application of predictive control scheduling method to real-time periodic control tasks overrun

Based on the abort strategy of fixed periods, a novel predictive control scheduling methodology was proposed to efficiently solve overrun problems. By applying the latest control value in the prediction sequences to the control objective, the new strategy was expected to optimize the control system for better performance and yet guarantee the schedulability of all tasks under overrun. The schedulability of the real-time systems with p-period overruns was analyzed, and the corresponding stability criteria was given as well. The simulation results show that the new approach can improve the performance of control system compared to that of conventional abort strategy, it can reduce the overshoot and adjust time as well as ensure the schedulability and stability.

Energy-Performance Tradeoffs in laaS Cloud with Virtual Machine Scheduling

In the cloud data centers,how to map virtual machines(VMs) on physical machines(PMs) to reduce the energy consumption is becoming one of the major issues,and the existing VM scheduling schemes are mostly to reduce energy consumption by optimizing the utilization of physical servers or network elements.However,the aggressive consolidation of these resources may lead to network performance degradation.In view of this,this paper proposes a two-stage VM scheduling scheme:(1) We propose a static VM placement scheme to minimize the number of activating PMs and network elements to reduce the energy consumption;(2) In the premise of minimizing the migration costs,we propose a dynamic VM migration scheme to minimize the maximum link utilization to improve the network performance.This scheme makes a tradeoff between energy efficiency and network performance.We design a new twostage heuristic algorithm for a solution,and the simulations show that our solution achieves good results.

FEL-H Robust Control Real-Time Scheduling

The existing scheduling algorithms cannot adequately support modern embedded real-time applications. An important challenge for future research is how to model and introduce control mechanisms to real-time systems to improve real-time performance, and to allow the system to adapt to changes in the environment, the workload, or to changes in the system architecture due to failures. In this paper, we pursue this goal by formulating and simulating new real-time scheduling models that enable us to easily analyse feedback scheduling with various constraints, overload and disturbance, and by designing a robust, adaptive scheduler that responds gracefully to overload with robust H∞ and feedback error learning control.