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

45th Annual Frontiers in Education Conference (FIE)

作者： Suranauwarat, Sukanya Natl Inst Dev Adm NIDA Grad Sch Appl Stat Bangkok Thailand

ISBN: (纸本)9781479984541

cpu scheduling is one of the most important topics in operating systems courses. However, the main problem in learning cpu scheduling from textbooks is that textbooks usually simplify the illustration of cpu scheduling algorithms by using an unrealistic process execution model. They also do not give concrete examples when discussing complex algorithms. As a result, students are not able to gain insight into exactly how the algorithms work in real-world operating systems. To address this problem, the author developed an interactive Java-based software tool that uses graphical animation to convey the concepts of various cpu scheduling algorithms for a single cpu. While many existing animation tools were designed to be closely aligned with the content in traditional operating systems textbooks, this tool is uniquely designed and different in a number of respects. In this paper, the impact of the tool on student learning is measured, analyzed and discussed in detail. The tool has been used in two sections of the operating systems course at the author's institute, and has demonstrated effectiveness in assisting student learning of cpu scheduling algorithms.

关键词： Educational Software Animation Tool Computer Science Education cpu scheduling algorithms Operating System

来源：评论

学校读者我要写书评

暂无评论

Agent-Based Adaptive Dynamic Round Robin (AADRR) scheduling Algorithm

引用

IEEE ACCESS 2025年 13卷 18308-18324页

作者： Iqbal Khan, Zafar Khan, Muzafar Nasir Mehmood Shah, Syed Natl Univ Modern Languages Dept Software Engn Islamabad 44000 Pakistan KICSIT Kahuta Campus Inst Space Technol Dept Comp Sci Islamabad 44000 Pakistan

scheduling techniques are essential to increase resource utilization and task execution within modern computing environments. Round Robin scheduling (RR) ensures a fair distribution of processes needing attention but often leads to inefficiencies in systems with heterogeneous tasks or different priorities due to large latency or resource usage differences. To address such problems, this paper introduces the Agent-based Adaptive Dynamic Round Robin (AADRR) process scheduling technique, which enhances process scheduling by continuously adjusting the time quantum and criteria, combining cpu burst time and priority. In the proposed AADRR, all processes are ranked dynamically by a software agent based on user preferences and current system load. This agent operates independently by keeping an eye on system parameters and making the required adjustments in real-time without requiring human intervention. We place processes in the queue according to their order of importance. A dynamic time quantum policy is suitable whenever it meets the mean duration of each process in the queue. Every round has the time quantum adjusted based on this method average burst time. AADRR highlights that the short processes are managed properly and the long processes are completed within a few rounds to fairly complete and maintain all the processes in the system. The proposed AADRR is more suitable for periodic tasks that employ a dynamic scheduling system and adapt time quantum according to the system state and job features. Additionally, AADRR efficiently manages preemptable tasks, using dynamic scheduling policies to accommodate variations in process priority and cpu burst times, ensuring fair scheduling, efficient resource utilization, and dynamic adaptability. To validate the effectiveness of the AADRR algorithm, we performed a comparative performance analysis with twelve other algorithms, including five traditional cpu scheduling algorithms and seven advanced job scheduling techniques,

关键词： Heuristic algorithms Dynamic scheduling Switches Round robin Operating systems Time factors Real-time systems Monte Carlo methods System performance Resource management cpu scheduling algorithms round robin (RR) context switching (NCS) dynamic time quantum (DTQ) Monte Carlo probability distribution

来源：评论

学校读者我要写书评

暂无评论

A cpu scheduling algorithm simulator

A CPU scheduling algorithm simulator

引用

37th Annual Frontiers in EducationConference

作者： Suranauwarat, Sukanya Natl Inst Dev Adm Sch Appl Stat Bangkok 10240 Thailand

ISBN: (纸本)9781424410835

This paper presents a simulator that uses graphical animation to convey the concepts of various scheduling algorithms for a single cpu. The simulator is unique in a number of respects. First, it uses a more realistic process model that can be configured easily by the user. Second, it graphically depicts each process in terms of what the process is currently doing against time. Using this representation, it becomes much easier to understand what is going on inside the system and why a different set of processes is a candidate for the allocation of the cpu at different time. A third unique feature of the simulator is that it allows the user to test and increase his understanding of the concepts studied by making his own scheduling decisions, through the very easy-to-use graphical user interface of the simulator. The simulator can be used by students in operating system courses or by anyone interested in learning cpu scheduling algorithms in an easier and a more effective way.

关键词： algorithm animation computer science education cpu scheduling algorithms operating systems

来源：评论

学校读者我要写书评

暂无评论

A novel intelligent round robin cpu scheduling algorithm

引用

International Journal of Information Technology (Singapore) 2022年第3期14卷 1475-1482页

作者： Sharma, Prem Sagar Kumar, Sanjeev Gaur, Madhu Sharma Jain, Vinod G L Bajaj Institute of Technology and Management Plot No. 2 Knowledge Park III Distt. G.B. Nagar Uttar Pradesh Greater Noida 201306 India Department of Computer Engineering and Applications GLA University Mathura 17km Stone NH-2 Mathura-Delhi Road Post Office Chaumuhan Uttar Pradesh Mathura India

In the present era of smart computing and digital transformation multiprogramming multitasking, multi-user operating environment is playing an important role where rapid arrival, termination and switching of multiple processes is crucial for performance. cpu Utilization is one of the key performance parameter and cpu scheduling crucial for cpu utilization. On the way of improving performance, substantial research and efforts are being done by community researchers and operating system processing is becoming fast day by day. Major performance evaluations criteria like waiting time, response time turnaround time number of context switching are sophisticatedly enhanced to achieve better processing. Round-Robin (RR) scheduling is a well-known important scheduling algorithm where quantum time slot pointedly affect performance. In case of very large quantum time it works like First come first serve or if it is too small then RR works like a process sharing algorithm which increases the system overheads in view of context switching. Thus setting up an effective quantum time is a major challenge for researchers. In this work a clustering inspired novel intelligent approach has been proposed to significantly enhance the round robin algorithm performance. An intelligent sub ready queue by using standard deviation and optimal threshold is created. Dynamic quantum is generated for each cluster and performance is evaluated on sample data in terms of waiting time, response time, turnaround time and context switching. The results of the proposed intelligent approach are compared with other existing algorithms and are found better. © 2021, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： cpu scheduling algorithms Dynamic time quantum Intelligent round robin scheduling Jobs clustering Operating system

来源：评论

学校读者我要写书评

暂无评论

Design and Evaluation of a Neurofuzzy cpu scheduling Algorithm

Design and Evaluation of a Neurofuzzy CPU Scheduling Algorit...

引用

IEEE 11th International Conference on Networking, Sensing and Control (ICNSC)

作者： Jawad, Shatha Eastridge Grp Staffing Co Software Engn Dept San Diego CA 92108 USA

ISBN: (纸本)9781479931064

cpu scheduling is the basis of multiprocessing operating systems. By switching the cpu among processes, the operating system can make the computer more productive. There are many different cpu scheduling algorithms. Different algorithms have different properties and may favor one class of processes over another and no single one is ideal absolutely for every application. This paper presents an attempt to apply neurofuzzy in the design and implementation of a rule-based scheduling algorithm to solve the shortcoming of well-known scheduling algorithms. A fuzzy-based decision maker has been proposed to compute a new priority of all cpu processes according to the process pre-priority and its execution time. Results given in this paper demonstrate that the average waiting time and the average turnaround time in the proposed algorithm are better than that obtained using preemptive priority scheduling, and closed to that obtained from preemptive shortest-job-first (SJF) scheduling. The new proposed algorithm is a dynamic scheduling algorithm which deals with both process priority and its execution time, while the preemptive SJF scheduling algorithm doesn't. The results obtained, using neurofuzzy, are approximately the choice as for fuzzy but it responds faster than it. On the other hand the functional neurofuzzy is the best algorithm compared with structural and fuzzy scheduling algorithms.

关键词： Operating Systems multiprocessing cpu scheduling algorithms preemptive scheduling Fuzzy Decision Making Structural Neurofuzzy system Functional Neurofuzzy system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：