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

Dalibor Klusácek

dblp:90/5373 · DBLP profile ↗
← Back
19ranked-venue papers
13as first author
4since 2021 · last 2025
0000-0001-6434-4433ORCID · verified

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

Systems, architecture and hardware · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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 · 75% Performance modeling and evaluation · 25%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.212015
Planning and Optimization in TORQUE Resource Manager · HPDC 2015
Cloud and datacenter computing
job scheduling
0.212015
Planning and Optimization in TORQUE Resource Manager · HPDC 2015
Cloud and datacenter computing › resource management
resource management and scheduling
0.212015
Planning and Optimization in TORQUE Resource Manager · HPDC 2015
Performance modeling and evaluation
scheduling optimization
0.212015
Planning and Optimization in TORQUE Resource Manager · HPDC 2015

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

planning · 0.2local search metaheuristic · 0.2
YearPublicationVenuePosition
2025 Kubernetes Scheduling with Checkpoint/Restore: Challenges and Open Problems
Viktória Spisaková, Radostin Stoyanov, Lukás Hejtmánek, Dalibor Klusácek, Adrian Reber, Rodrigo Bruno
JSSPP4
2024 Real-Life HPC Workload Trace Featuring Refined Job Runtime Estimates
Dalibor Klusácek, Václav Chlumský
JSSPP1
2022 Improving Accuracy of Walltime Estimates in PBS Professional Using Soft Walltimes
Václav Chlumský, Dalibor Klusácek
JSSPP2
2022 Using Kubernetes in Academic Environment: Problems and Approaches
Viktória Spisaková, Dalibor Klusácek, Lukás Hejtmánek
JSSPP2
2020 Optimizing Biomedical Ultrasound Workflow Scheduling Using Cluster Simulations
Marta Jaros, Dalibor Klusácek, Jirí Jaros
JSSPP2
2020 Walltime Prediction and Its Impact on Job Scheduling Performance and Predictability
Dalibor Klusácek, Mehmet Soysal
JSSPP1
2019 Improving Fairness in a Large Scale HTC System Through Workload Analysis and Simulation
Frédéric Azevedo, Dalibor Klusácek, Frédéric Suter
Euro-Par2
2018 Evaluating the Impact of Soft Walltimes on Job Scheduling Performance
Dalibor Klusácek, Václav Chlumský
JSSPP1
2017 Analysis of Mixed Workloads from Shared Cloud Infrastructure
Dalibor Klusácek, Boris Parák
JSSPP1
2016 Planning and Metaheuristic Optimization in Production Job Scheduler
Dalibor Klusácek, Václav Chlumský
JSSPP1
2015 Planning and Optimization in TORQUE Resource Manager
abstract
We presents a unique advanced job scheduler for the widely used TORQUE Resource Manager. Unlike common schedulers that are using queuing approach and heuristics, our solution uses planning (job schedule construction) and schedule optimization by a local search-inspired metaheuristic, achieving better predictability, performance and fairness with respect to common queue-based approaches. The suitability and good performance of our solution is demonstrated both by "synthetic" experiments as well as by our real-life performance results that are coming from the deployment of our scheduler in the production infrastructure of the Czech Centre for Education, Reasearch and Innovation in ICT (CERIT Scientific Cloud).
Dalibor Klusácek, Václav Chlumský, Hana Rudová
HPDC1
2015 Real-Life Experience with Major Reconfiguration of Job Scheduling System
Dalibor Klusácek, Simon Tóth, Gabriela Podolníková
JSSPP1
2014 On Interactions among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations
Dalibor Klusácek, Simon Tóth
Euro-Par1
2014 Multi-resource Aware Fairsharing for Heterogeneous Systems
Dalibor Klusácek, Hana Rudová
JSSPP1
2014 User-Aware Metrics for Measuring Quality of Parallel Job Schedules
Simon Tóth, Dalibor Klusácek
JSSPP2
2013 Multi Resource Fairness: Problems and Challenges
Dalibor Klusácek, Hana Rudová, Michal Jaros
JSSPP1
2012 Performance and Fairness for Users in Parallel Job Scheduling
Dalibor Klusácek, Hana Rudová
JSSPP1
2011 Efficient grid scheduling through the incremental schedule-based approach
abstract
Although Grid users demand good performance for their jobs, this requirement is often not satisfied by the widely used queue‐based scheduling approaches. This article concentrates on the application of schedule‐based methods that improve on both the service delivered to the user and the traditional objective of machine usage. Importantly, the interaction between the incremental application of these methods and the dynamic character of the problem allows reasonable runtimes to be achieved. Two new schedule‐based methods that are designed to schedule dynamically arriving jobs on machines in a computational Grid are formally described in the article. The Earliest Gap — Earlier Deadline First (EG‐EDF) policy fills the earliest gap in the known schedule with newly arriving jobs, incrementally building a new schedule. If the gap is not suitable for an incoming job, the EDF policy is used to modify the existing schedule. A Tabu search algorithm is used to further optimize the schedule by moving selected jobs into the earliest suitable gaps. The proposed incremental schedule‐based methods are compared with some of the most common queue‐based scheduling algorithms such as FCFS (First Come First Served), EASY backfilling (Extensible Argonne Scheduler sYstem), Flexible backfilling as well as with the nonincremental version of the EG‐EDF schedule‐based policy.
Dalibor Klusácek, Hana Rudová
Comput. Intell.1
2010 The Importance of Complete Data Sets for Job Scheduling Simulations
Dalibor Klusácek, Hana Rudová
JSSPP1