메뉴 건너뛰기




Volumn 15, Issue 5, 2012, Pages 615-627

Reliability of task graph schedules with transient and fail-stop failures: Complexity and algorithms

Author keywords

Algorithms; Complexity results; Fail stop and transient failures; Reliability; Task graph schedules

Indexed keywords

COMPLEXITY RESULTS; EVALUATION COST; FAIL-STOP FAILURES; RELIABILITY PROBLEMS; TASK GRAPH;

EID: 84870530759     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-011-0236-y     Document Type: Article
Times cited : (21)

References (19)
  • 1
    • 0029702179 scopus 로고    scopus 로고
    • Making commitments in the face of uncertainty: How to pick a winner almost every time
    • 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-530).
    • (1996) 28th ACM SToC , pp. 519-530
    • Awerbuch, B.1    Azar, Y.2    Fiat, A.3    Leighton, F.T.4
  • 2
    • 0020933196 scopus 로고
    • Task allocation in fault-tolerant distributed systems
    • Bannister, J., & Trivedi, K. S. (1983). Task allocation in fault-tolerant distributed systems. Acta Informatica, 20, 261-281. (Pubitemid 14531850)
    • (1983) Acta Informatica , vol.20 , Issue.3 , pp. 261-281
    • Bannister Joseph, A.1    Trivedi Kishor, S.2
  • 6
    • 84884473022 scopus 로고
    • Reliability block diagrams and reliability modeling (Tech. rep.)
    • NASA Lewis Research Center
    • Bream, B. (1995) Reliability block diagrams and reliability modeling (Tech. rep.), Office of safety and mission assurance, NASA Lewis Research Center.
    • (1995) Office of Safety and Mission Assurance
    • Bream, B.1
  • 10
    • 70450275855 scopus 로고    scopus 로고
    • A novel bicriteria scheduling heuristic providing a guaranteed global system failure rate
    • 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-254.
    • (2009) IEEE Transactions on Dependable and Secure Computing , vol.6 , Issue.4 , pp. 241-254
    • Girault, A.1    Kalla, H.2
  • 13
    • 0000412757 scopus 로고    scopus 로고
    • Task allocation algorithms for maximizing reliability of distributed computing systems
    • Kartik, S., & Murthy, C. S. R. (1997). Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Transactions on Computers, 46(6), 719-724. (Pubitemid 127760960)
    • (1997) IEEE Transactions on Computers , vol.46 , Issue.6 , pp. 719-724
    • Kartik, S.1    Ram Murthy, C.S.2
  • 14
    • 0000166629 scopus 로고
    • The complexity of counting cuts and of computing the probability that a graph is connected
    • 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-788.
    • (1983) SIAM Journal on Computing , vol.12 , Issue.4 , pp. 777-788
    • Provan, J.S.1    Ball, M.O.2
  • 15
    • 0036473042 scopus 로고    scopus 로고
    • Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload
    • DOI 10.1109/71.983945
    • 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-191. (Pubitemid 34198222)
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.2 , pp. 179-191
    • Rosenberg, A.L.1
  • 16
    • 0024645634 scopus 로고
    • Models and algorithms for reliabilityoriented task-allocation in redundant distributed-computer systems
    • Shatz, S., & Wang, J. (1989). Models and algorithms for reliabilityoriented task-allocation in redundant distributed-computer systems. IEEE Transactions on Reliability, 38(1), 16-26.
    • (1989) IEEE Transactions on Reliability , vol.38 , Issue.1 , pp. 16-26
    • Shatz, S.1    Wang, J.2
  • 17
    • 0026923304 scopus 로고
    • Task allocation for maximizing reliability of distributed computer systems
    • DOI 10.1109/12.165396
    • Shatz, S.,Wang, J., & Goto,M. (1992). Task allocation for maximizing reliability of distributed computer systems. IEEE Transactions on Computers, 41(9), 1156-1168. (Pubitemid 23573771)
    • (1992) IEEE Transactions on Computers , vol.41 , Issue.9 , pp. 1156-1168
    • Shatz Sol, M.1    Wang Jia-Ping2    Goto Masanori3
  • 18
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410-421.
    • (1979) SIAM Journal on Computing , vol.8 , Issue.3 , pp. 410-421
    • Valiant, L.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.