检索结果-内蒙古大学图书馆

Multicycle polling scheduling algorithms for FieldBus networks

REAL-TIME SYSTEMS 2003年第2-3期25卷 157-185页

作者： Cavalieri, S Monforte, S Corsaro, A Scapellato, G Univ Catania Fac Engn Dept Comp Sci & Telecommun Engn I-95125 Catania Italy Univ Calif Irvine Dept Elect & Comp Engn Irvine CA 92697 USA Ericsson Lab Italy I-00040 Rome Italy

The paper deals with the scheduling of periodic information flow in a FieldBus environment. The scheduling problem is defined from an analytical point of view, giving a brief survey of the most well-known solutions. One of these is called multicycle polling scheduling, which is based on the hypothesis that all the production periods of the periodic processes to be scheduled are harmonic. Although in some process control or manufacturing scenarios, this hypothesis may be acceptable, there are many real industrial processes to which it cannot be applied. The aim of the paper is to make a contribution towards solving the scheduling problem. It essentially concerns extension of the theory on which multicycle polling scheduling is based to a much more realistic and general scenario, where the periods of all the processes to be scheduled have arbitrary values. The authors present a new formulation of multicycle polling scheduling, called extended multicycle polling scheduling, and demonstrate that it comprises the scenario currently considered in the literature. Two algorithmic solutions for extended multicycle polling scheduling are then proposed, giving a computational complexity analysis which will highlight the capability of the algorithmic scheduling solutions to be performed on-line. The paper concludes by comparing the multicycle polling scheduling approach known in literature and the one presented in the paper. Comparison is performed by evaluating the use of available bandwidth to serve both periodic and asynchronous traffic in the two approaches.

关键词： FieldBus communication networks hard real-time scheduling priority scheduling algorithm rate monotonic algorithm earliest deadline first algorithm

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm-based neural fuzzy decision tree for mixed scheduling in ATM networks

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 2002年第6期32卷 832-845页

作者： Lin, CT Chung, IF Pu, HC Lee, TH Chang, JY Natl Chiao Tung Univ Dept Elect & Control Engn Hsinchu 300 Taiwan

Future broad-band integrated services networks based on the asynchronous transfer mode (ATM), technology are expected to support multiple types of multimedia information with diverse statistical characteristics and quality of service (QoS) requirements. To meet these requirements, efficient scheduling methods are important for traffic control in the ATM networks. Among the general scheduling schemes, the rate monotonic algorithm is simple enough to be used in high-speed networks, but it does not attain as high a system utilization as the deadline driven algorithm does. However, the deadline driven scheme is computationally complex and hard to implement in hardware. The mixed scheduling algorithm is the combination of the rate monotonic algorithm and the deadline driven algorithm;thus it can provide most of the benefits of these two algorithms. In this paper, we use the mixed scheduling algorithm to achieve high system utilization under the hardware constraint. Because there is no analytic method for the schedulability test of the mixed scheduling, we propose a genetic algorithm-based neural fuzzy decision tree (GANFDT) to realize it in a real-time environment. The GANFDT combines the GA and a neural fuzzy network into a binary classification tree. This approach also exploits the power of the classification tree. Simulation results show that the GANFDT provides an efficient way to carry out the mixed scheduling in the ATM networks.

关键词： binary decision tree deadline driven algorithm quality of service (QoS) rate monotonic algorithm recursive least square (RLS) schedulability test

来源：评论

学校读者我要写书评

暂无评论

Probabilistic optimisation of checkpoint intervals for real-time multi-tasks

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2013年第4期44卷 595-603页

作者： Kwak, Seong Woo Yang, Jung-Min Keimyung Univ Dept Elect Engn Taegu 704701 South Korea Catholic Univ Daegu Dept Elect Engn Gyongsan 712702 Gyeongbuk South Korea

This article considers the checkpoint placement problem for real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by the rate monotonic algorithm, and checkpoints are inserted at a constant interval in each task while the width of the interval is different with respect to the task. We derive an explicit formula of the probability that all the tasks are successfully completed with a given set of checkpoint intervals. Then we determine the optimal checkpoint intervals that maximise the probability of task completion. The probability computation includes the schedulability analysis with respect to the numbers of re-executed checkpoint intervals. Our method does not necessitate any algebraic condition on the periods of the scheduled tasks.

关键词： checkpointing fault-tolerance checkpoint intervals rate monotonic algorithm arbitrary periods

来源：评论

学校读者我要写书评

暂无评论

Overhead elimination mechanisms in real-time systems

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2006年第5-6期6卷 S399-S411页

作者： Lee, Ilhyun Lee, Haesun K. Debnath, Narayan Univ Texas Permian Basin Dept Sci & Math Odessa TX 79762 USA Winona State Univ Dept Comp Sci Winona MN 55987 USA

The OEM (Overhead Elimination Mechanism), a scheduler for finding minimal overheads with reduced context switches in real-time systems, was developed using procedural methods. Software produced by these methods has often proven to be inflexible and difficult to modify or enhance. Because an object-oriented approach makes it easier to enhance the system, we will explore an object-oriented OEM, OOEM, in real-time environments. The OOEM (Object-oriented Overhead Elimination Mechanism) is the shift result from the transition from procedural approach to object-oriented approach and it will be a basis for building more dynamic real time environments such as aperiodic, BP, and sporadic. The operation, implementation, and performance of the OEM and OOEM will be presented. A comparison between our algorithms and other well-known algorithms in terms of context switches will also be shown. A valuable contribution of this research is to provide the real-time system designer with a wide range of alternative for reducing the complexity of system development and can lead higher quality system.

关键词： Real-time scheduling context switches rate monotonic algorithm procedural object-oriented

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithms for Real Time Operating Systems in Space Domain 5

Scheduling Algorithms for Real Time Operating Systems in Spa...

引用

5th International Conference on Computer Science and Engineering (UBMK)

作者： Kutlu, Ezgi Gencturk, Camal Turk Havacilik & Uzay Sanayii AS Uzay Sistemleri Yazilim Muhendisligi Ankara Turkey

ISBN: (纸本)9781728175652

Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are some services (priority based preemption etc.) in real time operating systems to control software tasks. But in some situations there is a need for scheduling algorithms in real time systems. This need arises especially when time-critical software tasks need to run at different working periods and on a specific timeline. Different scheduling algorithms can be selected to meet the requirements of the system. The flight software that runs on the real-time operating system, especially on satellite platforms, is responsible for time-critical tasks. Main goals of this paper are providing analyze of scheduling algorithms using in real time operating systems, giving the method which is used to apply scheduling algorithms in a real time operating system and providing performance results of these scheduling algorithms obtained as a result of this application. In addition, it is mentioned that which of these algorithms are preferred in space domain.

关键词： Space Domain Operating System Task Scheduling algorithms Round Robin algorithm rate monotonic algorithm Deadline monotonic algorithm Earliest Deadline First algorithm Least Laxity First algorithm Enhanced Least Laxity First algorithm

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant scheduling scheme for hybrid tasks in distributed real-time systems

A fault-tolerant scheduling scheme for hybrid tasks in distr...

引用

3rd IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems

作者： Hong, YS Goo, HW Dongguk Univ Seoul South Korea

ISBN: (纸本)0769523579

This paper studies a fault-tolerant real-time scheduling algorithm for hybrid task sets which contain periodic tasks and aperiodic tasks. A previously proposed fault-tolerant periodic scheduling was extended to hybrid scheduling based on time redundancy and space redundancy. Periodic tasks are assigned to processors using fast and simple heuristic scheme and joint scheduling is used for periodic and aperiodic tasks. A simulation study shows the effectiveness of the proposed approach.

关键词： fault tolerance aperiodic task rate monotonic algorithm real-time scheduling space redundancy passive replication

来源：评论

学校读者我要写书评

暂无评论

Towards Fault-Tolerant Real-Time Scheduling in the seL4 Microkernel

Towards Fault-Tolerant Real-Time Scheduling in the seL4 Micr...

引用

18th IEEE International Conference on High Performance Computing and Communications (HPCC) / 14th IEEE International Conference on Smart City (Smart City) / 2nd IEEE International Conference on Data Science and Systems (DSS)

作者： Xu, Libin Bai, Yuebin Cheng, Kun Ge, Lingyu Nie, Danning Zhang, Lijun Liu, Wenjia Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China Sci & Technol Commun Networks Lab Shijiazhuang 050081 Peoples R China

ISBN: (纸本)9781509042975

System dependability and real-time requirement have been receiving widespread attention in modern computer systems. Fault-tolerant real-time scheduling provides a method of combining timing requirements and faults tolerance for real-time systems. This paper presents a preliminary study of building a fault-tolerant real-time mechanism for seL4 microkernel. seL4, as the first formally-verified operating system kernel in the world, is an ideal platform for security-critical systems. However, the lack of real-time and fault-tolerant policy reduces its the reliability and user experience. We have implemented basic real-time and checkpoint mechanisms in seL4, and propose the Check-Point based Fault-Tolerant RM (CP-FTRM) scheduling policy. The experiments have shown the feasibility and efficiency of them.

关键词： real-time system fault-tolerance time redundancy rate monotonic algorithm checkpoint seL4

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant technique for scheduling periodic tasks in real-time systems

A fault-tolerant technique for scheduling periodic tasks in ...

引用

2nd IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems

作者： Hong, YS Goo, HW Dongguk Univ Seoul South Korea

ISBN: (纸本)0769521231

We present in this paper a heuristic for producing a fault-tolerant schedule of given periodic tasks in distributed real-time systems;Tasks are divided into two classes according to their task utilization. In order to recover from faults, a hybrid scheme based on space redundancy and time redundancy is used. We use a very simple and fast heuristic to provide fault tolerance and reduce time overhead in case of transient faults in distributed real-time systems. We show that our approach can improve processor utilization.

关键词： fault tolerance rate monotonic algorithm real-time scheduling time redundancy processor utilization

来源：评论

学校读者我要写书评

暂无评论

MAINTAINING THE FEASIBILITY OF HARD REAL-TIME SYSTEMS WITH A REDUCED NUMBER OF PRIORITY LEVELS

引用

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE 2015年第4期25卷 709-722页

作者： Qureshi, Muhammad Bilal Alrashed, Saleh Min-Allah, Nasro Kolodziej, Joanna Arabas, Piotr COMSATS Inst Informat Technol Dept Comp Sci Islamabad 46000 Pakistan Univ Dammam Coll Comp Sci & Informat Technol Dammam Saudi Arabia Cracow Univ Technol Inst Comp Sci PL-31155 Krakow Poland Warsaw Univ Technol Inst Control & Computat Engn PL-02796 Warsaw Poland

When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.

关键词： real-time systems feasibility analysis fixed-priority scheduling rate monotonic algorithm online scheduling

来源：评论

学校读者我要写书评

暂无评论

Towards Fault-Tolerant Real-Time Scheduling in the seL4 Microkernel

Towards Fault-Tolerant Real-Time Scheduling in the seL4 Micr...

引用

IEEE International Conference on High Performance Computing and Communications

作者： Libin Xu Yuebin Bai Kun Cheng Lingyu Ge Danning Nie Lijun Zhang Wenjia Liu School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9781509042982

关键词： seL4 real-time system fault-tolerance time redundancy rate monotonic algorithm checkpoint

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：