header
Image from OpenLibrary

Least - job first scheduling technique for parallel jobs / Salma Mohamed Ali Ataallah ; Supervised Nevin M. Darwish , Salwa M. Nassar , Elsayed E. Hemayed

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Salma Mohamed Ali Ataallah , 2011Description: 68 P. : charts , facsimiles ; 30cmOther title:
  • تقنية ادنى مهمة اولا لجدولة المهام المتوازية [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Computer Engineering Summary: In this work we introduce a scheduling program that is applied on BG/L ; this scheduling program presents two scheduling policies - shortest - job first (SJF) and least - job first (LJF) . We investigate the ability of these scheduling policies to increase BG/L utilization and decrease job waiting time . We perform some of experiments to measure performance criteria LJF achieves better utilization than SJF in simulation experiment but in real experiments it accomplishes the best utilization and average waiting time
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.06.M.Sc.2011.Sa.L (Browse shelf(Opens below)) Not for loan 01010110056650000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.06.M.Sc.2011.Sa.L (Browse shelf(Opens below)) 56650.CD Not for loan 01020110056650000

Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Computer Engineering

In this work we introduce a scheduling program that is applied on BG/L ; this scheduling program presents two scheduling policies - shortest - job first (SJF) and least - job first (LJF) . We investigate the ability of these scheduling policies to increase BG/L utilization and decrease job waiting time . We perform some of experiments to measure performance criteria LJF achieves better utilization than SJF in simulation experiment but in real experiments it accomplishes the best utilization and average waiting time

Issued also as CD

There are no comments on this title.

to post a comment.