计算机科学
调度(生产过程)
动态优先级调度
公平份额计划
周转时间
单调速率调度
响应时间
过程(计算)
两级调度
最早截止时间优先安排
地铁列车时刻表
固定优先级先发制人调度
执行时间
分布式计算
处理器调度
算法
数学优化
操作系统
数学
作者
Munam Ali Shah,Muhammad Bilal Shahid,Sijing Zhang,S. T. Mustafa,Mushahid Hussain
标识
DOI:10.1109/iconac.2015.7313978
摘要
In a multi-tasking environment, the purpose of a scheduling algorithm is to give CPU time to each process in such a way that maximum throughput could be achieved. One way is to manually set the priority of the processes but conventional operating systems put equivalent scheduling policies on each set of process and do not observe organizational preferences. It is believed that every organization performs same set of tasks most of the time. Tasks performed by an organization must be given priority according to their level of activeness rather than some hard rules defined at a design level. In this paper, we propose a novel algorithm that schedule processes according to the organization's need. Our proposed Organization Based Intelligent Process Scheduling Algorithm (OIPSA) intelligently learns the processes that are frequently used within an organization's operating system and give priority to the users' most wanted processes. The results show that OIPSA decreases response time, waiting time and turnaround time for the organization preferred processes and enhance the overall efficiency of the system when compared with conventional scheduling algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI