Abstract
In order to obtain high cost-effective computing capability and improve resource utilization efficiency, MapReduce clusters are usually shared by multiple jobs, so the scheduling of multiple MapReduce jobs will have an important impact on cluster performance. Aiming at optimizing the average job computing time, this paper studies the scheduling schemes of multiple jobs arriving in Poisson process, and proposes an easy-to-implement median scheduling algorithm. Through simulation experiments, it can be seen that the proposed algorithm can effectively reduce the average computing time of MapReduce jobs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
