Fair Scheduling for Time-dependent Resources
We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by intellectual agents.Each job is associated with release time, deadline, and processing time such that it can be processed if its complete processing period is between its release time and deadline. The machines gain possibly different utilities by processing different jobs, and all jobs assigned to the same machine should be processed without overlap.We consider two widely studied solution concepts, namely, maximin share fairness and envy-freeness.For both criteria, we discuss the extent to which fair allocations exist and present constant approximation algorithms for various settings.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessSchedulingSimilar Papers 제목 키워드 기반
Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learning
Pollux improves scheduling performance in deep learning (DL) clusters by adaptively co-optimizing inter-dependent factors both at the per-job level and at the cluster-wide level. Most existing schedulers expect users to …
Deep LearningFairnessSchedulingMulti-Criteria Client Selection and Scheduling with Fairness Guarantee for Federated Learning Service
Federated Learning (FL) enables multiple clients to train machine learning models collaboratively without sharing the raw training data. However, for a given FL task, how to select a group of appropriate clients fairly b…
FairnessFederated LearningSchedulingMulti-objective Optimization of Clustering-based Scheduling for Multi-workflow On Clouds Considering Fairness
Distributed computing, such as cloud computing, provides promising platforms to execute multiple workflows. Workflow scheduling plays an important role in multi-workflow execution with multi-objective requirements. Altho…
Cloud ComputingClusteringDistributed ComputingFairness+1Load Balancing in Federated Learning
Federated Learning (FL) is a decentralized machine learning framework that enables learning from data distributed across multiple remote devices, enhancing communication efficiency and data privacy. Due to limited commun…
Decision MakingFairnessFederated LearningSchedulingFairness for Workers Who Pull the Arms: An Index Based Policy for Allocation of Restless Bandit Tasks
Motivated by applications such as machine repair, project monitoring, and anti-poaching patrol scheduling, we study intervention planning of stochastic processes under resource constraints. This planning problem has prev…
FairnessMulti-Armed BanditsScheduling