Paper Info
Title
R-FirstFit: A Reservation Based First Fit Priority Job Scheduling Strategy and Its Application for Rendering
Abstract
When high performance computing platforms are widely used for rendering application, scheduling of rendering jobs becomes crucial due to the job starvation and resource fragmentations problems which consist in the existing scheduling strategies. Meanwhile, these strategies are rarely balance fairness and performance. Aiming at these issues, we propose a reservation based First Fit priority (R-First Fit) job scheduling strategy for cluster rendering system. In this strategy, the reservation based First Fit method is used to maximize the resources utilization for rendering system when the jobs are blocked. The proposed R-First Fit strategy is compared with other scheduling strategies (FCFS and First Fit) under different evaluation metrics. The experiment results demonstrate that the proposed strategy outperforms in many cases than the existing ones while guaranteeing the fairness of scheduling jobs.
Year
DOI
Venue
2014
10.1109/CSE.2014.213
C3S2E
Keywords
Field
DocType
cluster rendering system,high performance computing platforms,cluster scheduling strategy,processor scheduling,parallel processing,r-firstfit,resource utilization,rendering application,render farm,resource fragmentation problem,resource allocation,rendering (computer graphics),resource reservation,reservation based firstfit priority job scheduling strategy,rendering,job starvation problem,resource management,measurement,scheduling
Lottery scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Operations research,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
16
Authors
5
Name
Order
Citations
PageRank
Qian Li113.42
Weiguo Wu214834.44
Xiaxin Zhou300.68
Zeyu Sun401.01
Jianhang Huang5136.37