论文标题
基于用户的多用户多处理器在线计划的目标的新公平模型
A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling
论文作者
论文摘要
多用户系统在多处理器在线调度中的资源由竞争用户共享，公平性是资源分配的主要绩效标准。公平确保用户之间的资源共享平等。据我们所知，基于用户目标的公平性既没有经过全面研究，也没有正式的公平模型在文献中得到很好的定义。这促使我们探索并定义了一个新模型，以确保基于用户目标优化的定量性能度量来确保算法公平。在本文中，我们为多用户多处理器在线调度问题（MUMPOSP）提出了一个新模型。我们通过在我们建议的公平模型中为单个用户优化单个用户，从而根据用户的目标介绍并正式定义定量公平措施。我们还定义了被剥夺用户的不公平性和算法的绝对公平性。我们获得了相同长度作业的M相同机器的绝对公平性的下限结果。我们表明，我们提出的公平模型可以通过考虑各种最佳标准（例如流动时间和完成时间总和）来作为算法公平性的框架。
Resources of a multi-user system in multi-processor online scheduling are shared by competing users in which fairness is a major performance criterion for resource allocation. Fairness ensures equality in resource sharing among the users. According to our knowledge, fairness based on the user's objective has neither been comprehensively studied nor a formal fairness model has been well defined in the literature. This motivates us to explore and define a new model to ensure algorithmic fairness with quantitative performance measures based on optimization of the user's objective. In this paper, we propose a new model for fairness in Multi-user Multi-processor Online Scheduling Problem(MUMPOSP). We introduce and formally define quantitative fairness measures based on user's objective by optimizing makespan for individual user in our proposed fairness model. We also define the unfairness of deprived users and absolute fairness of an algorithm. We obtain lower bound results for the absolute fairness for m identical machines with equal length jobs. We show that our proposed fairness model can serve as a framework for measuring algorithmic fairness by considering various optimality criteria such as flow time and sum of completion times.
