Optimizing performance and reliability on heterogeneous parallel systems: Approximation algorithms and heuristics
We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we sh...
Uložené v:
| Vydané v: | Journal of parallel and distributed computing Ročník 72; číslo 2; s. 268 - 280 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.02.2012
Elsevier |
| Predmet: | |
| ISSN: | 0743-7315, 1096-0848 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we show that both objectives are contradictory and that the number of points of the Pareto-front can be exponential. This means that this problem cannot be approximated by a single schedule. Second, for independent unitary tasks, we provide an optimal scheduling algorithm where the objective is to maximize the reliability subject to makespan minimization. For the bi-objective optimization, we provide a
(
1
+
ϵ
,
1
)
-approximation algorithm of the Pareto-front. Next, for independent arbitrary tasks, we propose a
〈
2
̄
,
1
〉
-approximation algorithm (
i.e. for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan) that has a much lower complexity than the other existing algorithms. This solution is used to derive a
(
2
+
ϵ
,
1
)
-approximation of the Pareto-front of the problem.
All these proposed solutions are discriminated by the value of the product {
failure rate} × {
unitary instruction execution time} of each processor, which appears to be a crucial parameter in the context of bi-objective optimization. Based on this observation, we provide a general method for converting scheduling heuristics on heterogeneous clusters into heuristics that take into account the reliability when there are precedence constraints. The average behavior is studied by extensive simulations. Finally, we discuss the specific case of scheduling a chain of tasks which leads to optimal results.
► We study the problem of scheduling task in case of failures. ► We target optimizing makespan and reliability. ► We provide approximation algorithms of the Pareto front for important subcases. ► We provide an efficient heuristic for the general case. |
|---|---|
| AbstractList | We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we show that both objectives are contradictory and that the number of points of the Pareto-front can be exponential. This means that this problem cannot be approximated by a single schedule. Second, for independent unitary tasks, we provide an optimal scheduling algorithm where the objective is to maximize the reliability subject to makespan minimization. For the bi-objective optimization, we provide a (1+ ,1)-approximation algorithm of the Pareto-front. Next, for independent arbitrary tasks, we propose a 1; 2 ; -approximation algorithm (i.e. for any xed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan) that has a much lower complexity than the other existing algorithms. This solution is used to derive a (2 + ; 1)-approximation of the Pareto-front of the problem. All these proposed solutions are discriminated by the value of the product ffailure rateg funitary instruction execution timeg of each processor, which appears to be a crucial parameter in the context of bi-objective optimization. Based on this observation, we provide a general method for converting scheduling heuristics on heterogeneous clusters into heuristics that take into account the reliability when there are precedence constraints. The average behaviour is studied by extensive simulations. Finally, we discuss the speci c case of scheduling a chain of tasks which leads to optimal results. We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we show that both objectives are contradictory and that the number of points of the Pareto-front can be exponential. This means that this problem cannot be approximated by a single schedule. Second, for independent unitary tasks, we provide an optimal scheduling algorithm where the objective is to maximize the reliability subject to makespan minimization. For the bi-objective optimization, we provide a ( 1 + [Greek Lunate Epsilon] , 1 ) -approximation algorithm of the Pareto-front. Next, for independent arbitrary tasks, we propose a aOE[copy 2 I" , 1 aOEa -approximation algorithm (i.e. for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan) that has a much lower complexity than the other existing algorithms. This solution is used to derive a ( 2 + [Greek Lunate Epsilon] , 1 ) -approximation of the Pareto-front of the problem. All these proposed solutions are discriminated by the value of the product {failure rate} {unitary instruction execution time} of each processor, which appears to be a crucial parameter in the context of bi-objective optimization. Based on this observation, we provide a general method for converting scheduling heuristics on heterogeneous clusters into heuristics that take into account the reliability when there are precedence constraints. The average behavior is studied by extensive simulations. Finally, we discuss the specific case of scheduling a chain of tasks which leads to optimal results. We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we show that both objectives are contradictory and that the number of points of the Pareto-front can be exponential. This means that this problem cannot be approximated by a single schedule. Second, for independent unitary tasks, we provide an optimal scheduling algorithm where the objective is to maximize the reliability subject to makespan minimization. For the bi-objective optimization, we provide a ( 1 + ϵ , 1 ) -approximation algorithm of the Pareto-front. Next, for independent arbitrary tasks, we propose a 〈 2 ̄ , 1 〉 -approximation algorithm ( i.e. for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan) that has a much lower complexity than the other existing algorithms. This solution is used to derive a ( 2 + ϵ , 1 ) -approximation of the Pareto-front of the problem. All these proposed solutions are discriminated by the value of the product { failure rate} × { unitary instruction execution time} of each processor, which appears to be a crucial parameter in the context of bi-objective optimization. Based on this observation, we provide a general method for converting scheduling heuristics on heterogeneous clusters into heuristics that take into account the reliability when there are precedence constraints. The average behavior is studied by extensive simulations. Finally, we discuss the specific case of scheduling a chain of tasks which leads to optimal results. ► We study the problem of scheduling task in case of failures. ► We target optimizing makespan and reliability. ► We provide approximation algorithms of the Pareto front for important subcases. ► We provide an efficient heuristic for the general case. |
| Author | Saule, Erik Trystram, Denis Jeannot, Emmanuel |
| Author_xml | – sequence: 1 givenname: Emmanuel surname: Jeannot fullname: Jeannot, Emmanuel email: emmanuel.jeannot@inria.fr organization: INRIA Bordeaux Sud-Ouest, Talence, France – sequence: 2 givenname: Erik surname: Saule fullname: Saule, Erik organization: BMI, Ohio State University, Columbus 43210, OH, USA – sequence: 3 givenname: Denis surname: Trystram fullname: Trystram, Denis organization: Grenoble Institute of Technology, Grenoble, France |
| BackLink | https://inria.hal.science/hal-00788219$$DView record in HAL |
| BookMark | eNp9kUFrGzEQhUVJoU7aP9DTHtvDOpLWu9KWXkxom4Ihl_YsZrWz9hjtaiPJoc6vr2yHHnoIDAyI7z00712zq8lPyNhHwZeCi-Z2v9zPvV1KLsQyD-fVG7YQvG1Krlf6ii24WlWlqkT9jl3HuOcZrJVesMeHOdFIzzRtixnD4MMIk8UCpr4I6Ag6cpSOhZ-KHSYMfosT-kMsZgjgHLoiHmPCMX4p1vMc_B8aIVGmwW19oLQb49lrh4dAMZGN79nbAVzEDy_7hv3-_u3X3X25efjx8269KW3VqFRWHVddyyVKJaDpa1i1FdTtYJUF2egOZctrLZqm0lZD3SGqoQEhO617gL6vbtjni-8OnJlD_lc4Gg9k7tcbc3rjXGktRfskMvvpwuYLHg8YkxkpWnQOzseanDHXuhVaZlReUBt8jAGHf96Cn7jG7M2pC3PqwuTJXWSR_k9kKZ1zSgHIvS79epFizuqJMJhoCXNFPQW0yfSeXpP_BW0Cqac |
| CitedBy_id | crossref_primary_10_1016_j_jpdc_2014_01_005 crossref_primary_10_1002_cpe_3179 crossref_primary_10_1007_s10723_015_9331_1 crossref_primary_10_1016_j_jnca_2018_03_028 crossref_primary_10_1002_cpe_7252 crossref_primary_10_1007_s10586_014_0372_1 crossref_primary_10_1109_TPDS_2015_2403861 crossref_primary_10_3390_sym15112047 crossref_primary_10_1109_TCC_2016_2608345 crossref_primary_10_32604_cmc_2022_021410 crossref_primary_10_1007_s10586_021_03464_4 crossref_primary_10_1007_s11227_021_03764_x crossref_primary_10_1007_s12652_018_0926_9 crossref_primary_10_1016_j_jpdc_2015_07_002 crossref_primary_10_1109_ACCESS_2020_2970475 crossref_primary_10_1155_2014_496843 crossref_primary_10_1016_j_ins_2016_08_003 |
| Cites_doi | 10.1109/HCW.1998.666545 10.1137/0206013 10.1109/TSE.1987.232562 10.1093/comjnl/bxh086 10.1109/71.207593 10.1109/TEVC.2003.810758 10.1109/TPDS.2009.84 10.1145/1248377.1248423 10.1109/HCW.1999.765092 10.1109/71.993209 10.1016/j.jpdc.2008.11.002 10.1016/j.parco.2010.03.001 10.1137/0217033 10.1109/12.165396 10.1109/SFCS.2000.892068 10.1006/jagm.2001.1184 10.1007/978-3-540-85451-7_94 10.1177/1094342006067469 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Inc. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2011 Elsevier Inc. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
| DOI | 10.1016/j.jpdc.2011.11.003 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 280 |
| ExternalDocumentID | oai:HAL:hal-00788219v1 10_1016_j_jpdc_2011_11_003 S074373151100219X |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D 1XC |
| ID | FETCH-LOGICAL-c367t-3b07b902e271a6d5a493a59fc7ca268be2905816638c8a5bee7f6a12b88daadd3 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000299139000015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Tue Oct 14 20:52:23 EDT 2025 Sat Sep 27 22:00:36 EDT 2025 Sat Nov 29 07:10:53 EST 2025 Tue Nov 18 21:45:36 EST 2025 Fri Feb 23 02:27:54 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Pareto-front approximation Scheduling Makespan Reliability Precedence task graphs Precedence Task Graphs |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c367t-3b07b902e271a6d5a493a59fc7ca268be2905816638c8a5bee7f6a12b88daadd3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ORCID | 0000-0002-2623-6922 0000-0002-3956-2997 |
| PQID | 1010889182 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00788219v1 proquest_miscellaneous_1010889182 crossref_primary_10_1016_j_jpdc_2011_11_003 crossref_citationtrail_10_1016_j_jpdc_2011_11_003 elsevier_sciencedirect_doi_10_1016_j_jpdc_2011_11_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-02-01 |
| PublicationDateYYYYMMDD | 2012-02-01 |
| PublicationDate_xml | – month: 02 year: 2012 text: 2012-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2012 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Koo, Toueg (br000095) 1987; 13 Shatz, Wang (br000135) 1992; 41 Dogan, Ozgüner (br000040) 2002; 13 Dogan, Ozgüner (br000045) 2005; 48 Sih, Lee (br000150) 1993; 4 Oh, Ha (br000115) 1996; vol. 1124 Benoit, Robert, Rosenberg, Vivien (br000010) 2011; 37 Canon, Jeannot (br000025) 2010; 21 A. Benoit, L.-C. Canon, E. Jeannot, Y. Robert, Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms, Journal of Scheduling (in press). M. Maheswaran, H.J. Siegel, A dynamic matching and scheduling algorithm for heterogeneous computing systems, in: Heterogeneous Computing Workshop, 1998, pp. 57–69. Graham, Lawler, Lenstra, Kan (br000075) 1979; 5 (br000105) 2004 Chekuri, Bender (br000030) 2001; 41 J.J. Dongarra, E. Jeannot, E. Saule, Z. Shi, Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems, in: Proc. of SPAA, 2007, pp. 280–288. Cormen, Leiserson, Rivest, Stein (br000035) 2001 Garey, Johnson (br000055) 1979 Giroudeau, König (br000065) 2007 Hochbaum, Shmoys (br000085) 1988; 17 Pinedo (br000125) 2008 Besseron, Bouguerra, Gautier, Saule, Trystram (br000015) 2009 H. Topcuoglu, S. Hariri, M.-Y. Wu, Task scheduling algorithms for heterogeneous processors, in: 8th IEEE Heterogeneous Computing Workshop (HCW’99), 1999 3–14. Zitzler, Thiele, Laumanns, Fonseca, Grunert da Fonseca (br000160) 2003; 7 Gonzalez, Ibarra, Sahni (br000070) 1977; 6 Legrand, Robert (br000100) 2005 D.B. Shmoys, E. Tardos, Scheduling unrelated machines with costs, in: Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993, pp. 448–454. . E. Jeannot, E. Saule, D. Trystram, Bi-Objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines, in: The 14th International Euro-Par Conference on Parallel and Distributed Computing (Euro-Par 2008), Las Palmas de Gran Canaria, Spain, 2008. Bouteiller, Herault, Krawezik, Lemarinier, Cappello (br000020) 2006; 20 Girault, Saule, Trystram (br000060) 2009; 69 C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proc. of FOCS, 2000, pp. 86–92. Sardiña, Boeres, de A. Drummond (br000130) 2010; vol. 6043 Shatz, Wang, Goto (br000140) 1992; 41 M. Hakem, F. Butelle, A bi-objective algortithm for scheduling parallel applications on heterogeneous systems subject to failures, in: Renpar 17, 2006. Garey (10.1016/j.jpdc.2011.11.003_br000055) 1979 Shatz (10.1016/j.jpdc.2011.11.003_br000135) 1992; 41 Pinedo (10.1016/j.jpdc.2011.11.003_br000125) 2008 10.1016/j.jpdc.2011.11.003_br000145 Chekuri (10.1016/j.jpdc.2011.11.003_br000030) 2001; 41 10.1016/j.jpdc.2011.11.003_br000120 Canon (10.1016/j.jpdc.2011.11.003_br000025) 2010; 21 Girault (10.1016/j.jpdc.2011.11.003_br000060) 2009; 69 10.1016/j.jpdc.2011.11.003_br000005 Hochbaum (10.1016/j.jpdc.2011.11.003_br000085) 1988; 17 Besseron (10.1016/j.jpdc.2011.11.003_br000015) 2009 Benoit (10.1016/j.jpdc.2011.11.003_br000010) 2011; 37 Oh (10.1016/j.jpdc.2011.11.003_br000115) 1996; vol. 1124 Koo (10.1016/j.jpdc.2011.11.003_br000095) 1987; 13 Cormen (10.1016/j.jpdc.2011.11.003_br000035) 2001 10.1016/j.jpdc.2011.11.003_br000050 10.1016/j.jpdc.2011.11.003_br000090 Shatz (10.1016/j.jpdc.2011.11.003_br000140) 1992; 41 10.1016/j.jpdc.2011.11.003_br000155 Sih (10.1016/j.jpdc.2011.11.003_br000150) 1993; 4 Zitzler (10.1016/j.jpdc.2011.11.003_br000160) 2003; 7 (10.1016/j.jpdc.2011.11.003_br000105) 2004 Dogan (10.1016/j.jpdc.2011.11.003_br000040) 2002; 13 10.1016/j.jpdc.2011.11.003_br000110 Sardiña (10.1016/j.jpdc.2011.11.003_br000130) 2010; vol. 6043 Giroudeau (10.1016/j.jpdc.2011.11.003_br000065) 2007 Graham (10.1016/j.jpdc.2011.11.003_br000075) 1979; 5 Gonzalez (10.1016/j.jpdc.2011.11.003_br000070) 1977; 6 Bouteiller (10.1016/j.jpdc.2011.11.003_br000020) 2006; 20 Legrand (10.1016/j.jpdc.2011.11.003_br000100) 2005 Dogan (10.1016/j.jpdc.2011.11.003_br000045) 2005; 48 10.1016/j.jpdc.2011.11.003_br000080 |
| References_xml | – reference: D.B. Shmoys, E. Tardos, Scheduling unrelated machines with costs, in: Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993, pp. 448–454. – volume: 4 start-page: 175 year: 1993 end-page: 187 ident: br000150 article-title: A compile-time scheduling heuristic for interconnection-constrained heterogenous processor architectures publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 7 start-page: 117 year: 2003 end-page: 132 ident: br000160 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE Transactions on Evolutionary Computation – volume: 17 start-page: 539 year: 1988 end-page: 551 ident: br000085 article-title: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach publication-title: SIAM Journal on Computing – reference: M. Maheswaran, H.J. Siegel, A dynamic matching and scheduling algorithm for heterogeneous computing systems, in: Heterogeneous Computing Workshop, 1998, pp. 57–69. – volume: 13 start-page: 308 year: 2002 end-page: 323 ident: br000040 article-title: Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing publication-title: IEEE Transactions on Parallel and Distributed Systems – year: 2004 ident: br000105 publication-title: Handbook of Scheduling. Algorithms, Models and Performance Analysis – volume: 21 start-page: 532 year: 2010 end-page: 546 ident: br000025 article-title: Evaluation and optimization of the robustness of dag schedules in heterogeneous environments publication-title: IEEE Transactions on Parallel and Distributed Systems – year: 2008 ident: br000125 article-title: Scheduling: Theory, Algorithms, and Systems – reference: J.J. Dongarra, E. Jeannot, E. Saule, Z. Shi, Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems, in: Proc. of SPAA, 2007, pp. 280–288. – reference: E. Jeannot, E. Saule, D. Trystram, Bi-Objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines, in: The 14th International Euro-Par Conference on Parallel and Distributed Computing (Euro-Par 2008), Las Palmas de Gran Canaria, Spain, 2008. – volume: 20 start-page: 319 year: 2006 end-page: 333 ident: br000020 article-title: MPICH-V: a multiprotocol fault tolerant MPI publication-title: International Journal of High Performance Computing and Applications – year: 2009 ident: br000015 article-title: Fault tolerance and availability awarness in computational grids publication-title: Fundamentals of Grid Computing – volume: 6 start-page: 155 year: 1977 end-page: 166 ident: br000070 article-title: Bounds for LPT schedules on uniform processors publication-title: SIAM Journal of Computing – year: 2005 ident: br000100 article-title: Algorithmique Parallèle – year: 2001 ident: br000035 article-title: Introduction to Algorithms – year: 1979 ident: br000055 article-title: Computers and Intractability – reference: C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proc. of FOCS, 2000, pp. 86–92. – volume: 37 start-page: 365 year: 2011 end-page: 378 ident: br000010 article-title: Static worksharing strategies for heterogeneous computers with unrecoverable interruptions publication-title: Parallel Computing – volume: vol. 1124 start-page: 573 year: 1996 end-page: 577 ident: br000115 article-title: A static scheduling heuristic for heterogeneous processors publication-title: Euro-Par, Vol. II – volume: 41 start-page: 1156 year: 1992 end-page: 1169 ident: br000135 article-title: Task allocation for maximizing reliability of distribued computer systems publication-title: IEEE Transactions on Computers – reference: H. Topcuoglu, S. Hariri, M.-Y. Wu, Task scheduling algorithms for heterogeneous processors, in: 8th IEEE Heterogeneous Computing Workshop (HCW’99), 1999 3–14. – reference: M. Hakem, F. Butelle, A bi-objective algortithm for scheduling parallel applications on heterogeneous systems subject to failures, in: Renpar 17, 2006. – volume: 41 start-page: 212 year: 2001 end-page: 224 ident: br000030 article-title: An efficient approximation algorithm for minimizing makespan on uniformly related machines publication-title: Journal of Algorithms – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: br000075 article-title: Optimization and approximation in deterministic sequencing and scheduling : a survey, ann publication-title: Discrete Mathematics – volume: 41 start-page: 1156 year: 1992 end-page: 1168 ident: br000140 article-title: Task allocation for maximizing reliability of distributed computer systems publication-title: Computers, IEEE Transactions on – volume: 48 start-page: 300 year: 2005 end-page: 314 ident: br000045 article-title: Bi-objective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems publication-title: Computer Journal – volume: 13 start-page: 23 year: 1987 end-page: 31 ident: br000095 publication-title: IEEE Transactions on Software Engineering – year: 2007 ident: br000065 article-title: Multiprocessor Scheduling: Theory and Applications – volume: vol. 6043 start-page: 102 year: 2010 end-page: 111 ident: br000130 article-title: An efficient weighted bi-objective scheduling algorithm for heterogeneous systems publication-title: Euro-Par 2009–Parallel Processing Workshops – reference: A. Benoit, L.-C. Canon, E. Jeannot, Y. Robert, Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms, Journal of Scheduling (in press). – volume: 69 start-page: 326 year: 2009 end-page: 336 ident: br000060 article-title: Reliability versus performance for critical applications publication-title: Journal of Parallel and Distributed Computing – reference: . – year: 2004 ident: 10.1016/j.jpdc.2011.11.003_br000105 – ident: 10.1016/j.jpdc.2011.11.003_br000110 doi: 10.1109/HCW.1998.666545 – year: 2007 ident: 10.1016/j.jpdc.2011.11.003_br000065 – volume: 6 start-page: 155 year: 1977 ident: 10.1016/j.jpdc.2011.11.003_br000070 article-title: Bounds for LPT schedules on uniform processors publication-title: SIAM Journal of Computing doi: 10.1137/0206013 – volume: 13 start-page: 23 year: 1987 ident: 10.1016/j.jpdc.2011.11.003_br000095 publication-title: IEEE Transactions on Software Engineering doi: 10.1109/TSE.1987.232562 – volume: 48 start-page: 300 issue: 3 year: 2005 ident: 10.1016/j.jpdc.2011.11.003_br000045 article-title: Bi-objective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems publication-title: Computer Journal doi: 10.1093/comjnl/bxh086 – volume: vol. 1124 start-page: 573 year: 1996 ident: 10.1016/j.jpdc.2011.11.003_br000115 article-title: A static scheduling heuristic for heterogeneous processors – year: 2008 ident: 10.1016/j.jpdc.2011.11.003_br000125 – volume: 4 start-page: 175 issue: 2 year: 1993 ident: 10.1016/j.jpdc.2011.11.003_br000150 article-title: A compile-time scheduling heuristic for interconnection-constrained heterogenous processor architectures publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/71.207593 – volume: 7 start-page: 117 issue: 2 year: 2003 ident: 10.1016/j.jpdc.2011.11.003_br000160 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810758 – year: 2009 ident: 10.1016/j.jpdc.2011.11.003_br000015 article-title: Fault tolerance and availability awarness in computational grids – volume: 21 start-page: 532 issue: 4 year: 2010 ident: 10.1016/j.jpdc.2011.11.003_br000025 article-title: Evaluation and optimization of the robustness of dag schedules in heterogeneous environments publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2009.84 – ident: 10.1016/j.jpdc.2011.11.003_br000050 doi: 10.1145/1248377.1248423 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.jpdc.2011.11.003_br000075 article-title: Optimization and approximation in deterministic sequencing and scheduling : a survey, ann publication-title: Discrete Mathematics – ident: 10.1016/j.jpdc.2011.11.003_br000080 – ident: 10.1016/j.jpdc.2011.11.003_br000155 doi: 10.1109/HCW.1999.765092 – volume: 13 start-page: 308 issue: 3 year: 2002 ident: 10.1016/j.jpdc.2011.11.003_br000040 article-title: Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/71.993209 – volume: 69 start-page: 326 issue: 3 year: 2009 ident: 10.1016/j.jpdc.2011.11.003_br000060 article-title: Reliability versus performance for critical applications publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2008.11.002 – volume: 37 start-page: 365 issue: 8 year: 2011 ident: 10.1016/j.jpdc.2011.11.003_br000010 article-title: Static worksharing strategies for heterogeneous computers with unrecoverable interruptions publication-title: Parallel Computing doi: 10.1016/j.parco.2010.03.001 – volume: 17 start-page: 539 issue: 3 year: 1988 ident: 10.1016/j.jpdc.2011.11.003_br000085 article-title: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach publication-title: SIAM Journal on Computing doi: 10.1137/0217033 – volume: vol. 6043 start-page: 102 year: 2010 ident: 10.1016/j.jpdc.2011.11.003_br000130 article-title: An efficient weighted bi-objective scheduling algorithm for heterogeneous systems – volume: 41 start-page: 1156 issue: 9 year: 1992 ident: 10.1016/j.jpdc.2011.11.003_br000140 article-title: Task allocation for maximizing reliability of distributed computer systems publication-title: Computers, IEEE Transactions on doi: 10.1109/12.165396 – ident: 10.1016/j.jpdc.2011.11.003_br000120 doi: 10.1109/SFCS.2000.892068 – volume: 41 start-page: 212 year: 2001 ident: 10.1016/j.jpdc.2011.11.003_br000030 article-title: An efficient approximation algorithm for minimizing makespan on uniformly related machines publication-title: Journal of Algorithms doi: 10.1006/jagm.2001.1184 – year: 1979 ident: 10.1016/j.jpdc.2011.11.003_br000055 – year: 2005 ident: 10.1016/j.jpdc.2011.11.003_br000100 – ident: 10.1016/j.jpdc.2011.11.003_br000145 – ident: 10.1016/j.jpdc.2011.11.003_br000090 doi: 10.1007/978-3-540-85451-7_94 – year: 2001 ident: 10.1016/j.jpdc.2011.11.003_br000035 – ident: 10.1016/j.jpdc.2011.11.003_br000005 – volume: 20 start-page: 319 issue: 3 year: 2006 ident: 10.1016/j.jpdc.2011.11.003_br000020 article-title: MPICH-V: a multiprotocol fault tolerant MPI publication-title: International Journal of High Performance Computing and Applications doi: 10.1177/1094342006067469 – volume: 41 start-page: 1156 issue: 9 year: 1992 ident: 10.1016/j.jpdc.2011.11.003_br000135 article-title: Task allocation for maximizing reliability of distribued computer systems publication-title: IEEE Transactions on Computers doi: 10.1109/12.165396 |
| SSID | ssj0011578 |
| Score | 2.0488005 |
| Snippet | We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 268 |
| SubjectTerms | Algorithms Approximation Computer Science Distributed, Parallel, and Cluster Computing Heuristic Makespan Mathematical models Optimization Pareto-front approximation Precedence task graphs Processors Reliability Scheduling Tasks |
| Title | Optimizing performance and reliability on heterogeneous parallel systems: Approximation algorithms and heuristics |
| URI | https://dx.doi.org/10.1016/j.jpdc.2011.11.003 https://www.proquest.com/docview/1010889182 https://inria.hal.science/hal-00788219 |
| Volume | 72 |
| WOSCitedRecordID | wos000299139000015&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: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9owELYo3cNe9nta90veNO2lypTEGDt7QxNVNyE6aVTiLXISp4BCoAwQ3d-xP3h3sR0oU6vuYS8RCrYT8X3cXeK77wj5oLOUqZxxDwyk8lqsxT0ZSe5Fqc79doL6I62q2YTo9-VwGH1vNH67Wph1IcpSbjbR_L9CDecAbCyd_Qe460XhBHwG0OEIsMPxTsCfgRGYjn9VVeZ7VQELXYyNLvcVbhKMMBVmBgtpzINFEfCi0IUVd65S5TqoOL4Zm_LGY1VczBbj5WhqdJ1HemVlnm-IcOsVcXSGCr3YXEtXdXTz1dI5zSp9UZXlrPIH3Snc70rXiR8_1MpkPIPFrquKBosrfEUzNRbTiKPULy8wC6ROBDE2DhVSBTMVnc4gi3CHeOGudTUdeKyjDk0LqL98gHkdMfk0mWep0WhFmVafbT2e2-Xvn8Un571ePOgOBx_nlx72IsM9e9uY5YAchoJHskkOO1-7w2_17lTAjYd3N2-LsUze4P5lbwp4DkaYebsXAFRRzeAReWDBoh1Do8ekocsn5KFr9UGt5X9KLresojusooAs3WEVnZX0Gquo4wC1rPpMr3GKbjlVrbXl1DNyftIdfDn1bLcOL2VtsfRY4osk8kMdikC1M65aEVM8ylORKgAu0WHkc9ylZjKViidai7ytgjCRMlPgZdlz0ixnpX5BaMBzluRS-YESrQy-hYlKZ6HQmcqSNDgigftJ49RK2WNHlSJ2OYuTGGGIEQZ4xkUB3CNyXM-ZGyGXW0dzh1RsQ1ETYsbAslvnvQdY6wugdvtppxfjOQzGJcQHa7j9dw71GIw57tCpChNcFdMO4Zn_5R3GvCL3t_-p16S5XKz0G3IvXS_HPxdvLWn_AA6MynY |
| 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=Optimizing+performance+and+reliability+on+heterogeneous+parallel+systems%3A+Approximation+algorithms+and+heuristics&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Jeannot%2C+Emmanuel&rft.au=Saule%2C+Erik&rft.au=Trystram%2C+Denis&rft.date=2012-02-01&rft.issn=0743-7315&rft.volume=72&rft.issue=2&rft.spage=268&rft.epage=280&rft_id=info:doi/10.1016%2Fj.jpdc.2011.11.003&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |