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.展开更多
This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Cezhou da...This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Cezhou dam and the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under multiple constraints. This paper proposes a series queuing network (SQN) scheduling algorithm to divide the total ships that intend to pass through the shiplocks into four queues and calculate dynamically the weight of priority for each ship. The SQN scheduling algorithm schedules ships according to their priority weights which is determined by the characteristics of each ship, such as length, width, affiliation, waiting time, and so on. In the process, the operation conditions of Gezhou dam related to the navigable shiplocks and the task balancing among different shiplocks also should be considered. The SQN algorithm schedules ships circularly and optimizes the results step by step. Real operation data from our project shows that our SQN scheduling algorithm outperforms the traditional manual scheduling in which the less computational time is taken, the area utilization ratio of the five shiplocks is increased, the waiting time of high-prioritized ships is shorten, and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam.展开更多
基金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 under Grant No. 60904074the Natural Science Foundation of Hubei Province of China under Grant No. 2008CDB012the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200804871150
文摘This paper provides a mathematical model for Three Gorges-Gezhou dam co-scheduling problem, based on full analysis of Three Corges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Cezhou dam and the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under multiple constraints. This paper proposes a series queuing network (SQN) scheduling algorithm to divide the total ships that intend to pass through the shiplocks into four queues and calculate dynamically the weight of priority for each ship. The SQN scheduling algorithm schedules ships according to their priority weights which is determined by the characteristics of each ship, such as length, width, affiliation, waiting time, and so on. In the process, the operation conditions of Gezhou dam related to the navigable shiplocks and the task balancing among different shiplocks also should be considered. The SQN algorithm schedules ships circularly and optimizes the results step by step. Real operation data from our project shows that our SQN scheduling algorithm outperforms the traditional manual scheduling in which the less computational time is taken, the area utilization ratio of the five shiplocks is increased, the waiting time of high-prioritized ships is shorten, and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam.