{"title":"带拒绝的单机在线和半在线矢量调度","authors":"Qianna Cui, Haiwei Pan","doi":"10.1109/ICDMW.2018.00141","DOIUrl":null,"url":null,"abstract":"In this paper, we design an online algorithm for vector scheduling on a single machine with rejection and its competitive ratio is d, where d is the dimensions of vector. In addition, we consider two versions of semi-online vector scheduling on a single machine with rejection. In the first version, semi-online with rearrangement allows at most one job to be reassigned after scheduling all jobs, then we show a semi-online algorithm with competitive ratio 1/2 d+2 for d > 3. The second version is semi-online with rejection buffer whose length= 1, which can hold one job. When d > 3, we also give an algorithm with competitive ratio 1/2 d + 2.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online and Semi-Online Vector Scheduling on A Single Machine with Rejection\",\"authors\":\"Qianna Cui, Haiwei Pan\",\"doi\":\"10.1109/ICDMW.2018.00141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we design an online algorithm for vector scheduling on a single machine with rejection and its competitive ratio is d, where d is the dimensions of vector. In addition, we consider two versions of semi-online vector scheduling on a single machine with rejection. In the first version, semi-online with rearrangement allows at most one job to be reassigned after scheduling all jobs, then we show a semi-online algorithm with competitive ratio 1/2 d+2 for d > 3. The second version is semi-online with rejection buffer whose length= 1, which can hold one job. When d > 3, we also give an algorithm with competitive ratio 1/2 d + 2.\",\"PeriodicalId\":259600,\"journal\":{\"name\":\"2018 IEEE International Conference on Data Mining Workshops (ICDMW)\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Data Mining Workshops (ICDMW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMW.2018.00141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2018.00141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文设计了一种单机上的在线矢量调度算法，其竞争比为d，其中d为矢量的维数。此外，我们考虑了两个版本的半在线矢量调度在一台机器上的拒绝。在第一个版本中，半在线重排算法在调度完所有作业后，最多允许重新分配一个作业，然后我们给出了一个竞争比为1/2 d+2的半在线算法。第二个版本是半在线的，拒绝缓冲区长度为1，可以容纳一个作业。当d > 3时，我们也给出了一个竞争比为1/2 d + 2的算法。
Online and Semi-Online Vector Scheduling on A Single Machine with Rejection
In this paper, we design an online algorithm for vector scheduling on a single machine with rejection and its competitive ratio is d, where d is the dimensions of vector. In addition, we consider two versions of semi-online vector scheduling on a single machine with rejection. In the first version, semi-online with rearrangement allows at most one job to be reassigned after scheduling all jobs, then we show a semi-online algorithm with competitive ratio 1/2 d+2 for d > 3. The second version is semi-online with rejection buffer whose length= 1, which can hold one job. When d > 3, we also give an algorithm with competitive ratio 1/2 d + 2.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
