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 t...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.展开更多
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 prior...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.展开更多
The highly dynamic nature,strong uncertainty,and coupled multiple safety constraints inherent in carrier aircraft recovery operations pose severe challenges for real-time decision-making.Addressing bolter scenarios,th...The highly dynamic nature,strong uncertainty,and coupled multiple safety constraints inherent in carrier aircraft recovery operations pose severe challenges for real-time decision-making.Addressing bolter scenarios,this study proposes an intelligent decision-making framework based on a deep long short-term memory Q-network.This framework transforms the real-time sequencing for bolter recovery problem into a partially observable Markov decision process.It employs a stacked long shortterm memory network to accurately capture the long-range temporal dependencies of bolter event chains and fuel consumption.Furthermore,it integrates a prioritized experience replay training mechanism to construct a safe and adaptive scheduling system capable of millisecond-level real-time decision-making.Experimental demonstrates that,within large-scale mass recovery scenarios,the framework achieves zero safety violations in static environments and maintains a fuel safety violation rate below 10%in dynamic scenarios,with single-step decision times at the millisecond level.The model exhibits strong generalization capability,effectively responding to unforeseen emergent situations—such as multiple bolters and fuel emergencies—without requiring retraining.This provides robust support for efficient carrier-based aircraft recovery operations.展开更多
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 sched...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.展开更多
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 ...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.展开更多
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. Fir...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.展开更多
Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit （FTRMFF） algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic ...Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit （FTRMFF） algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic （RM） algorithm. Then, the RM-based idleness factor and compact factor are presented to quantify the compact degree of tasks assigned to the same processor. In this paper, the novel fault-tolerant rate-monotonic compact-factor-driven （FTRMCFD） algorithm, which follows the principle of compact factor maximal when allocating the processors for tasks, is proposed. FTRMCFD algorithm makes every processor contain more tasks and get higher utilization to increase the schedulability performance of distributed systems. The simulation experiments reveal that FTRMCFD can reduce the number of required processors by up to 11.5% （with an average of 5.3%）.展开更多
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 ...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.展开更多
Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of re...Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.展开更多
In the real-time scheduling theory,schedulability and synchronization analyses are used to evaluate scheduling algorithms and real-time locking protocols,respectively,and the empirical synthesis experiment is one of t...In the real-time scheduling theory,schedulability and synchronization analyses are used to evaluate scheduling algorithms and real-time locking protocols,respectively,and the empirical synthesis experiment is one of the major methods to compare the performance of such analyses.However,since many sophisticated techniques have been adopted to improve the analytical accuracy,the implementation of such analyses and experiments is often time-consuming.This paper proposes a schedulability experiment toolkit for multiprocessor real-time systems(SET-MRTS),which provides a framework with infrastructures to implement the schedulability and synchronization analyses and the deployment of empirical synthesis experiments.Besides,with well-designed peripheral components for the input and output,experiments can be conducted easily and flexibly on SET-MRTS.This demonstration further proves the effectiveness of SET-MRTS in both functionality and availability.展开更多
Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we re...Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.展开更多
By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The scbedulability ...By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The scbedulability of the system was analyzed through checkpointing and the energy saving was considered via dynamic voltage and frequency scaling. Simulation results showed that the proposed algorithm had better performance compared with the existing voltage allocation techniques. The proposed technique saves 51.5% energy over FT-Only and 19.9% over FT ＋ EC on average. Therefore, the proposed method was more appropriate for aperiodic tasks in embedded real-time systems.展开更多
The reliability of real-time embedded software directly determines the reliability of the whole real-time embedded sys- tem, and the effective software testing is an important way to ensure software quality and reliab...The reliability of real-time embedded software directly determines the reliability of the whole real-time embedded sys- tem, and the effective software testing is an important way to ensure software quality and reliability. Based on the analysis of the characteristics of real-time embedded software, the formal method is introduced into the real-time embedded software testing field and the real-time extended finite state machine （RT-EFSM） model is studied firstly. Then, the time zone division method of real-time embedded system is presented and the definition and description methods of time-constrained transition equivalence class （timeCTEC） are presented. Furthermore, the approaches of the testing sequence and test case generation are put forward. Finally, the proposed method is applied to a typical avionics real- time embedded software testing practice and the examples of the timeCTEC, testing sequences and test cases are given. With the analysis of the testing result, the application verification shows that the proposed method can effectively describe the real-time embedded software state transition characteristics and real-time requirements and play the advantages of the formal methods in accuracy, effectiveness and the automation supporting. Combined with the testing platform, the real-time, closed loop and automated simulation testing for real-time embedded software can be realized effectively.展开更多
The delay compensation method plays an essential role in maintaining the stability and achieving accurate real-time hybrid simulation results. The effectiveness of various compensation methods in different test scenar...The delay compensation method plays an essential role in maintaining the stability and achieving accurate real-time hybrid simulation results. The effectiveness of various compensation methods in different test scenarios, however, needs to be quantitatively evaluated. In this study, four compensation methods （i.e., the polynomial extrapolation, the linear acceleration extrapolation, the inverse compensation and the adaptive inverse compensation） are selected and compared experimentally using a frequency evaluation index （FEI） method. The effectiveness of the FEI method is first verified through comparison with the discrete transfer fimction approach for compensation methods assuming constant delay. Incomparable advantage is further demonstrated for the FEI method when applied to adaptive compensation methods, where the discrete transfer function approach is difficult to implement. Both numerical simulation and laboratory tests with predefined displacements are conducted using sinusoidal signals and random signals as inputs. Findings from numerical simulation and experimental results demonstrate that the FEI method is an efficient and effective approach to compare the performance of different compensation methods, especially for those requiring adaptation of compensation parameters.展开更多
Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no l...Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no longer the only metric by which optimality is judged.In fact,energy efficiency is becoming a preferred choice with a fundamental objective to optimize the system's lifetime.In this work,we propose an optimal energy efficient scheduling algorithm for aperiodic real-time jobs to reduce CPU energy consumption.Specifically,we apply the concept of real-time process scheduling to a dynamic voltage and frequency scaling(DVFS)technique.We address a variant of earliest deadline first(EDF)scheduling algorithm called energy saving-dynamic voltage and frequency scaling(ES-DVFS)algorithm that is suited to unpredictable future energy production and irregular job arrivals.We prove that ES-DVFS cannot attain a total value greater than C/ˆSα,whereˆS is the minimum speed of any job and C is the available energy capacity.We also investigate the implications of having in advance,information about the largest job size and the minimum speed used for the competitive factor of ES-DVFS.We show that such advance knowledge makes possible the design of semi-on-line algorithm,ES-DVFS∗∗,that achieved a constant competitive factor of 0.5 which is proved as an optimal competitive factor.The experimental study demonstrates that substantial energy savings and highest percentage of feasible job sets can be obtained through our solution that combines EDF and DVFS optimally under the given aperiodic jobs and energy models.展开更多
Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world...Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world refineries. In academic studies, refinery scheduling is usually treated as an integrated, large-scale optimization problem,though such complex optimization problems are extremely difficult to solve. In this paper, we proposed a way to exploit the prior knowledge existing in refineries, and developed a decision making system to guide the scheduling process. For a real world fuel oil oriented refinery, ten adjusting process scales are predetermined. A C4.5 decision tree works based on the finished oil demand plan to classify the corresponding category(i.e. adjusting scale). Then,a specific sub-scheduling problem with respect to the determined adjusting scale is solved. The proposed strategy is demonstrated with a scheduling case originated from a real world refinery.展开更多
The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The...The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.展开更多
The platform scheduling problem in battlefield is one of the important problems in military operational research.It needs to minimize mission completing time and meanwhile maximize the mission completing accuracy with...The platform scheduling problem in battlefield is one of the important problems in military operational research.It needs to minimize mission completing time and meanwhile maximize the mission completing accuracy with a limited number of platforms.Though the traditional certain models obtain some good results,uncertain model is still needed to be introduced since the battlefield environment is complex and unstable.An uncertain model is prposed for the platform scheduling problem.Related parameters in this model are set to be fuzzy or stochastic.Due to the inherent disadvantage of the solving methods for traditional models,a new method is proposed to solve the uncertain model.Finally,the practicability and availability of the proposed method are demonstrated with a case of joint campaign.展开更多
Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,i...Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,is still dominant in automobile industry,which is less flexible when welding objects or situation change.A novel real-time algorithm consisting of seam detection and generation is proposed to track seam.Using captured 3D points,space vectors were created between two adjacent points along each laser line and then a vector angle based algorithm was developed to detect target points on the seam.Least square method was used to fit target points to a welding trajectory for seam tracking.Furthermore,the real-time seam tracking process was simulated in MATLAB/Simulink.The trend of joint angles vs.time was logged and a comparison between the off-line and the proposed seam tracking algorithm was conducted.Results show that the proposed real-time seam tracking algorithm can work in a real-time scenario and have high accuracy in welding point positioning.展开更多
The implementation of artificial intelligence(AI)in a smart society,in which the analysis of human habits is mandatory,requires automated data scheduling and analysis using smart applications,a smart infrastructure,sm...The implementation of artificial intelligence(AI)in a smart society,in which the analysis of human habits is mandatory,requires automated data scheduling and analysis using smart applications,a smart infrastructure,smart systems,and a smart network.In this context,which is characterized by a large gap between training and operative processes,a dedicated method is required to manage and extract the massive amount of data and the related information mining.The method presented in this work aims to reduce this gap with near-zero-failure advanced diagnostics(AD)for smart management,which is exploitable in any context of Society 5.0,thus reducing the risk factors at all management levels and ensuring quality and sustainability.We have also developed innovative applications for a humancentered management system to support scheduling in the maintenance of operative processes,for reducing training costs,for improving production yield,and for creating a human–machine cyberspace for smart infrastructure design.The results obtained in 12 international companies demonstrate a possible global standardization of operative processes,leading to the design of a near-zero-failure intelligent system that is able to learn and upgrade itself.Our new method provides guidance for selecting the new generation of intelligent manufacturing and smart systems in order to optimize human–machine interactions,with the related smart maintenance and education.展开更多
基金Project (60505018) supported by the National Natural Science Foundation of China
文摘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.
基金The Natural Science Foundation of Jiangsu Province(NoBK2005408)
文摘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.
基金supported by the National Natural Science Foundation of China(Grant No.62403486)。
文摘The highly dynamic nature,strong uncertainty,and coupled multiple safety constraints inherent in carrier aircraft recovery operations pose severe challenges for real-time decision-making.Addressing bolter scenarios,this study proposes an intelligent decision-making framework based on a deep long short-term memory Q-network.This framework transforms the real-time sequencing for bolter recovery problem into a partially observable Markov decision process.It employs a stacked long shortterm memory network to accurately capture the long-range temporal dependencies of bolter event chains and fuel consumption.Furthermore,it integrates a prioritized experience replay training mechanism to construct a safe and adaptive scheduling system capable of millisecond-level real-time decision-making.Experimental demonstrates that,within large-scale mass recovery scenarios,the framework achieves zero safety violations in static environments and maintains a fuel safety violation rate below 10%in dynamic scenarios,with single-step decision times at the millisecond level.The model exhibits strong generalization capability,effectively responding to unforeseen emergent situations—such as multiple bolters and fuel emergencies—without requiring retraining.This provides robust support for efficient carrier-based aircraft recovery operations.
基金supported by the National Key R&D Program of China (2018YFA0702200)the Fundamental Research Funds of Shandong University。
文摘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.
基金This project is supported by National 973 Project of China (No.2002-CB312202) National Natural Science Foundation of China (No.60374005, No.60104004) Chinese Postdoctoral Fellowship Foundation.
文摘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.
文摘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.
基金Supported by the National Natural Science Foundation of China (60603032)
文摘Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit （FTRMFF） algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic （RM） algorithm. Then, the RM-based idleness factor and compact factor are presented to quantify the compact degree of tasks assigned to the same processor. In this paper, the novel fault-tolerant rate-monotonic compact-factor-driven （FTRMCFD） algorithm, which follows the principle of compact factor maximal when allocating the processors for tasks, is proposed. FTRMCFD algorithm makes every processor contain more tasks and get higher utilization to increase the schedulability performance of distributed systems. The simulation experiments reveal that FTRMCFD can reduce the number of required processors by up to 11.5% （with an average of 5.3%）.
文摘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.
基金the National Natural Science Foundation of China(60073045)
文摘Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.
基金supported by the National Natural Science Foundation of China under Grant No.61802052the Fundamental Research Funds for the Central Universities under Grant No.A030202063008085the China Postdoctoral Science Foundation Funded Project under Grant No.2017M612947。
文摘In the real-time scheduling theory,schedulability and synchronization analyses are used to evaluate scheduling algorithms and real-time locking protocols,respectively,and the empirical synthesis experiment is one of the major methods to compare the performance of such analyses.However,since many sophisticated techniques have been adopted to improve the analytical accuracy,the implementation of such analyses and experiments is often time-consuming.This paper proposes a schedulability experiment toolkit for multiprocessor real-time systems(SET-MRTS),which provides a framework with infrastructures to implement the schedulability and synchronization analyses and the deployment of empirical synthesis experiments.Besides,with well-designed peripheral components for the input and output,experiments can be conducted easily and flexibly on SET-MRTS.This demonstration further proves the effectiveness of SET-MRTS in both functionality and availability.
文摘Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.
基金The National Natural Science Foundationof China(No.60873030 )the National High-Tech Research and Development Plan of China(863 Program)(No.2007AA01Z309)
文摘By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The scbedulability of the system was analyzed through checkpointing and the energy saving was considered via dynamic voltage and frequency scaling. Simulation results showed that the proposed algorithm had better performance compared with the existing voltage allocation techniques. The proposed technique saves 51.5% energy over FT-Only and 19.9% over FT ＋ EC on average. Therefore, the proposed method was more appropriate for aperiodic tasks in embedded real-time systems.
基金supported by the Aviation Science Foundation of China
文摘The reliability of real-time embedded software directly determines the reliability of the whole real-time embedded sys- tem, and the effective software testing is an important way to ensure software quality and reliability. Based on the analysis of the characteristics of real-time embedded software, the formal method is introduced into the real-time embedded software testing field and the real-time extended finite state machine （RT-EFSM） model is studied firstly. Then, the time zone division method of real-time embedded system is presented and the definition and description methods of time-constrained transition equivalence class （timeCTEC） are presented. Furthermore, the approaches of the testing sequence and test case generation are put forward. Finally, the proposed method is applied to a typical avionics real- time embedded software testing practice and the examples of the timeCTEC, testing sequences and test cases are given. With the analysis of the testing result, the application verification shows that the proposed method can effectively describe the real-time embedded software state transition characteristics and real-time requirements and play the advantages of the formal methods in accuracy, effectiveness and the automation supporting. Combined with the testing platform, the real-time, closed loop and automated simulation testing for real-time embedded software can be realized effectively.
基金National Natural Science Foundation of China under Grant No.51378107the Fundamental Research Funds for the Central Universities and Priority Academic Program Development of Jiangsu Higher Education Institutions under Grant No.KYLX-0158the National Natural Science Foundation under Grant No.CMMI-1227962
文摘The delay compensation method plays an essential role in maintaining the stability and achieving accurate real-time hybrid simulation results. The effectiveness of various compensation methods in different test scenarios, however, needs to be quantitatively evaluated. In this study, four compensation methods （i.e., the polynomial extrapolation, the linear acceleration extrapolation, the inverse compensation and the adaptive inverse compensation） are selected and compared experimentally using a frequency evaluation index （FEI） method. The effectiveness of the FEI method is first verified through comparison with the discrete transfer fimction approach for compensation methods assuming constant delay. Incomparable advantage is further demonstrated for the FEI method when applied to adaptive compensation methods, where the discrete transfer function approach is difficult to implement. Both numerical simulation and laboratory tests with predefined displacements are conducted using sinusoidal signals and random signals as inputs. Findings from numerical simulation and experimental results demonstrate that the FEI method is an efficient and effective approach to compare the performance of different compensation methods, especially for those requiring adaptation of compensation parameters.
文摘Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no longer the only metric by which optimality is judged.In fact,energy efficiency is becoming a preferred choice with a fundamental objective to optimize the system's lifetime.In this work,we propose an optimal energy efficient scheduling algorithm for aperiodic real-time jobs to reduce CPU energy consumption.Specifically,we apply the concept of real-time process scheduling to a dynamic voltage and frequency scaling(DVFS)technique.We address a variant of earliest deadline first(EDF)scheduling algorithm called energy saving-dynamic voltage and frequency scaling(ES-DVFS)algorithm that is suited to unpredictable future energy production and irregular job arrivals.We prove that ES-DVFS cannot attain a total value greater than C/ˆSα,whereˆS is the minimum speed of any job and C is the available energy capacity.We also investigate the implications of having in advance,information about the largest job size and the minimum speed used for the competitive factor of ES-DVFS.We show that such advance knowledge makes possible the design of semi-on-line algorithm,ES-DVFS∗∗,that achieved a constant competitive factor of 0.5 which is proved as an optimal competitive factor.The experimental study demonstrates that substantial energy savings and highest percentage of feasible job sets can be obtained through our solution that combines EDF and DVFS optimally under the given aperiodic jobs and energy models.
基金Supported by the National Natural Science Foundation of China(21706282,21276137,61273039,61673236)Science Foundation of China University of Petroleum,Beijing(No.2462017YJRC028)the National High-tech 863 Program of China(2013AA 040702)
文摘Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world refineries. In academic studies, refinery scheduling is usually treated as an integrated, large-scale optimization problem,though such complex optimization problems are extremely difficult to solve. In this paper, we proposed a way to exploit the prior knowledge existing in refineries, and developed a decision making system to guide the scheduling process. For a real world fuel oil oriented refinery, ten adjusting process scales are predetermined. A C4.5 decision tree works based on the finished oil demand plan to classify the corresponding category(i.e. adjusting scale). Then,a specific sub-scheduling problem with respect to the determined adjusting scale is solved. The proposed strategy is demonstrated with a scheduling case originated from a real world refinery.
基金supported by the National Natural Science Foundation of China(6110118461174159)
文摘The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.
基金supported by the National Natural Science Foundation of China(61573017)
文摘The platform scheduling problem in battlefield is one of the important problems in military operational research.It needs to minimize mission completing time and meanwhile maximize the mission completing accuracy with a limited number of platforms.Though the traditional certain models obtain some good results,uncertain model is still needed to be introduced since the battlefield environment is complex and unstable.An uncertain model is prposed for the platform scheduling problem.Related parameters in this model are set to be fuzzy or stochastic.Due to the inherent disadvantage of the solving methods for traditional models,a new method is proposed to solve the uncertain model.Finally,the practicability and availability of the proposed method are demonstrated with a case of joint campaign.
基金Supported by Ministerial Level Advanced Research Foundation(65822576)Beijing Municipal Education Commission(KM201310858004,KM201310858001)
文摘Real-time seam tracking can improve welding quality and enhance welding efficiency during the welding process in automobile manufacturing.However,the teaching-playing welding process,an off-line seam tracking method,is still dominant in automobile industry,which is less flexible when welding objects or situation change.A novel real-time algorithm consisting of seam detection and generation is proposed to track seam.Using captured 3D points,space vectors were created between two adjacent points along each laser line and then a vector angle based algorithm was developed to detect target points on the seam.Least square method was used to fit target points to a welding trajectory for seam tracking.Furthermore,the real-time seam tracking process was simulated in MATLAB/Simulink.The trend of joint angles vs.time was logged and a comparison between the off-line and the proposed seam tracking algorithm was conducted.Results show that the proposed real-time seam tracking algorithm can work in a real-time scenario and have high accuracy in welding point positioning.
文摘The implementation of artificial intelligence(AI)in a smart society,in which the analysis of human habits is mandatory,requires automated data scheduling and analysis using smart applications,a smart infrastructure,smart systems,and a smart network.In this context,which is characterized by a large gap between training and operative processes,a dedicated method is required to manage and extract the massive amount of data and the related information mining.The method presented in this work aims to reduce this gap with near-zero-failure advanced diagnostics(AD)for smart management,which is exploitable in any context of Society 5.0,thus reducing the risk factors at all management levels and ensuring quality and sustainability.We have also developed innovative applications for a humancentered management system to support scheduling in the maintenance of operative processes,for reducing training costs,for improving production yield,and for creating a human–machine cyberspace for smart infrastructure design.The results obtained in 12 international companies demonstrate a possible global standardization of operative processes,leading to the design of a near-zero-failure intelligent system that is able to learn and upgrade itself.Our new method provides guidance for selecting the new generation of intelligent manufacturing and smart systems in order to optimize human–machine interactions,with the related smart maintenance and education.
