Intelligent Scheduling Strategies and Resource Optimization for Big Data Processing

dc.contributor.guideKumar, Santosh
dc.coverage.spatial
dc.creator.researcherVerma, Vishnu Prasad
dc.date.accessioned2026-02-16T12:02:29Z
dc.date.available2026-02-16T12:02:29Z
dc.date.awarded2026
dc.date.completed2026
dc.date.registered2022
dc.description.abstractThe exponential growth of data in modern computing systems has driven the need for efficient newlineframeworks for Big data processing. However, challenges remain in optimising for the newlineBig data processing performance, energy consumption, and operational costs, particularly in newlineheterogeneous and cloud environments with dynamic workloads. Big data processing frameworks, newlinesuch as Hadoop and Apache Spark, despite their scalability, often face inefficiencies, newlinesuch as suboptimal resource utilisation, increased latency, and higher energy consumption. This newlinethesis explored the main challenges in big data processing, focusing on enhancing performance, newlineoptimising energy consumption, and reducing operational costs in cloud and heterogeneous computing environments. This thesis introduced adaptive data placement and intelligent scheduling newlinestrategies to address these issues. A key contribution of this thesis is the Adaptive Node-Aware newlineData Placement method, which optimises Hadoop data distribution by dynamically adjusting newlineallocations based on real-time node throughput, thereby minimising delays from straggler nodes newlineand improving data locality. Experiments confirmed the effectiveness of the proposed placement newlinemethod over the Hadoop default placement strategy. newlineBuilding on the data placement optimisations in Hadoop, the subsequent phase of this thesis newlinefocused on enhancing job scheduling efficiency in Apache Spark. We have evaluated various newlineApache Spark scheduling strategies, with the Multilevel Feedback Queue scheduling showing newlinestrong performance for latency-sensitive tasks due to its dynamic priority adjustments.Next, newlinefor cloud environments with dynamic workloads, we initially developed a Deep Reinforcement newlineLearning based scheduler using Proximal Policy Optimisation, which adapts to changing resource newlinedemands while maintaining a high job throughput. Building on this, we introduced a newlinemore advanced approach, based on Distributional Deep Reinforcement Learning, to optimise newlineresource allocation and account for workload prediction uncertainties,
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions
dc.format.extent188
dc.identifier.researcherid
dc.identifier.urihttp://hdl.handle.net/10603/696056
dc.languageEnglish
dc.publisher.institutionComputer Science and Engineering
dc.publisher.placeRaipur
dc.publisher.universityDr. Shyama Prasad Mukherjee International Institute of Information Technology Naya Raipur
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Interdisciplinary Applications
dc.subject.keywordEngineering and Technology
dc.titleIntelligent Scheduling Strategies and Resource Optimization for Big Data Processing
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 13
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
359.33 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
6.54 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_contents.pdf
Size:
889.75 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
1.22 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
11.86 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: