Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2015 by IJCTT Journal
Volume-25 Number-1
Year of Publication : 2015
Authors : Ms. Neha Jain, Mrs. Varsha Zokakar
  10.14445/22312803/IJCTT-V25P107

MLA

Ms. Neha Jain, Mrs. Varsha Zokakar "Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy". International Journal of Computer Trends and Technology (IJCTT) V25(1):41-44, July 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks. The process deadline, processor capacity, start time, processing time, and release time of task are not known in prior, which makes the scheduling process complicated. These parameters are well known to as for optimal scheduling algorithm in real-time system. With the increased processing capacity, there is requirement to assign the tasks to processors in defined manner for their effective utilization. The nature of task may require the higher utilization or lower utilization of processors, and sequence of assignment is also become important to avoid higher tardiness. In this paper, an EDF-Fm based algorithm has been simulated for the multiprocessor scheduling. The tardiness in the processes is the key parameter has been considered for the effective scheduling. Various assignment techniques are used for tardiness reduction such as Lowest Execution First (LEF), Lowest Utilization First (LUF) etc. These all are the techniques, based on the assignment priority of jobs. Here we proposed a new concept High-Low High-Utilization-first (HLHUF) for tardiness reduction. From various experiments based on utilization ‘ui’ and result analysis, it is concluding that the approach HLHUF gives minimum tardiness.

References
[1] Devendra Thakor, Apurva Shah, “D_EDF: An efficient Scheduling Algorithm for Real-Time Multiprocessor System”. IEEE 2011.
[2] J. Liu, Real-Time Systems, Pearson Education, 2000.
[3] Joseph Y. Leung, editor, Handbook on Scheduling Algorithms, Methods, and Models.
[4] M.Kaladevi and Dr.S.Sathiyabama,” A Comparative Study of Scheduling Algorithms for Real Time Task”, International Journal of Advances in Science and Technology, Vol. 1, No. 4, 2010.
[5] T. P. Baker. Multiprocessor EDF and deadline monotonic schedulability analysis. In Proc. of the 24th IEEE Real-time Systems Symposium, pages 120-129, Dec. 2003.
[6] Jeremy P. Erickson and James H. Anderson” Reducing Tardiness Under Global Scheduling by Splitting Jobs”. Work supported by NSF grants CNS 1016954, CNS 1115284, and CNS 1239135; ARO grant W911NF-09-1- 0535; and AFRL grant FA8750-11-1-0033.
[7] J. Anderson, V. Bud, and U. Devi. “An EDF based scheduling algorithm for multiprocessor soft real-time systems (extended version)”. Available at http://www.cs.unc.edu/anderson/ papers.html, Dec. 2004.
[8] Apurva Shah, Ketan Kotecha,” Adaptive Scheduling Algorithm for Real-Time Multiprocessor Systems”. IEEE International Advance Computing Conference (IACC 2009)
[9] Uma Maheswari C. Devi and James H. Anderson,” Tardiness Bounds under Global EDF Scheduling on a Multiprocessor”, work was presented in preliminary form at the 26th IEEE Real-Time Systems Symposium
[10] Jeremy P. Erickson, James H. Anderson, and Bryan C. Ward” Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-like Scheduling”. Work supported by NSF grants CNS 1016954, CNS 1115284, and CNS 1239135; ARO grant W911NF-09-1-0535; and AFRL grant FA875011-1-0033
[11] C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard-real- time environment. Journal of the Association for Computing Machinery, 20(1):46–61, 1973. 14, 17, 18.

Keywords
Multiprocessor System, EDF-fm, HLHUF, LUF, LEF etc.