Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gurpreet Virdi

dblp:299/5307 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.512021
Predictive Job Scheduling under Uncertain Constraints in Cloud Computing · IJCAI 2021
Cloud and datacenter computing
job scheduling
0.512021
Predictive Job Scheduling under Uncertain Constraints in Cloud Computing · IJCAI 2021
Cloud and datacenter computing › job scheduling
predictive scheduling
0.512021
Predictive Job Scheduling under Uncertain Constraints in Cloud Computing · IJCAI 2021

Methods — techniques the papers use, named apart from their topics

prediction and optimization · 0.5bayesian optimization · 0.5
YearPublicationVenuePosition
2021 Predictive Job Scheduling under Uncertain Constraints in Cloud Computing
abstract
Capacity management has always been a great challenge for cloud platforms due to massive, heterogeneous on-demand instances running at different times. To better plan the capacity for the whole platform, a class of cloud computing instances have been released to collect computing demands beforehand. To use such instances, users are allowed to submit jobs to run for a pre-specified uninterrupted duration in a flexible range of time in the future with a discount compared to the normal on-demand instances. Proactively scheduling those pre-collected job requests considering the capacity status over the platform can greatly help balance the computing workloads along time. In this work, we formulate the scheduling problem for these pre-collected job requests under uncertain available capacity as a Prediction + Optimization problem with uncertainty in constraints, and propose an effective algorithm called Controlling under Uncertain Constraints (CUC), where the predicted capacity guides the optimization of job scheduling and job scheduling results are leveraged to improve the prediction of capacity through Bayesian optimization. The proposed formulation and solution are commonly applicable for proactively scheduling problems in cloud computing. Our extensive experiments on three public, industrial datasets shows that CUC has great potential for supporting high reliability in cloud platforms.
Hang Dong 0004, Boshi Wang, Bo Qiao 0001, Wenqian Xing, Chuan Luo 0002, Si Qin, Qingwei Lin, Dongmei Zhang 0001, Gurpreet Virdi, Thomas Moscibroda
IJCAI9