Efficient approximation algorithms for scheduling moldable tasks
•We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and linear-speedup models.•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close to 1.333 under mild assumption...
Uložené v:
| Vydané v: | European journal of operational research Ročník 310; číslo 1; s. 71 - 83 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.10.2023
Elsevier |
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and linear-speedup models.•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close to 1.333 under mild assumptions.•Additionally, an efficient algorithm for throughput maximization with a deadline is proposed, achieving an approximation ratio close to 0.75 under mild assumptions.
Moldable tasks allow schedulers to determine the number of processors assigned to each task, thus enabling efficient use of large-scale parallel processing systems. We consider the problem of scheduling independent moldable tasks on processors and propose a new perspective of the existing speedup models: as the number p of processors assigned to a task increases, the speedup is linear if p is small and becomes sublinear after p exceeds a threshold. Based on this, we propose an efficient approximation algorithm to minimize the makespan. As a by-product, we also propose an approximation algorithm to maximize the sum of values of tasks completed by a deadline; this scheduling objective is considered for moldable tasks for the first time while similar works have been done for other types of parallel tasks. |
|---|---|
| AbstractList | Moldable tasks allow schedulers to determine the number of processors assigned to each task, thus enabling efficient use of large-scale parallel processing systems. We consider the problem of scheduling independent moldable tasks on processors and propose a new perspective of the existing speedup models: as the number p of processors assigned to a task increases, the speedup is linear if p is small and becomes sublinear after p exceeds a threshold. Based on this, we propose an efficient approximation algorithm to minimize the makespan. As a by-product, we also propose an approximation algorithm to maximize the sum of values of tasks completed by a deadline; this scheduling objective is considered for moldable tasks for the first time while similar works have been done for other types of parallel tasks. •We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and linear-speedup models.•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close to 1.333 under mild assumptions.•Additionally, an efficient algorithm for throughput maximization with a deadline is proposed, achieving an approximation ratio close to 0.75 under mild assumptions. Moldable tasks allow schedulers to determine the number of processors assigned to each task, thus enabling efficient use of large-scale parallel processing systems. We consider the problem of scheduling independent moldable tasks on processors and propose a new perspective of the existing speedup models: as the number p of processors assigned to a task increases, the speedup is linear if p is small and becomes sublinear after p exceeds a threshold. Based on this, we propose an efficient approximation algorithm to minimize the makespan. As a by-product, we also propose an approximation algorithm to maximize the sum of values of tasks completed by a deadline; this scheduling objective is considered for moldable tasks for the first time while similar works have been done for other types of parallel tasks. |
| Author | Wu, Xiaohu Loiseau, Patrick |
| Author_xml | – sequence: 1 givenname: Xiaohu orcidid: 0000-0003-3699-5241 surname: Wu fullname: Wu, Xiaohu email: xiaohu.wu@bupt.edu.cn organization: Beijing University of Posts and Telecommunications, Beijing, China – sequence: 2 givenname: Patrick surname: Loiseau fullname: Loiseau, Patrick email: patrick.loiseau@inria.fr organization: Inria, FairPlay team, Palaiseau, France |
| BackLink | https://inria.hal.science/hal-04236778$$DView record in HAL |
| BookMark | eNp9kDtPwzAQgC1UJNrCH2DKypBwfsQxEgNVVShSJRaYLceP1iWNKztU8O9JKCwMnU66u-8e3wSN2tBahK4xFBgwv90WdhtiQYDQAkgBjJ2hMRYVybngMEJjoFWVE4KrCzRJaQsAuMTlGD0snPPa27bL1H4fw6ffqc6HNlPNOkTfbXYpcyFmSW-s-Wh8u852oTGqbmzWqfSeLtG5U02yV79xit4eF6_zZb56eXqez1a5Zox2eVk5wXVtubDOcFY7rRUWd9hqAiXT1orSGQwOBO2LvKaaOmN0RYgBBqKmU3RznLtRjdzH_sz4JYPycjlbySEHjFBeVeKA-15x7NUxpBStk9p3P291UflGYpCDNbmVgzU5WJNA-gmsR8k_9G_XSej-CNlewMHbKNOgVFvjo9WdNMGfwr8BSwKJtg |
| CitedBy_id | crossref_primary_10_1016_j_jpdc_2025_105128 crossref_primary_10_1109_TSC_2025_3536305 crossref_primary_10_1007_s43069_024_00300_4 crossref_primary_10_1016_j_future_2025_108145 crossref_primary_10_1016_j_cor_2025_107041 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. Attribution |
| Copyright_xml | – notice: 2023 Elsevier B.V. – notice: Attribution |
| DBID | AAYXX CITATION 1XC VOOES |
| DOI | 10.1016/j.ejor.2023.02.044 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 83 |
| ExternalDocumentID | oai:HAL:hal-04236778v1 10_1016_j_ejor_2023_02_044 S0377221723001923 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD 1XC VOOES |
| ID | FETCH-LOGICAL-c443t-57f86cbe68efd64bfcca1891ec2054cee85fd10f0834bf6b3c3fddc722d0408b3 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001009930600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Oct 14 20:36:13 EDT 2025 Tue Nov 18 22:27:04 EST 2025 Sat Nov 29 07:20:47 EST 2025 Fri Feb 23 02:35:09 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Moldable tasks Approximation algorithms Scheduling Scheduling; approximation algorithms; moldable tasks |
| Language | English |
| License | Attribution: http://creativecommons.org/licenses/by |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c443t-57f86cbe68efd64bfcca1891ec2054cee85fd10f0834bf6b3c3fddc722d0408b3 |
| ORCID | 0000-0003-3699-5241 |
| OpenAccessLink | https://inria.hal.science/hal-04236778 |
| PageCount | 13 |
| ParticipantIDs | hal_primary_oai_HAL_hal_04236778v1 crossref_citationtrail_10_1016_j_ejor_2023_02_044 crossref_primary_10_1016_j_ejor_2023_02_044 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_02_044 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-10-01 |
| PublicationDateYYYYMMDD | 2023-10-01 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Guo, Kang (bib0018) 2010; 206 Steinberg (bib0034) 1997; 26 Wang, Cheng (bib0036) 1992; 21 Fishkin, Gerber, Jansen, Solis-Oba (bib0016) 2005 Kell, Havill (bib0028) 2015; 18 John, Eeckhout (bib0027) 2018 Wu, Zhang, Chen (bib0037) 2023; 306 Dutton, Mao (bib0013) 2007 Hochbaum, Shmoys (bib0020) 1987; 34 Crescenzi (bib0008) 1997 Decker, Lücking, Monien (bib0010) 2006; 361 Lucier, Menache, Naor, Yaniv (bib0030) 2013 Blazewicz, Kovalyov, Machowiak, Trystram, Weglarz (bib0006) 2006; 55 Drozdowski (bib0011) 1996; 57 Turek, Wolf, Yu (bib0035) 1992 Wu, Loiseau (bib0038) 2015 Mounié, Rapine, Trystram (bib0033) 2007; 37 Jansen, Zhang (bib0026) 2007; 47 Ebrahimi, McCauley, Moseley (bib0015) 2018; 62 Ludwig, Tiwari (bib0031) 1994 Barketau, Kovalyov, Weglarz, Machowiak (bib0002) 2014; 62 Jansen, Land (bib0023) 2018 Korte, Vygen (bib0029) 2018 Crescenzi, Fraigniaud, Halldorsson, Harutyunyan, Pierucci, Pietracaprina, Pucci (bib0009) 2016; 199 Mounié, Rapine, Trystram (bib0032) 1999 Benoit, Perotin, Robert, Sun (bib0005) 2022 Drozdowski (bib0012) 2004 Dutton, Mao, Chen, Watson (bib0014) 2008 Aridor, Domany, Goldshmidt, Kliteynik, Moreira, Shmueli (bib0001) 2005 Havill, Mao (bib0019) 2008; 187 Blazewicz, Machowiak, Weglarz, Kovalyov, Trystram (bib0007) 2004; 129 Guo, Shen (bib0017) 2017; 28 Jansen (bib0022) 2012 Benoit, Le Fèvre, Perotin, Raghavan, Robert, Sun (bib0004) 2022; 71 Jansen, Porkolab (bib0024) 2002; 32 Jansen, Thöle (bib0025) 2010; 39 Belkhale, Banerjee (bib0003) 1990 Jain, Menache, Naor, Yaniv (bib0021) 2012 Benoit (10.1016/j.ejor.2023.02.044_bib0005) 2022 Hochbaum (10.1016/j.ejor.2023.02.044_bib0020) 1987; 34 Wu (10.1016/j.ejor.2023.02.044_bib0038) 2015 Jansen (10.1016/j.ejor.2023.02.044_bib0024) 2002; 32 Benoit (10.1016/j.ejor.2023.02.044_bib0004) 2022; 71 Barketau (10.1016/j.ejor.2023.02.044_bib0002) 2014; 62 Guo (10.1016/j.ejor.2023.02.044_bib0018) 2010; 206 Turek (10.1016/j.ejor.2023.02.044_bib0035) 1992 Blazewicz (10.1016/j.ejor.2023.02.044_bib0006) 2006; 55 Havill (10.1016/j.ejor.2023.02.044_bib0019) 2008; 187 Jain (10.1016/j.ejor.2023.02.044_bib0021) 2012 Guo (10.1016/j.ejor.2023.02.044_bib0017) 2017; 28 Belkhale (10.1016/j.ejor.2023.02.044_bib0003) 1990 Crescenzi (10.1016/j.ejor.2023.02.044_bib0008) 1997 Decker (10.1016/j.ejor.2023.02.044_bib0010) 2006; 361 Drozdowski (10.1016/j.ejor.2023.02.044_bib0011) 1996; 57 Wang (10.1016/j.ejor.2023.02.044_bib0036) 1992; 21 Drozdowski (10.1016/j.ejor.2023.02.044_bib0012) 2004 Jansen (10.1016/j.ejor.2023.02.044_bib0026) 2007; 47 Ebrahimi (10.1016/j.ejor.2023.02.044_bib0015) 2018; 62 Mounié (10.1016/j.ejor.2023.02.044_bib0032) 1999 Mounié (10.1016/j.ejor.2023.02.044_bib0033) 2007; 37 Dutton (10.1016/j.ejor.2023.02.044_bib0013) 2007 Korte (10.1016/j.ejor.2023.02.044_bib0029) 2018 Aridor (10.1016/j.ejor.2023.02.044_bib0001) 2005 John (10.1016/j.ejor.2023.02.044_bib0027) 2018 Lucier (10.1016/j.ejor.2023.02.044_bib0030) 2013 Steinberg (10.1016/j.ejor.2023.02.044_bib0034) 1997; 26 Jansen (10.1016/j.ejor.2023.02.044_bib0022) 2012 Wu (10.1016/j.ejor.2023.02.044_bib0037) 2023; 306 Ludwig (10.1016/j.ejor.2023.02.044_bib0031) 1994 Jansen (10.1016/j.ejor.2023.02.044_bib0025) 2010; 39 Jansen (10.1016/j.ejor.2023.02.044_bib0023) 2018 Blazewicz (10.1016/j.ejor.2023.02.044_bib0007) 2004; 129 Kell (10.1016/j.ejor.2023.02.044_bib0028) 2015; 18 Fishkin (10.1016/j.ejor.2023.02.044_bib0016) 2005 Crescenzi (10.1016/j.ejor.2023.02.044_bib0009) 2016; 199 Dutton (10.1016/j.ejor.2023.02.044_bib0014) 2008 |
| References_xml | – volume: 306 start-page: 567 year: 2023 end-page: 578 ident: bib0037 article-title: An improved approximation algorithm for scheduling monotonic moldable tasks publication-title: European Journal of Operational Research – start-page: 91 year: 2005 end-page: 107 ident: bib0001 article-title: Open job management architecture for the blue gene/l supercomputer publication-title: Proceedings of the 11th workshop on job scheduling strategies for parallel processing – volume: 32 start-page: 507 year: 2002 end-page: 520 ident: bib0024 article-title: Linear-time approximation schemes for scheduling malleable parallel tasks publication-title: Algorithmica – start-page: 471 year: 2018 end-page: 487) ident: bib0029 article-title: The knapsack problem – start-page: 255 year: 2012 end-page: 266 ident: bib0021 article-title: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters publication-title: Proceedings of the twenty-fourth annual ACM symposium on parallelism in algorithms and architectures, SPAA’12 – volume: 129 start-page: 65 year: 2004 end-page: 80 ident: bib0007 article-title: Scheduling malleable tasks on parallel processors to minimize the makespan publication-title: Annals of Operations Research – start-page: 224 year: 2012 end-page: 235 ident: bib0022 article-title: A publication-title: Proceedings of the 24th annual ACM symposium on parallelism in algorithms and architectures – start-page: 323 year: 1992 end-page: 332 ident: bib0035 article-title: Approximate algorithms scheduling parallelizable tasks publication-title: Proceedings of the fourth annual ACM symposium on parallel algorithms and architectures – volume: 18 start-page: 393 year: 2015 end-page: 410 ident: bib0028 article-title: Improved upper bounds for online malleable job scheduling publication-title: Journal of Scheduling – start-page: 530 year: 2015 end-page: 537 ident: bib0038 article-title: Algorithms for scheduling deadline-sensitive malleable tasks publication-title: Proceedings of the 53rd annual Allerton conference on communication, control, and computing – volume: 47 start-page: 323 year: 2007 end-page: 342 ident: bib0026 article-title: Maximizing the total profit of rectangles packed into a rectangle publication-title: Algorithmica – start-page: 305 year: 2013 end-page: 314 ident: bib0030 article-title: Efficient online scheduling for deadline-sensitive jobs publication-title: Proceedings of the 25th ACM symposium on parallelism in algorithms and architectures – volume: 26 start-page: 401 year: 1997 end-page: 409 ident: bib0034 article-title: A strip-packing algorithm with absolute performance bound 2 publication-title: SIAM Journal on Computing – start-page: 1 year: 2022 end-page: 12 ident: bib0005 article-title: Online scheduling of moldable task graphs under common speedup models publication-title: Proceedings of the 51st international conference on parallel processing – start-page: 262 year: 1997 end-page: 273 ident: bib0008 article-title: A short guide to approximation preserving reductions publication-title: Proceedings of the twelfth annual IEEE conference computational complexity – volume: 206 start-page: 555 year: 2010 end-page: 561 ident: bib0018 article-title: Online scheduling of malleable parallel jobs with setup times on two identical machines publication-title: European Journal of Operational Research – start-page: 23 year: 1999 end-page: 32 ident: bib0032 article-title: Efficient approximation algorithms for scheduling malleable tasks publication-title: Proceedings of the 11th ACM symposium on parallel algorithms and architectures – volume: 21 start-page: 281 year: 1992 end-page: 294 ident: bib0036 article-title: A heuristic of scheduling parallel tasks and its analysis publication-title: SIAM Journal on Computing – start-page: 352 year: 2005 end-page: 363 ident: bib0016 article-title: Packing weighted rectangles into a square publication-title: Proceedings of the 30th international symposium on mathematical foundations of computer science – volume: 39 start-page: 3571 year: 2010 end-page: 3615 ident: bib0025 article-title: Approximation algorithms for scheduling parallel jobs publication-title: SIAM Journal on Computing – volume: 34 start-page: 144 year: 1987 end-page: 162 ident: bib0020 article-title: Using dual approximation algorithms for scheduling problems theoretical and practical results publication-title: Journal of the ACM – volume: 37 start-page: 401 year: 2007 end-page: 412 ident: bib0033 article-title: A publication-title: SIAM Journal on Computing – start-page: 136 year: 2007 end-page: 141 ident: bib0013 article-title: Online scheduling of malleable parallel jobs publication-title: Proceedings of the 19th IASTED international conference on parallel and distributed computing and systems – volume: 55 start-page: 486 year: 2006 end-page: 490 ident: bib0006 article-title: Preemptable malleable task scheduling problem publication-title: IEEE Transactions on Computers – volume: 361 start-page: 226 year: 2006 end-page: 240 ident: bib0010 article-title: A publication-title: Theoretical Computer Science – start-page: 72 year: 1990 end-page: 75 ident: bib0003 article-title: An approximate algorithm for the partitionable independent task scheduling problem publication-title: Proceedings of the 1990 international conference on parallel processing – volume: 199 start-page: 101 year: 2016 end-page: 109 ident: bib0009 article-title: On the complexity of the shortest-path broadcast problem publication-title: Discrete Applied Mathematics – start-page: 167 year: 1994 end-page: 176 ident: bib0031 article-title: Scheduling malleable and nonmalleable parallel tasks publication-title: Proceedings of the fifth annual ACM-SIAM symposium on discrete algorithms – volume: 57 start-page: 35 year: 1996 end-page: 40 ident: bib0011 article-title: Real-time scheduling of linear speedup parallel tasks publication-title: Information Processing Letters – start-page: 326 year: 2008 end-page: 333 ident: bib0014 article-title: Parallel job scheduling with overhead: A benchmark study publication-title: Proceedings of the IEEE international conference on networking, architecture, and storage – volume: 28 start-page: 3511 year: 2017 end-page: 3520 ident: bib0017 article-title: Efficient approximation algorithms for the bounded flexible scheduling problem in clouds publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 187 start-page: 1126 year: 2008 end-page: 1142 ident: bib0019 article-title: Competitive online scheduling of perfectly malleable jobs with setup times publication-title: European Journal of Operational Research – volume: 71 start-page: 1696 year: 2022 end-page: 1710 ident: bib0004 article-title: Resilient scheduling of moldable parallel jobs to cope with silent errors publication-title: IEEE Transactions on Computers – year: 2004 ident: bib0012 article-title: Scheduling parallel tasks — algorithms and complexity, Chapter 25 publication-title: Hand-book of Scheduling: Algorithms, Models and Performance Analysis – year: 2018 ident: bib0027 article-title: Performance evaluation and benchmarking – volume: 62 start-page: 255 year: 2014 end-page: 261 ident: bib0002 article-title: Scheduling arbitrary number of malleable tasks on multiprocessor systems publication-title: Bulletin of the Polish Academy of Sciences. Technical Sciences – volume: 62 start-page: 304 year: 2018 end-page: 318 ident: bib0015 article-title: Scheduling parallel jobs online with convex and concave parallelizability publication-title: Theory of Computing Systems – start-page: 172 year: 2018 end-page: 181 ident: bib0023 article-title: Scheduling monotone moldable jobs in linear time publication-title: Proceedings of the IEEE international parallel and distributed processing symposium – start-page: 255 year: 2012 ident: 10.1016/j.ejor.2023.02.044_bib0021 article-title: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters – volume: 37 start-page: 401 issue: 2 year: 2007 ident: 10.1016/j.ejor.2023.02.044_bib0033 article-title: A 32-approximation algorithm for scheduling independent monotonic malleable tasks publication-title: SIAM Journal on Computing – volume: 206 start-page: 555 issue: 3 year: 2010 ident: 10.1016/j.ejor.2023.02.044_bib0018 article-title: Online scheduling of malleable parallel jobs with setup times on two identical machines publication-title: European Journal of Operational Research – volume: 129 start-page: 65 issue: 1 year: 2004 ident: 10.1016/j.ejor.2023.02.044_bib0007 article-title: Scheduling malleable tasks on parallel processors to minimize the makespan publication-title: Annals of Operations Research – start-page: 326 year: 2008 ident: 10.1016/j.ejor.2023.02.044_bib0014 article-title: Parallel job scheduling with overhead: A benchmark study – start-page: 262 year: 1997 ident: 10.1016/j.ejor.2023.02.044_bib0008 article-title: A short guide to approximation preserving reductions – start-page: 136 year: 2007 ident: 10.1016/j.ejor.2023.02.044_bib0013 article-title: Online scheduling of malleable parallel jobs – start-page: 72 year: 1990 ident: 10.1016/j.ejor.2023.02.044_bib0003 article-title: An approximate algorithm for the partitionable independent task scheduling problem – start-page: 305 year: 2013 ident: 10.1016/j.ejor.2023.02.044_bib0030 article-title: Efficient online scheduling for deadline-sensitive jobs – volume: 18 start-page: 393 issue: 4 year: 2015 ident: 10.1016/j.ejor.2023.02.044_bib0028 article-title: Improved upper bounds for online malleable job scheduling publication-title: Journal of Scheduling – start-page: 530 year: 2015 ident: 10.1016/j.ejor.2023.02.044_bib0038 article-title: Algorithms for scheduling deadline-sensitive malleable tasks – volume: 71 start-page: 1696 issue: 7 year: 2022 ident: 10.1016/j.ejor.2023.02.044_bib0004 article-title: Resilient scheduling of moldable parallel jobs to cope with silent errors publication-title: IEEE Transactions on Computers – volume: 199 start-page: 101 year: 2016 ident: 10.1016/j.ejor.2023.02.044_bib0009 article-title: On the complexity of the shortest-path broadcast problem publication-title: Discrete Applied Mathematics – volume: 21 start-page: 281 issue: 2 year: 1992 ident: 10.1016/j.ejor.2023.02.044_bib0036 article-title: A heuristic of scheduling parallel tasks and its analysis publication-title: SIAM Journal on Computing – start-page: 91 year: 2005 ident: 10.1016/j.ejor.2023.02.044_bib0001 article-title: Open job management architecture for the blue gene/l supercomputer – volume: 28 start-page: 3511 issue: 12 year: 2017 ident: 10.1016/j.ejor.2023.02.044_bib0017 article-title: Efficient approximation algorithms for the bounded flexible scheduling problem in clouds publication-title: IEEE Transactions on Parallel and Distributed Systems – start-page: 23 year: 1999 ident: 10.1016/j.ejor.2023.02.044_bib0032 article-title: Efficient approximation algorithms for scheduling malleable tasks – volume: 26 start-page: 401 issue: 2 year: 1997 ident: 10.1016/j.ejor.2023.02.044_bib0034 article-title: A strip-packing algorithm with absolute performance bound 2 publication-title: SIAM Journal on Computing – volume: 39 start-page: 3571 issue: 8 year: 2010 ident: 10.1016/j.ejor.2023.02.044_bib0025 article-title: Approximation algorithms for scheduling parallel jobs publication-title: SIAM Journal on Computing – start-page: 167 year: 1994 ident: 10.1016/j.ejor.2023.02.044_bib0031 article-title: Scheduling malleable and nonmalleable parallel tasks – volume: 57 start-page: 35 issue: 1 year: 1996 ident: 10.1016/j.ejor.2023.02.044_bib0011 article-title: Real-time scheduling of linear speedup parallel tasks publication-title: Information Processing Letters – start-page: 471 year: 2018 ident: 10.1016/j.ejor.2023.02.044_bib0029 – volume: 55 start-page: 486 issue: 4 year: 2006 ident: 10.1016/j.ejor.2023.02.044_bib0006 article-title: Preemptable malleable task scheduling problem publication-title: IEEE Transactions on Computers – start-page: 1 year: 2022 ident: 10.1016/j.ejor.2023.02.044_bib0005 article-title: Online scheduling of moldable task graphs under common speedup models – volume: 47 start-page: 323 issue: 3 year: 2007 ident: 10.1016/j.ejor.2023.02.044_bib0026 article-title: Maximizing the total profit of rectangles packed into a rectangle publication-title: Algorithmica – volume: 34 start-page: 144 issue: 1 year: 1987 ident: 10.1016/j.ejor.2023.02.044_bib0020 article-title: Using dual approximation algorithms for scheduling problems theoretical and practical results publication-title: Journal of the ACM – year: 2004 ident: 10.1016/j.ejor.2023.02.044_bib0012 article-title: Scheduling parallel tasks — algorithms and complexity, Chapter 25 – start-page: 352 year: 2005 ident: 10.1016/j.ejor.2023.02.044_bib0016 article-title: Packing weighted rectangles into a square – volume: 62 start-page: 304 issue: 2 year: 2018 ident: 10.1016/j.ejor.2023.02.044_bib0015 article-title: Scheduling parallel jobs online with convex and concave parallelizability publication-title: Theory of Computing Systems – year: 2018 ident: 10.1016/j.ejor.2023.02.044_bib0027 – start-page: 172 year: 2018 ident: 10.1016/j.ejor.2023.02.044_bib0023 article-title: Scheduling monotone moldable jobs in linear time – volume: 62 start-page: 255 issue: 2 year: 2014 ident: 10.1016/j.ejor.2023.02.044_bib0002 article-title: Scheduling arbitrary number of malleable tasks on multiprocessor systems publication-title: Bulletin of the Polish Academy of Sciences. Technical Sciences – volume: 361 start-page: 226 issue: 2–3 year: 2006 ident: 10.1016/j.ejor.2023.02.044_bib0010 article-title: A 54-approximation algorithm for scheduling identical malleable tasks publication-title: Theoretical Computer Science – volume: 187 start-page: 1126 issue: 3 year: 2008 ident: 10.1016/j.ejor.2023.02.044_bib0019 article-title: Competitive online scheduling of perfectly malleable jobs with setup times publication-title: European Journal of Operational Research – volume: 32 start-page: 507 issue: 3 year: 2002 ident: 10.1016/j.ejor.2023.02.044_bib0024 article-title: Linear-time approximation schemes for scheduling malleable parallel tasks publication-title: Algorithmica – start-page: 323 year: 1992 ident: 10.1016/j.ejor.2023.02.044_bib0035 article-title: Approximate algorithms scheduling parallelizable tasks – start-page: 224 year: 2012 ident: 10.1016/j.ejor.2023.02.044_bib0022 article-title: A (32+ϵ) approximation algorithm for scheduling moldable and non-moldable parallel tasks – volume: 306 start-page: 567 issue: 2 year: 2023 ident: 10.1016/j.ejor.2023.02.044_bib0037 article-title: An improved approximation algorithm for scheduling monotonic moldable tasks publication-title: European Journal of Operational Research |
| SSID | ssj0001515 |
| Score | 2.4730926 |
| Snippet | •We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and... Moldable tasks allow schedulers to determine the number of processors assigned to each task, thus enabling efficient use of large-scale parallel processing... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 71 |
| SubjectTerms | Approximation algorithms Computer Science Moldable tasks Operations Research Scheduling |
| Title | Efficient approximation algorithms for scheduling moldable tasks |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.02.044 https://inria.hal.science/hal-04236778 |
| Volume | 310 |
| WOSCitedRecordID | wos001009930600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLa6DqHxwKWANm6yEG9VUGM3sfNGhYoGQhMSQ_TNShx7bSnJ1KZVfz7H8aXbRCf2wEtUuc1p2u_Y_nJyzncQeidjrRQvYKbFRRYNaTmIMinTKKGllio1mbqybTbBzs74ZJJ963S--1qYzYJVFd9us8v_CjWMAdimdPYOcAejMACvAXQ4Auxw_Cfgx60oRJs6bvTCtzNbnNjPFxf1ctZMrQJDH-5qYZdpi9F_14uyraBq8tWv1d5YveOtMLD0EUQnFRRCyj_XBrLJLK-n65DqU5tnQGtLV5ugwu8iDWSXsxYqrBiLCLG1ln71pC4r9aqb2LXQtlbxuyr963ptQwfz92peG3FWQlsBVasIeV0c-8amFVIJfZbaXBgbwtgQAyLAxgE6JCzJeBcdjj6PJ1_CBm04XPtwyf0cV0tl0_5uXsk-vnIw9ZH3lomcP0YP3S0EHlnon6COqnrovq9g6KFHvlMHdgt3Dz24Ijv5FH0ILoKvuQjeuQgGF8E7F8HeRXDrIs_Qj0_j84-nkeukEcnhkDZRwjRPZaFSrnSZDgsN8zbmWawkAcoOPIknuowHGvg4vJkWVFJdlpIRUsIizwv6HHWrulLHCFMNVvJBxrIcyKgiOZCglPNYZqmiXLITFPv_S0gnM2-6nSzEfqROUD-cc2lFVm79dOJhEI4mWvonwKtuPe8tYBa-wOiqn46-CjNmksOMkuImfnGnS3mJjnYT5RXqNsu1eo3uyU0zWy3fOL_7A8AZl74 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+approximation+algorithms+for+scheduling+moldable+tasks&rft.jtitle=European+journal+of+operational+research&rft.au=Wu%2C+Xiaohu&rft.au=Loiseau%2C+Patrick&rft.date=2023-10-01&rft.issn=0377-2217&rft.volume=310&rft.issue=1&rft.spage=71&rft.epage=83&rft_id=info:doi/10.1016%2Fj.ejor.2023.02.044&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2023_02_044 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |