首页    期刊浏览 2025年12月03日 星期三
登录注册

文章基本信息

  • 标题:A Variant of FPZL Algorithm
  • 本地全文:下载
  • 作者:Komal S. Bhalotiya ; D. V. Padole ; Radhakrishna Naik
  • 期刊名称:International Journal of Computer Science Issues
  • 印刷版ISSN:1694-0784
  • 电子版ISSN:1694-0814
  • 出版年度:2012
  • 卷号:9
  • 期号:4
  • 出版社:IJCSI Press
  • 摘要:Fixed priority until Zero Laxity (FPZL) algorithm is the minimally dynamic scheduling algorithm. In FPZL, fixed priorities are assigned to the jobs and are scheduled accordingly until the state of zero laxity is reached and it does not follow any priority order. FPZL concentrates on scheduling more jobs as far as possible. The algorithm which is proposed in this paper is the variant of FPZL which employs the priority order. Instead of giving up processing of some tasks completely, this algorithm completes some portion of the tasks and at the same time if any zero laxity task arrives it takes that task also into consideration and schedules accordingly. In this way, this algorithm tries to process more jobs as compared to the FPZL algorithm and increases the CPU Utilization.
  • 关键词:Real Time Operating System; Multi;Processor; Scheduling Algorithm.
国家哲学社会科学文献中心版权所有