矢量调度的一种简单逼近算法及其在随机最小范数负载均衡中的应用

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2021-11-14 DOI:10.1137/1.9781611977066.18

Sharat Ibrahimpur, Chaitanya Swamy

{"title":"矢量调度的一种简单逼近算法及其在随机最小范数负载均衡中的应用","authors":"Sharat Ibrahimpur, Chaitanya Swamy","doi":"10.1137/1.9781611977066.18","DOIUrl":null,"url":null,"abstract":"We consider the Vector Scheduling problem on identical machines: we have m machines, and a set J of n jobs, where each job j has a processing-time vector pj ∈ R d ≥0. The goal is to find an assignment σ : J → [m] of jobs to machines so as to minimize the makespanmaxi∈[m] maxr∈[d] ( ∑","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"17 1","pages":"247-256"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing\",\"authors\":\"Sharat Ibrahimpur, Chaitanya Swamy\",\"doi\":\"10.1137/1.9781611977066.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the Vector Scheduling problem on identical machines: we have m machines, and a set J of n jobs, where each job j has a processing-time vector pj ∈ R d ≥0. The goal is to find an assignment σ : J → [m] of jobs to machines so as to minimize the makespanmaxi∈[m] maxr∈[d] ( ∑\",\"PeriodicalId\":93491,\"journal\":{\"name\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"volume\":\"17 1\",\"pages\":\"247-256\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611977066.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611977066.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们考虑相同机器上的向量调度问题:我们有m台机器和一个包含n个作业的集合J，其中每个作业J有一个处理时间向量pj∈rd≥0。目标是找到一个分配给机器的作业σ: J→[m]，以最小化makespanmaxi∈[m] maxr∈[d](∑

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing

We consider the Vector Scheduling problem on identical machines: we have m machines, and a set J of n jobs, where each job j has a processing-time vector pj ∈ R d ≥0. The goal is to find an assignment σ : J → [m] of jobs to machines so as to minimize the makespanmaxi∈[m] maxr∈[d] ( ∑

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)

自引率

0.00%

发文量