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

Alg_OS-A Web-Based Software Tool to Teach page replacement algorithms of Operating Systems to Undergraduate Students

引用

COMPUTER APPLICATIONS IN ENGINEERING EDUCATION 2013年第4期21卷 581-585页

作者： Garmpis, Aristogiannis Technol Educ Inst Messolonghi Dept Appl Informat Adm & Econ Mesolongion Greece Technol Educ Inst Messolonghi Dept Appl Informat Adm & Econ Data Bases & Informat Syst Lab Mesolongion Greece

Operating systems (OS) is an important and mandatory discipline in many Computer Science, Information Systems, and Computer Engineering curricula. Some of its topics require a careful and detailed explanation from the instructor as they often involve theoretical concepts and somewhat complex mechanisms, demanding a certain degree of abstraction from the students if they are to gain a full understanding. The aim of this study was to design and evaluate the software tool Alg_OS. This software tool was designed to serve the learning purposes of the memory management and especially the page replacement algorithms operation to be used in the everyday OS classrooms. The undergraduate students can easily explore the operations of those algorithms through an interaction with Alg_OS user interface. More specifically, students can develop the operation way for each algorithm separately and learn from their mistakes that the software shows automatically in real time. All students performances stored in a database of Alg_OS. A total of 111 final-year undergraduate university students of the Department of Applied Informatics in Management and Economy, Technological Educational Institution of Messolonghi, Messolonghi, Greece were surveyed about their intention to use Alg_OS in their learning. The results showed that students had positive values indicating a tendency to be favorable towards using Alg_OS in their learning. (c) 2010 Wiley Periodicals, Inc. Comput Appl Eng Educ 21: 581-585, 2013

关键词： operating systems page replacement algorithms Alg_OS instructional tool

来源：评论

学校读者我要写书评

暂无评论

Teaching and Learning page replacement algorithms using a Java-Based Visualization Tool

Teaching and Learning Page Replacement Algorithms using a Ja...

引用

13th WSEAS International Conference on Computers

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

ISBN: (纸本)9789604740994

This paper presents a Java-based visualization tool that uses graphical animation to convey the concepts of various page replacement algorithms. This tool is unique in a number of respects. First, it differentiates the read-access pages from the write-access ones, since the cost of replacing a page that has been modified is greater than for one that has not. Second, it allows the user to practice and test his understanding of the concepts he has learnt through a very easy-to-use graphical user interface. Third, it allows the user to compare the performance of two different algorithms or that of the same algorithm with different conditions in an easy manner. This tool can be used by teachers and students in Operating Systems courses as a teaching and learning aid or by anyone who is interested in page replacement algorithms.

关键词： Algorithm Animation Visualization Tool Computer Science Education page replacement algorithms Operating System

来源：评论

学校读者我要写书评

暂无评论

A page replacement algorithm based on a fuzzy approach to improve cache memory performance

引用

SOFT COMPUTING 2020年第2期24卷 955-963页

作者： Bengar, Davood Akbari Ebrahimnejad, Ali Motameni, Homayun Golsorkhtabaramiri, Mehdi Islamic Azad Univ Babol Branch Dept Comp Engn Babol Sar Iran Islamic Azad Univ Qaemshahr Branch Dept Math Qaemshahr Iran Islamic Azad Univ Sari Branch Dept Comp Engn Sari Iran

The memory management in the operating system includes a part called the page replacement algorithms. replacement algorithms in environments that require high-performance computing are considered as an important issue. For example, these algorithms are very important in cache management in microprocessors, web caching, replication strategies in distributed information systems and so on. Due to the important role of replacement algorithms in overcoming the problem of performance caused by the difference in processor speeds and memory, many algorithms were proposed. Most of them are the developed schemes of the least frequently used (LFU) and least recently used (LRU). Although most proposed designs can solve the LRU and LFU defects, they are implemented in a difficult way. The most important advantage of LRU and LFU is their simple implementation. This research proposes a page replacement algorithm that is simple to implement. The algorithm, which uses three parameters to cluster cache pages, is called the fuzzy page replacement algorithm. Whenever a miss occurs, it selects a page of the cluster with the lowest priority which has the smallest Euclidean distance with its center and then exits the cache. The most significant advantage of the algorithm is using the FCM (fuzzy c-means) algorithm to cluster pages, resulting in better replacement and hence higher memory performance.

关键词： Operating system Memory management page replacement algorithms Cache Fuzzy c-means

来源：评论

学校读者我要写书评

暂无评论

A page replacement algorithm simulator

A page replacement algorithm simulator

引用

9th World Multi-Conference on Systemics, Cybernetics and Informatics

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

ISBN: (纸本)9789806560550

As an aid to the study of memory management, we have developed a visualization tool that uses graphical animation to convey the concepts of various page replacement algorithms. One of the most outstanding features of this tool is that it allows the user to practice and test his understanding of the concepts he has learnt through a very easy-to-use graphical user interface. The tool can be used by students in Operating System courses or by anyone interested in learning page replacement algorithms in an easier and a more effective way.

关键词： algorithm animation visualization tool page replacement algorithms memory management and operating system

来源：评论

学校读者我要写书评

暂无评论

Segmented FIFO page replacement 81

Segmented FIFO page replacement

引用

1981 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1981

作者： Turner, Rollins Levy, Henry Digital Equipment Corporation United States

ISBN: (纸本)0897910516

A fixed-space page replacement algorithm is presented. A variant of FIFO management using a secondary FIFO buffer, this algorithm provides a family of performance curves lying between FIFO and LRU. The implementation is simple, requires no periodic scanning, and uses no special hardware support. Simulations are used to determine the performance of the algorithm for several memory reference traces. Both the fault rates and overhead cost are examined. © 1981 ACM.

关键词： Performance evaluation LRU page replacement FIFO page replacement page replacement algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of An Efficient page replacement Policy

Design and Implementation of An Efficient Page Replacement P...

引用

8th International Conference on Researches in Engineering, Technology and Sciences (ICRETS)

作者： Davood Akbari Bengar Department of Computer Sciences Savadkooh BranchIslamic Azad University

In operating system,the subject about memory management contains a section namely replacement *** replacement algorithms play a crucial part in different aspects of today's high performance computing environments such as Web Caching,Cache Management in Microprocessors,page Management in Operating Systems,Replication strategies in Distributed Information Systems *** of the highlight role of replacement policies in the systems,there have been lots of work and proposed algorithms to overcome the problem of performance gap between processor and *** of these policies are the enhancement of the Least-Recently-Used(LRU) and Least-Frequently-Used(LFU) *** most of the proposed schemes could solve the defects of the LRU and LFU,but they have lots of overhead and are difficult to *** most profit of LRU and LFU is their simple *** article proposes an adaptive replacement algorithm which has low overhead on system and is easy to *** model is named Priority replacement Algorithm(PRA) which is based on ranking of the pages in the cache according to three *** a miss occurs,a page with the lowest rank point is selected to be substituted by the new desired *** most advantage of this model is it's similarity to three algorithms WRP,LRU and LFU,which means ithas the benefits of them(*** solves the problems of WRP andin cases like loops in which LRU fails,it will switch to LFU).Simulations show that this algorithm performs better than WRP,LRU and *** new approach can be applied as a replacement algorithm in virtual memory systems and web caching.

关键词： -Operating system Memory management page replacement algorithms page fault Hit rate Cache memory

来源：评论

学校读者我要写书评

暂无评论

page replacement Algorithm for NAND Flash Used in Mobile Devices

Page Replacement Algorithm for NAND Flash Used in Mobile Dev...

引用

2016 International Symposium on Mathematics and Computer Science (ISMCS2016)

作者： Hai Jun Zhang Wan Jun Yu School of Computer Science & Information Engineering Shanghai Institute of Technology

In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.

关键词： page replacement algorithms NAND Flash Memory Embedded Systems

来源：评论

学校读者我要写书评

暂无评论

DMIN - AN ALGORITHM FOR COMPUTING THE OPTIMAL DYNAMIC ALLOCATION IN A VIRTUAL MEMORY COMPUTER

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第1期7卷 113-121页

作者： BUDZINSKI, RL DAVIDSON, ES MAYEDA, W STONE, HS Central Research Laboratory Texas Instruments Inc.

An algorithm for computing an optimal dynamic allocation of primary memory that minimizes the space-time cost for a program is presented. The algorithm provides a measurement tool and can be used to generate a bound for heuristic dynamic allocation algorithms. The algorithm is a function of the reactivation time for a task and is based on the following assumptions: 1. knowledge of the entire memory reference trace, 2. demand paging, and 3. sufficient physical memory to contain the memory allocation. The algorithm is based on a second algorithm which minimizes space-time cost by minimizing time alone.

关键词： Virtual Memory Dynamic Memory Allocation Minimum Space Time Product Optical Virtual Memory Allocation page replacement algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Development of a Web-based Interactive Software Tool for Teaching Operating Systems

引用

JOURNAL OF INFORMATION TECHNOLOGY EDUCATION-RESEARCH 2011年第1期10卷 1-17页

作者： Garmpis, Aristogiannis Technol Educ Inst Messolonghi Dept Appl Informat Management & Econ Mesolongion Greece

Operating Systems (OS) is an important and mandatory discipline in many Computer Science, Information Systems and Computer Engineering curricula. Some of its topics require a careful and detailed explanation from the instructor as they often involve theoretical concepts and somewhat complex mechanisms, demanding a certain degree of abstraction from the students if they are to gain a full understanding. In this paper an overview of an interactive e- learning and webbased software tool is provided, which has been designed and developed for undergraduate university students of the Department of Applied Informatics in Management and Economy, Technological Educational Institute of Messolonghi, in Messolonghi, Greece. The aim of this software development was the self learning promotion related to memory management operations and especially the page replacement algorithms operation to be used in everyday OS classrooms. Thus undergraduate students can easily explore the operations of those algorithms through an interaction with the software. More specifically, students can explore each algorithm's mechanism separately and learn from their mistakes as shown automatically by the software in real time. All students' performances are stored in a database. This paper also proposes a study plan to examine the intention of students to use the software in their learning through a survey of a sample of undergraduates. The software does not intend to render obsolete or replace existing pedagogical approaches but instead will complement the existing teaching and learning methods of Operating Systems.

关键词： Operating Systems page replacement algorithms web based distance learning e-Learning Instructional Tool

来源：评论

学校读者我要写书评

暂无评论

USE BIT SCANNING IN replacement DECISIONS

引用

IEEE TRANSACTIONS ON COMPUTERS 1979年第2期28卷 133-141页

作者： EASTON, MC FRANASZEK, PA IBM Thomas J. Watson Research Center

In paged storage systems, page replacement policies generally depend on a use bit for each page frame. The use bit is automatically turned on when the resident page is referenced. Typically, a page is considered eligible for replacement if its use bit has been scanned and found to be off on μ consecutive occasions, where μ is a parameter of the algorithm. This investigation focuses on the dependence of the number of bit-scanning operations on the value of μ and on properties of the string of page references. The number of such operations is a measure of the system overhead incurred while making replacement decisions. In particular, for several algorithms, the number of scans per reference is shown to be approximately proportional to μ However, empirical results from single-program traces show that the value of μ has little effect on the miss ratio. Although the miss ratios for the bit-scanning algorithms are close to those of least recently used (LRU), it is pointed out that increasing the value of μ need not bring the bit-scanning policies closer to LRU management.

关键词： Miss ratio operating system overhead page fault rate page replacement algorithms paged memories paged storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：