Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitions becomes popular as an alternative to the traditional federated architecture. This study investigates th...Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitions becomes popular as an alternative to the traditional federated architecture. This study investigates the problem of designing hierarchical scheduling for IMA systems. The proposed scheduler model enables strong temporal partitioning, so that multiple hard real-time applications can be easily integrated into an uniprocessor platform. This paper derives the mathematic relationships among parti- tion cycle, partition capacity and schedulability under the real-time condition, and then proposes an algorithm for optimizing partition parameters. Real-time tasks with arbitrary deadlines are considered for generality. To further improve the basic algo- rithm and reduce the energy consumption for embedded systems in aircraft, a power optimization approach is also proposed by exploiting the slack time. Experimental results show that the designed system can guarantee the hard real-time requirement and reduce the power consumption by at least 14%.展开更多
Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical app...Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.展开更多
The paper considers a serial-batching scheduling problem on hierarchical optimization with two regular maximum costs,where hierarchical optimization means the primary objective function is minimized,and keeping the mi...The paper considers a serial-batching scheduling problem on hierarchical optimization with two regular maximum costs,where hierarchical optimization means the primary objective function is minimized,and keeping the minimum value of the primary objective function,the secondary objective function is also minimized.In serial-batching machine environment,the machine processes the jobs in batch,and the jobs in the identical batch are processed by entering into the machine together and leaving the machine together.The time taken to process a batch amounts to the total processing time of the jobs in the batch.Moreover,a fixed switching time s is inserted when a machine begins to process a new batch.We only study the unbounded model,i.e.,the batch capacity is unbounded.We give an algorithm that can solve the hierarchical optimization problem in O(n4)time,where n denotes the number of jobs.展开更多
This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily...This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job.The objective is to minimize the makespan.The authors present an optimal algorithm for the problem with three hierarchies.展开更多
基金Foundation item： National Natural Science Foundation of China （60879024）
文摘Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitions becomes popular as an alternative to the traditional federated architecture. This study investigates the problem of designing hierarchical scheduling for IMA systems. The proposed scheduler model enables strong temporal partitioning, so that multiple hard real-time applications can be easily integrated into an uniprocessor platform. This paper derives the mathematic relationships among parti- tion cycle, partition capacity and schedulability under the real-time condition, and then proposes an algorithm for optimizing partition parameters. Real-time tasks with arbitrary deadlines are considered for generality. To further improve the basic algo- rithm and reduce the energy consumption for embedded systems in aircraft, a power optimization approach is also proposed by exploiting the slack time. Experimental results show that the designed system can guarantee the hard real-time requirement and reduce the power consumption by at least 14%.
基金supported by the National Natural Science Foundation of China (60879024)
文摘Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.
基金Key Research Project of Henan Higher Education Institutions(No.20A110003)Project for Henan Overseas Students in 2020 and the National Natural Science Foundation of China(No.12001169).
文摘The paper considers a serial-batching scheduling problem on hierarchical optimization with two regular maximum costs,where hierarchical optimization means the primary objective function is minimized,and keeping the minimum value of the primary objective function,the secondary objective function is also minimized.In serial-batching machine environment,the machine processes the jobs in batch,and the jobs in the identical batch are processed by entering into the machine together and leaving the machine together.The time taken to process a batch amounts to the total processing time of the jobs in the batch.Moreover,a fixed switching time s is inserted when a machine begins to process a new batch.We only study the unbounded model,i.e.,the batch capacity is unbounded.We give an algorithm that can solve the hierarchical optimization problem in O(n4)time,where n denotes the number of jobs.
基金supported by National Natural Science Foundation of China under Grant No.11171106
文摘This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job.The objective is to minimize the makespan.The authors present an optimal algorithm for the problem with three hierarchies.
