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

• Achim, S. (2005). On Performance Evaluation of Slackness option for the Self-turning dynP scheduler. Central Institute for Applied Mathematics. Julich, Germany: RSJ.
• Baptiste, P. (1994). Constraint- Based Scheduling : Two Extensions. University of Strathclyde, Department of Manufacturing and Engineering . Scotland:
• Boleslaw, S. K. (1990). Mutual Exclusion Revisited. Fifth Jerusalem Conference in Information Technology (pp. 110-117). Israel, Jerusalem: IEEE Computer Society Press.
• Cheng, T. , & Kahlbacher, H. (2006). A proof for the Longest Job First Policy in one machine Scheduling. CA: Naval Research Logistics.
• Dalibor, K. , Rudova, H. , Raneiri, B. , Marco, P. , & Capannini, G. (2005). Comparison of Multi-Criteria Scheduling. Springer. ISBN 978-0-387-09456-4
• Ernst, B. W. , Schroeder, B. , & Urvoykella, G. (2007). Scheduling in Practice. Journal of Parallel Processing , 34 (4)
• 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.
• Gerald, S. , Garima, K. , & P, S. (2004). Job Fairness in Non-preepmtive Job Scheduling. International Journal on Parallel Processing , 186-194.
• Herve, M. (2007). On Scheduling fees to prevent merging, splitting and transfering Jobs. Journal of Mathematics of Operational Research , 266-283
• 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.
• 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.
• 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.
• 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.
• 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.