{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:18:17Z","timestamp":1781108297707,"version":"3.54.1"},"reference-count":15,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4,1]]},"abstract":"<p>Multilevel feedback queue scheduling (MLFQ) algorithm is based on the concept of several queues in which a process moves. In earlier scenarios there are three queues defined for scheduling. The two higher level queues are running on Round Robin scheduling and last level queue is running on FCFS (First Come First Serve). A fix time quantum is defined for RR scheduling and scheduling of process depends upon the arrival time in ready queue. Previously a lot of work has been done in MLFQ. In our propose algorithm Smart Job First Multilevel feedback queue (SJFMLFQ) with smart time quantum (STQ), the processes are arranged in ascending order of their CPU execution time and calculate a Smart Priority Factor SPF on which processes are scheduled in queue. The process which has lowest SPF value will schedule first and the process which has highest SF value will schedule last in queue. Then a smart time quantum (STQ) is calculated for each queue. As a result, we found decreasing in turnaround time, average waiting time and increasing throughput as compared to the previous approaches and hence increase in the overall performance.<\/p>","DOI":"10.4018\/ijmdem.2017040106","type":"journal-article","created":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T18:56:20Z","timestamp":1500663380000},"page":"50-64","source":"Crossref","is-referenced-by-count":1,"title":["Design and Performance Evaluation of Smart Job First Multilevel Feedback Queue (SJFMLFQ) Scheduling Algorithm with Dynamic Smart Time Quantum"],"prefix":"10.4018","volume":"8","author":[{"given":"Amit Kumar","family":"Gupta","sequence":"first","affiliation":[{"name":"Suresh Gyan Vihar University, Jaipur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narendra Singh","family":"Yadav","sequence":"additional","affiliation":[{"name":"JECRC University, Jaipur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dinesh","family":"Goyal","sequence":"additional","affiliation":[{"name":"Suresh Gyan Vihar University, Jaipur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJMDEM.2017040106-0","doi-asserted-by":"publisher","DOI":"10.3923\/itj.2007.288.293"},{"key":"IJMDEM.2017040106-1","doi-asserted-by":"crossref","unstructured":"Arora, H., Arora, D., & Jain, P. (2013). An Improved CPU Scheduling Algorithm. International Journal of Applied Information Systems, 6(6).","DOI":"10.5120\/ijais13-451057"},{"key":"IJMDEM.2017040106-2","unstructured":"Behera, H.S. (2011). Design and Performance Evaluation of Multi Cyclic Round Robin (MCCR) Algorithm using Dynamic Time Quantum. Journal of Global Research in Computer Science, 2(2), 48-53."},{"key":"IJMDEM.2017040106-3","doi-asserted-by":"crossref","unstructured":"Behera, H. S. (2011). Experimental Analysis of A New Fair Share Weighted Time Slice (FSWTS) Scheduling Algorithm for Real Time Systems. Journal of Global Research in Computer Science, 2(2), 54-60.","DOI":"10.5120\/2037-2648"},{"key":"IJMDEM.2017040106-4","doi-asserted-by":"publisher","DOI":"10.5120\/2037-2648"},{"key":"IJMDEM.2017040106-5","unstructured":"Behera, H.S., Naik, R.K., & Parida, S. (2012). A new Hybridized Multilevel Feedback Queue Scheduling with Intelligent Time Slice and its Performance Analysis. International Journal of engineering research and technology."},{"key":"IJMDEM.2017040106-6","unstructured":"Behera, H.S., Naik, R.K., & Parida, S. (2012). Improved Multilevel Feedback Queue Scheduling Using Dynamic Time Quantum and Its Performance Analysis. International Journal of Computer Science and Information Technologies, 3."},{"key":"IJMDEM.2017040106-7","doi-asserted-by":"crossref","unstructured":"Bhunia, A. (2011). Enhancing the Performance of Feedback Scheduling. International Journal of Computer Applications, 18(4).","DOI":"10.5120\/2274-2939"},{"key":"IJMDEM.2017040106-8","author":"D. M.Dhamdhere","year":"2006","journal-title":"Operating Systems A Concept Based Approach"},{"key":"IJMDEM.2017040106-9","doi-asserted-by":"crossref","unstructured":"Mohanty, R., Behera, H. S., Patwari, K., Dash, M., & Prasanna, M. L. (2011). Priority Based dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time System. International Journal of Advanced Computer Science and Application, 2(2).","DOI":"10.14569\/IJACSA.2011.020209"},{"key":"IJMDEM.2017040106-10","unstructured":"Rakesh Mohanty, H. S. Behera, Khusbu Patwari, Monisha Dash (2010). Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm. Proceedings of International Symposium on Computer Engineering & Technology (ISCET)(Vol 17)."},{"key":"IJMDEM.2017040106-11","unstructured":"Sattar, I., Shahid, M., & Yasir, N. (2014). Multi-Level Queue with Priority and Time Sharing for Real Time Scheduling. International Journal of Multidisciplinary Sciences and Engineering, 5(8)."},{"key":"IJMDEM.2017040106-12","unstructured":"Silberschatz, A., Galvin, P.B., & Gagne, G. (2003). Operating systems concepts (5th ed.). Wiley."},{"key":"IJMDEM.2017040106-13","unstructured":"Yadav, R.K., & Upadhayay, A. (2012). A Fresh Loom for Multilevel Feedback Queue Scheduling Algorithm. International Journal of Advances in Engineering Sciences, 2(3)."},{"key":"IJMDEM.2017040106-14","unstructured":"Yadav, R.K., Mishra, A.K., Prakash, N., & Sharma, H. (2010). An Improved Round Robin Scheduling Algorithm.International Journal on Computer Science and Engineering, 2(4), 1064\u20131066."}],"container-title":["International Journal of Multimedia Data Engineering and Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=178934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T19:56:54Z","timestamp":1651867014000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJMDEM.2017040106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijmdem.2017040106","relation":{},"ISSN":["1947-8534","1947-8542"],"issn-type":[{"value":"1947-8534","type":"print"},{"value":"1947-8542","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}