DRESS: Dynamic RESource-reservation Scheme for Congested Data-intensive Computing Platforms
Ying Mao, Victoria Green, Jiayin Wang, Haoyi Xiong, Zhishan Guo

TL;DR
This paper introduces DRESS, a dynamic resource reservation scheduling scheme for data-intensive platforms that improves job completion times by adaptively reserving resources based on job demands and system monitoring.
Contribution
DRESS is a novel scheduling strategy that classifies jobs, reserves resources accordingly, and dynamically adjusts reservations to optimize performance in resource-constrained environments.
Findings
Reduces completion time for targeted job categories by up to 76.1%.
Maintains stable overall system performance.
Adapts resource reservations based on job demand patterns.
Abstract
In the past few years, we have envisioned an increasing number of businesses start driving by big data analytics, such as Amazon recommendations and Google Advertisements. At the back-end side, the businesses are powered by big data processing platforms to quickly extract information and make decisions. Running on top of a computing cluster, those platforms utilize scheduling algorithms to allocate resources. An efficient scheduler is crucial to the system performance due to limited resources, e.g. CPU and Memory, and a large number of user demands. However, besides requests from clients and current status of the system, it has limited knowledge about execution length of the running jobs, and incoming jobs' resource demands, which make assigning resources a challenging task. If most of the resources are occupied by a long-running job, other jobs will have to keep waiting until it…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
