• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Arabian Journal for Science and Engineering >Fair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structure
【24h】

Fair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structure

机译：公平优先级调度（FPS）：一种基于跳过环数据结构的过程调度算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Our process scheduling algorithm was created with the help of circular linked list and skip ring data structures and algorithms. Skip ring data structure consists of circular link lists formed in layers which are linked in a canonical way. Time complexity of search, insertion and deletion equals to O (lgN) in an N-element skip ring data structure. Therefore, skip ring data structure is employed more effectively (O(lgN)) in circumstances where circular linked lists (O(N)) are used. In this paper, the applications of data structures such as red-black tree, binary search tree and skip ring were performed and the obtained results were compared. The obtained results demonstrated that skip ring data structure is superior to red-black tree and binary search tree. Process scheduling is the most important part of operating systems. Linux operating system (version 6.23) uses Completely Fair Scheduler for process scheduling by using red-black tree data structures, Whereas skip ring data structure can be used effectively instead of red-black tree data structure. A new algorithm for process scheduling which was called as Fair Priority Scheduling was proposed in this paper.
机译：我们的流程调度算法是在循环链表和跳过环数据结构和算法的帮助下创建的。跳过环数据结构由分层构成的圆形链接列表组成，这些链接列表以规范的方式链接。在N元素跳过环数据结构中，搜索，插入和删除的时间复杂度等于O（lgN）。因此，在使用循环链表（O（N））的情况下，更有效地采用跳过环数据结构（O（lgN））。本文对红黑树，二叉树，跳环等数据结构进行了应用，并对得到的结果进行了比较。获得的结果表明，跳环数据结构优于红黑树和二叉搜索树。进程调度是操作系统中最重要的部分。 Linux操作系统（版本6.23）通过使用红黑树数据结构使用完全公平调度程序进行进程调度，而跳环数据结构可以代替红黑树数据结构有效地使用。提出了一种新的过程调度算法，称为公平优先级调度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号