CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT

by Ibrahim Abdullahi, S. B Junaidu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 75 - Number 14
Year of Publication: 2013
Authors: Ibrahim Abdullahi, S. B Junaidu
10.5120/13178-0763

Ibrahim Abdullahi, S. B Junaidu . Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT. International Journal of Computer Applications. 75, 14 ( August 2013), 9-14. DOI=10.5120/13178-0763

@article{ 10.5120/13178-0763,
author = { Ibrahim Abdullahi, S. B Junaidu },
title = { Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT },
journal = { International Journal of Computer Applications },
issue_date = { August 2013 },
volume = { 75 },
number = { 14 },
month = { August },
year = { 2013 },
issn = { 0975-8887 },
pages = { 9-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume75/number14/13178-0763/ },
doi = { 10.5120/13178-0763 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:44:15.191224+05:30
%A Ibrahim Abdullahi
%A S. B Junaidu
%T Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT
%J International Journal of Computer Applications
%@ 0975-8887
%V 75
%N 14
%P 9-14
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Process as an individualistic entity program and a program in execution requires good scheduling algorithm for its throughput and latency measures. This work made a study of existing process scheduling algorithms and carefully examines the Longest Job First (LJF) algorithm as a key to minimizing the overall Average Waiting Time (AWT) and the Average Turn-Around Time (ATAT) in multiprocessing systems to find ways of making the algorithm popularly usable in the field of computer application and life endeavors. A sample of generated process attributes of burst-time along each process were used to simulate scenario, by a new technique we referred to as Combinational Burst-Time (CBT) to curtail the major problems of starvation of the shorter jobs in queue. CBT as a framework minimized the large numbers of context switching (CS), starvation and reduced convoy problems.

References
  1. Achim, S. (2005). On Performance Evaluation of Slackness option for the Self-turning dynP scheduler. Central Institute for Applied Mathematics. Julich, Germany: RSJ.
  2. Baptiste, P. (1994). Constraint- Based Scheduling : Two Extensions. University of Strathclyde, Department of Manufacturing and Engineering . Scotland:
  3. Boleslaw, S. K. (1990). Mutual Exclusion Revisited. Fifth Jerusalem Conference in Information Technology (pp. 110-117). Israel, Jerusalem: IEEE Computer Society Press.
  4. Cheng, T. , & Kahlbacher, H. (2006). A proof for the Longest Job First Policy in one machine Scheduling. CA: Naval Research Logistics.
  5. Dalibor, K. , Rudova, H. , Raneiri, B. , Marco, P. , & Capannini, G. (2005). Comparison of Multi-Criteria Scheduling. Springer. ISBN 978-0-387-09456-4
  6. Ernst, B. W. , Schroeder, B. , & Urvoykella, G. (2007). Scheduling in Practice. Journal of Parallel Processing , 34 (4)
  7. Galvin, P. B. , Abrahm, S. , & Gagne, G. (2004). Operating System Concepts (7th Edition ed. ). (B. Zobrist, K. Santor, & M. Lesure, Eds. ) NJ, USA: John Wiley and Sons Inc.
  8. Gerald, S. , Garima, K. , & P, S. (2004). Job Fairness in Non-preepmtive Job Scheduling. International Journal on Parallel Processing , 186-194.
  9. Herve, M. (2007). On Scheduling fees to prevent merging, splitting and transfering Jobs. Journal of Mathematics of Operational Research , 266-283
  10. Idris, R. A. , & Okopa, M. (2011). Modeling and Evaluation of SWAP scheduling Policy under varying Job size distribution. Network Conference (pp. 115-120). Uganda: IARIA.
  11. Javier, C. , Fatos, X. , & Ajith, A. (2007). Genetic Algorithm Based Schedulers for grid Computing Systems. International Journal of Innovative Computing, Information and Control , 3 (6), 25-32.
  12. Ludmila, C. , Lau, R. , Burose, H. , Subramanian, V. , Bernhard, K. , & Kuttiraja, V. (2011). Run-Time Performance Optimization and Job Management in Data Protection Solution. IFIP/IEEE Symposium in Integrated Management (pp. 20-27). Dublin: IEEE.
  13. Rakesh, M. , Das, M. , Lakshmi, M. , & Sudhashree, P. (2011). Design and Performance Evaluation of a New Proposed Fittest Job First Dynamic Round Robin (FJFDRR) Scheduling Algorithm. International Journal of Computer Information System , 2 (2), 23-93.
  14. Raksha, S. , Vishnu, K. , Mishra, M. K. , & Bhuyan, P. (2010). A Survey of Job Scheduling and Resource Management in Grid Computing. World Academy of Science Engineering and Technology , 461-466.
Index Terms

Computer Science
Information Sciences

Keywords

Operating system Process Scheduling Average Waiting Time Longest Job First Average Turnaround Time Combinational Burst Time CBT Starvation

Powered by PhDFocusTM