UJPS: Urgent Job Priority Scheduling in Hadoop YARN
The rapidly increasing demand for big data processing has necessitated the development of advanced scheduling policies that can effectively accommodate urgent job requirements. This paper presents the Urgent Job Priority Scheduler (UJPS) for Hadoop YARN, aimed at handling urgent jobs efficiently in big data processing. UJPS uses an Aging model to cut waiting times and prevent job starvation, a Dynamic Priority model for urgency-based prioritization, and a Container Load model to boost data locality and efficiency. Tested on Hadoop with benchmark tasks, UJPS outperforms five advanced schedulers, lowering waiting times by up to 81.42% and reducing job runtime by 32.90%. It prioritizes urgent tasks while ensuring overall efficiency, offering benefits to organizations using Hadoop YARN for timely job execution.
Authors
- Weike Nie (ORCID: https://orcid.org/0000-0003-2092-3083)
- Chase Q. Wu
- Aiqin Hou (ORCID: https://orcid.org/0000-0003-0821-417X)
- Chang Zhang (ORCID: https://orcid.org/0000-0001-8813-3198)
- Nana Du (ORCID: https://orcid.org/0009-0003-5713-2784)
Institutions
- New Jersey Institute of Technology (US)
- Northwest University (CN)
- Southeast University (CN)
Publication Details
- Published
- 2024-12-13
- DOI
- https://doi.org/10.1109/hpcc64274.2024.00043
- Primary Topic
- IoT and Edge/Fog Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00