{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:00:22Z","timestamp":1761807622157},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T00:00:00Z","timestamp":1305849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10951-011-0236-y","type":"journal-article","created":{"date-parts":[[2011,5,19]],"date-time":"2011-05-19T20:22:18Z","timestamp":1305836538000},"page":"615-627","source":"Crossref","is-referenced-by-count":21,"title":["Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms"],"prefix":"10.1007","volume":"15","author":[{"given":"Anne","family":"Benoit","sequence":"first","affiliation":[]},{"given":"Louis-Claude","family":"Canon","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Jeannot","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,20]]},"reference":[{"key":"236_CR1","first-page":"519","volume-title":"28th ACM SToC","author":"B. Awerbuch","year":"1996","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., & Leighton, F. T. (1996). Making commitments in the face of uncertainty: How to pick a winner almost every time. In 28th ACM SToC (pp. 519\u2013530)."},{"key":"236_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01257086","volume":"20","author":"J. Bannister","year":"1983","unstructured":"Bannister, J., & Trivedi, K. S. (1983). Task allocation in fault-tolerant distributed systems. Acta Informatica, 20, 261\u2013281.","journal-title":"Acta Informatica"},{"key":"236_CR3","volume-title":"Mathematical theory of reliability","author":"R. E. Barlow","year":"1967","unstructured":"Barlow, R. E., & Proschan, F. (1967). Mathematical theory of reliability. New York: Wiley."},{"issue":"5","key":"236_CR4","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/12.589220","volume":"46","author":"S. Bhatt","year":"1997","unstructured":"Bhatt, S., Chung, F., Leighton, F., & Rosenberg, A. (1997). On optimal strategies for cycle-stealing in networks of workstations. IEEE Transactions on Computers, 46(5), 545\u2013557.","journal-title":"IEEE Transactions on Computers"},{"key":"236_CR5","first-page":"1971","volume":"47","author":"H. L. Bodlaender","year":"2004","unstructured":"Bodlaender, H. L., & Wolle, T. (2004). A note on the complexity of network reliability problems. IEEE Transactions on Information Theory, 47, 1971\u20131988.","journal-title":"IEEE Transactions on Information Theory"},{"key":"236_CR6","unstructured":"Bream, B. (1995) Reliability block diagrams and reliability modeling (Tech. rep.), Office of safety and mission assurance, NASA Lewis Research Center."},{"key":"236_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms. Berlin: Springer."},{"issue":"4","key":"236_CR8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1177\/1094342009347767","volume":"23","author":"F. Cappello","year":"2009","unstructured":"Cappello, F., Geist, A., Gropp, B., Kale, L., Kramer, B., & Snir, M. (2009). Toward exascale resilience. The International Journal of High Performance Computing Applications, 23(4), 374\u2013388.","journal-title":"The International Journal of High Performance Computing Applications"},{"key":"236_CR9","volume-title":"19th ACM symp. on parallelism in algo. and archi. (SPAA\u201907)","author":"J. Dongarra","year":"2007","unstructured":"Dongarra, J., Jeannot, E., Saule, E., & Shi, Z. (2007). Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In: 19th ACM symp. on parallelism in algo. and archi. (SPAA\u201907), San Diego, CA, USA."},{"issue":"4","key":"236_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TDSC.2008.50","volume":"6","author":"A. Girault","year":"2009","unstructured":"Girault, A., & Kalla, H. (2009). A novel bicriteria scheduling heuristic providing a guaranteed global system failure rate. IEEE Transactions on Dependable and Secure Computing, 6(4), 241\u2013254.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"3","key":"236_CR11","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.jpdc.2008.11.002","volume":"69","author":"A. Girault","year":"2009","unstructured":"Girault, A., Saule, E., & Trystram, D. (2009). Reliability versus performance for critical applications. Journal of Parallel and Distributed Computing, 69(3), 326\u2013336.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"236_CR12","volume-title":"The 14th int. Euro-par conf. on parallel and distributed computing","author":"E. Jeannot","year":"2008","unstructured":"Jeannot, E., Saule, E., & Trystram, D. (2008). Bi-objective approximation scheme for makespan and reliability optimization on uniform parallel machines. In: The 14th int. Euro-par conf. on parallel and distributed computing, Spain."},{"issue":"6","key":"236_CR13","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1109\/12.600888","volume":"46","author":"S. Kartik","year":"1997","unstructured":"Kartik, S., & Murthy, C. S. R. (1997). Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Transactions on Computers, 46(6), 719\u2013724.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"236_CR14","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. S. Provan","year":"1983","unstructured":"Provan, J. S., & Ball, M. O. (1983). The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, 12(4), 777\u2013788.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"236_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/71.983945","volume":"13","author":"A. L. Rosenberg","year":"2002","unstructured":"Rosenberg, A. L. (2002). Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload. IEEE Transactions on Parallel and Distributed Systems, 13(2), 179\u2013191.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"236_CR16","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/24.24570","volume":"38","author":"S. Shatz","year":"1989","unstructured":"Shatz, S., & Wang, J. (1989). Models and algorithms for reliability-oriented task-allocation in redundant distributed-computer systems. IEEE Transactions on Reliability, 38(1), 16\u201326.","journal-title":"IEEE Transactions on Reliability"},{"issue":"9","key":"236_CR17","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1109\/12.165396","volume":"41","author":"S. Shatz","year":"1992","unstructured":"Shatz, S., Wang, J., & Goto, M. (1992). Task allocation for maximizing reliability of distributed computer systems. IEEE Transactions on Computers, 41(9), 1156\u20131168.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"236_CR18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"236_CR19","first-page":"35","volume-title":"International conference on computer aided design, ICCAD\u201904","author":"D. Zhu","year":"2004","unstructured":"Zhu, D., Melhem, R., & Moss\u00e9, D. (2004). The effects of energy management on reliability in real-time embedded systems. In: International conference on computer aided design, ICCAD\u201904, San Jose (CA), USA, pp.\u00a035\u201340."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0236-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0236-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0236-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0236-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,20]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0236-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,20]]}}}