Comparative analysis of fcfs and sjf for multimedia process scheduling

Abstract

Multimedia data processing has been gaining popularity due to its increasing demand in today’s scenario. In this paper, we discuss the various scheduling strategies that have been employed for multimedia processes. We study the performance of traditional scheduling algorithms such as First Come First Servce (FCFS) and Shortest Job First (SJF) for multimedia tasks and analyse the variation in their performance under different scenarios such as different sets of data and by varying the number of processes. Experimental results prove that the scheduling schemes vary in their performances under different situations.