Scheduling Data-Intensive Workloads in Large-Scale Distributed Systems: Trends and Challenges

📅 2025-10-29
📈 Citations: 0
Influential: 0
📄 PDF

career value

215K/year
🤖 AI Summary
Scheduling data-intensive workloads in large-scale distributed systems faces challenges including complexity, heterogeneous parallelism, data locality constraints, and multi-dimensional QoS optimization (e.g., timeliness, fault tolerance, energy efficiency). Method: This paper proposes a novel workload classification scheme grounded in data characteristics and service requirements; systematically surveys and structures mainstream scheduling strategies, exposing critical limitations in dynamic adaptability, fine-grained fault tolerance, and energy–QoS co-optimization; and introduces a unified scheduling framework integrating data-locality awareness, elastic parallel scheduling, QoS-tiered guarantees, and energy-aware resource allocation. Contribution/Results: The study establishes a scalable classification paradigm, delivers a clear technology evolution roadmap, and identifies a prioritized list of open research challenges—thereby advancing foundational understanding and guiding future design of intelligent, holistic schedulers for modern distributed data systems.

Technology Category

Application Category

📝 Abstract
With the explosive growth of big data, workloads tend to get more complex and computationally demanding. Such applications are processed on distributed interconnected resources that are becoming larger in scale and computational capacity. Data-intensive applications may have different degrees of parallelism and must effectively exploit data locality. Furthermore, they may impose several Quality of Service requirements, such as time constraints and resilience against failures, as well as other objectives, like energy efficiency. These features of the workloads, as well as the inherent characteristics of the computing resources required to process them, present major challenges that require the employment of effective scheduling techniques. In this chapter, a classification of data-intensive workloads is proposed and an overview of the most commonly used approaches for their scheduling in large-scale distributed systems is given. We present novel strategies that have been proposed in the literature and shed light on open challenges and future directions.
Problem

Research questions and friction points this paper is trying to address.

Scheduling complex workloads in large-scale distributed systems
Addressing data locality and parallelism for data-intensive applications
Meeting QoS requirements like time constraints and energy efficiency
Innovation

Methods, ideas, or system contributions that make the work stand out.

Classifying data-intensive workloads for scheduling
Surveying large-scale distributed scheduling approaches
Proposing novel strategies for future directions
🔎 Similar Papers
No similar papers found.