Academic Journal

Streaming algorithms for multitasking scheduling with shared processing

التفاصيل البيبلوغرافية
العنوان: Streaming algorithms for multitasking scheduling with shared processing
المؤلفون: Fu, Bin, Huo, Yumei, Zhao, Hairong
المصدر: Computer Science Faculty Publications and Presentations
بيانات النشر: ScholarWorks @ UTRGV
سنة النشر: 2022
مصطلحات موضوعية: Streaming algorithm, Multitasking scheduling, Shared processing, Parallel machine, Makespan, Approximation scheme, Computer Sciences
الوصف: In this paper, we design the first streaming algorithms for the problem of multitasking scheduling on parallel machines with shared processing. In one pass, our streaming approximation schemes can provide an approximate value of the optimal makespan. If the jobs can be read in two passes, the algorithm can find the schedule with the approximate value. This work not only provides an algorithmic big data solution for the studied problem, but also gives an insight into the design of streaming algorithms for other problems in the area of scheduling.
نوع الوثيقة: text
وصف الملف: application/pdf
اللغة: unknown
Relation: https://scholarworks.utrgv.edu/cs_fac/105; https://scholarworks.utrgv.edu/context/cs_fac/article/1104/viewcontent/2204.01970.pdf
DOI: 10.1016/j.dam.2022.06.019
الاتاحة: https://scholarworks.utrgv.edu/cs_fac/105
https://doi.org/10.1016/j.dam.2022.06.019
https://scholarworks.utrgv.edu/context/cs_fac/article/1104/viewcontent/2204.01970.pdf
Rights: http://creativecommons.org/licenses/by-nc-nd/4.0/
رقم الانضمام: edsbas.78F58FDB
قاعدة البيانات: BASE
الوصف
DOI:10.1016/j.dam.2022.06.019