메뉴 건너뛰기




Volumn 69, Issue 3, 2009, Pages 326-336

Reliability versus performance for critical applications

Author keywords

Multi objective optimization; Multi processor scheduling; Reliability

Indexed keywords

APPLICATIONS; GRAPH THEORY; MULTIOBJECTIVE OPTIMIZATION; MULTIPROCESSING SYSTEMS; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING;

EID: 59149105005     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2008.11.002     Document Type: Article
Times cited : (44)

References (43)
  • 2
    • 13844309914 scopus 로고    scopus 로고
    • Approximation results for a bicriteria job scheduling problem on a single machine without preemption
    • Angel E., Bampis E., and Gourvès L. Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Information Processing Letters 94 1 (2005) 19-27
    • (2005) Information Processing Letters , vol.94 , Issue.1 , pp. 19-27
    • Angel, E.1    Bampis, E.2    Gourvès, L.3
  • 3
    • 84874111301 scopus 로고    scopus 로고
    • E. Angel, E. Bampis, A. Kononov, A FPTAS for approximating the unrelated parallel machines scheduling problem with costs, in: Proceeding of European Symposium on Algorithms, ESA, 2001, pp. 194-205
    • E. Angel, E. Bampis, A. Kononov, A FPTAS for approximating the unrelated parallel machines scheduling problem with costs, in: Proceeding of European Symposium on Algorithms, ESA, 2001, pp. 194-205
  • 4
    • 4544236082 scopus 로고    scopus 로고
    • I. Assayad, A. Girault, H. Kalla, A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints, in: 2004 International Conference on Dependable Systems and Networks, DSN'04, 2004, pp. 347-356
    • I. Assayad, A. Girault, H. Kalla, A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints, in: 2004 International Conference on Dependable Systems and Networks, DSN'04, 2004, pp. 347-356
  • 5
    • 59149095433 scopus 로고    scopus 로고
    • B. Cirou, E. Jeannot, Triplet: A clustering scheduling algorithm for heterogeneous platforms, Technical Report RT-0248, INRIA, Febuary 2001
    • B. Cirou, E. Jeannot, Triplet: A clustering scheduling algorithm for heterogeneous platforms, Technical Report RT-0248, INRIA, Febuary 2001
  • 6
    • 0033733125 scopus 로고    scopus 로고
    • Worst case execution time analysis for a processor with branch prediction
    • Colin A., and Puaut I. Worst case execution time analysis for a processor with branch prediction. Real-Time Systems 18 2-3 (2000) 249-274
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 249-274
    • Colin, A.1    Puaut, I.2
  • 7
    • 59149094586 scopus 로고    scopus 로고
    • T. Davidovic, L. Liberti, N. Maculan, N. Mladenovic, Mathematical programming-based approach to scheduling of communicating tasks, Technical Report, LIX, December 2004
    • T. Davidovic, L. Liberti, N. Maculan, N. Mladenovic, Mathematical programming-based approach to scheduling of communicating tasks, Technical Report, LIX, December 2004
  • 8
    • 0036504529 scopus 로고    scopus 로고
    • Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing
    • Dogan A., and Özguner F. Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13 3 (2002) 308-324
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 308-324
    • Dogan, A.1    Özguner, F.2
  • 9
    • 18844448006 scopus 로고    scopus 로고
    • Biobjective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems
    • Dogan A., and Özgüner F. Biobjective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems. The Computer Journal 48 3 (2005) 300-314
    • (2005) The Computer Journal , vol.48 , Issue.3 , pp. 300-314
    • Dogan, A.1    Özgüner, F.2
  • 11
    • 84947261898 scopus 로고    scopus 로고
    • Reliable and precise WCET determination for a real-life processor
    • International Workshop on Embedded Software. EMSOFT'01, Springer-Verlag, Tahoe City, CA, USA
    • Ferdinand C., Heckmann R., Langenbach M., Martin F., Schmidt M., Theiling H., Thesing S., and Wilhelm R. Reliable and precise WCET determination for a real-life processor. International Workshop on Embedded Software. EMSOFT'01. LNCS vol. 2211 (2001), Springer-Verlag, Tahoe City, CA, USA
    • (2001) LNCS , vol.2211
    • Ferdinand, C.1    Heckmann, R.2    Langenbach, M.3    Martin, F.4    Schmidt, M.5    Theiling, H.6    Thesing, S.7    Wilhelm, R.8
  • 12
    • 84990317145 scopus 로고    scopus 로고
    • Assessment of large automatically generated fault trees by means of binary decision diagrams
    • Gauthier J., Leduc X., and Rauzy A. Assessment of large automatically generated fault trees by means of binary decision diagrams. Journal of Risk and Reliability 221 2 (2007) 95-105
    • (2007) Journal of Risk and Reliability , vol.221 , Issue.2 , pp. 95-105
    • Gauthier, J.1    Leduc, X.2    Rauzy, A.3
  • 13
    • 70450275855 scopus 로고    scopus 로고
    • A. Girault, H. Kalla, A novel bicriteria scheduling heuristics providing a guaranteed global system failure rate, IEEE Transactions on Dependable and Secure Computing, in press (doi:10.1109/TDSC.2008.50). INRIA research report 6319. http://hal.inria.fr/inria-00177117
    • A. Girault, H. Kalla, A novel bicriteria scheduling heuristics providing a guaranteed global system failure rate, IEEE Transactions on Dependable and Secure Computing, in press (doi:10.1109/TDSC.2008.50). INRIA research report 6319. http://hal.inria.fr/inria-00177117
  • 15
    • 0002552417 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling
    • Hochbaum D.S. (Ed), PWS Publishing Company, Boston, MA 02116, USA
    • Hall L.A. Approximation algorithms for scheduling. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Company, Boston, MA 02116, USA 1-45
    • (1997) Approximation Algorithms for NP-hard Problems , pp. 1-45
    • Hall, L.A.1
  • 16
    • 84958752836 scopus 로고    scopus 로고
    • Reliability and performability modeling using Sharpe
    • International Conference on Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS'00, Springer-Verlag
    • Hirel C., Sahner R., Zang X., and Trivedi K.S. Reliability and performability modeling using Sharpe. International Conference on Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS'00. LNCS vol. 1786 (2000), Springer-Verlag 345-349
    • (2000) LNCS , vol.1786 , pp. 345-349
    • Hirel, C.1    Sahner, R.2    Zang, X.3    Trivedi, K.S.4
  • 17
    • 59149101776 scopus 로고    scopus 로고
    • K. Ho, Dual criteria optimization problems for imprecise computation tasks, In Leung [24] (chapter 35)
    • K. Ho, Dual criteria optimization problems for imprecise computation tasks, In Leung [24] (chapter 35)
  • 18
    • 0000769475 scopus 로고
    • Heuristic algorithms for scheduling independent tasks on nonidentical processors
    • Ibarra O.H., and Kim C.E. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the Association for Computing Machinery 24 2 (1977) 280-289
    • (1977) Journal of the Association for Computing Machinery , vol.24 , Issue.2 , pp. 280-289
    • Ibarra, O.H.1    Kim, C.E.2
  • 20
    • 59149083537 scopus 로고    scopus 로고
    • H. Kalla, Génération automatique de distributions/ordonnancements temps réel, fiables et tolérants aux fautes, Ph.D. Thesis, INPG, December 2004
    • H. Kalla, Génération automatique de distributions/ordonnancements temps réel, fiables et tolérants aux fautes, Ph.D. Thesis, INPG, December 2004
  • 21
    • 0000412757 scopus 로고    scopus 로고
    • Task allocation algorithms for maximizing reliability of distributed computing systems
    • Kartik S., and Murthy C.S.R. Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Transaction on Computers 46 6 (1997) 719-724
    • (1997) IEEE Transaction on Computers , vol.46 , Issue.6 , pp. 719-724
    • Kartik, S.1    Murthy, C.S.R.2
  • 22
    • 59149087808 scopus 로고    scopus 로고
    • V. Kianzad, S. Bhattacharyya, A comparison of clustering and scheduling techniques for embedded multi-processor systems, Technical Report, Institute for Advanced Computer Studies, December 2003
    • V. Kianzad, S. Bhattacharyya, A comparison of clustering and scheduling techniques for embedded multi-processor systems, Technical Report, Institute for Advanced Computer Studies, December 2003
  • 23
    • 0031700698 scopus 로고    scopus 로고
    • Benchmarking the task graph scheduling algorithms.
    • Kwok Y.-K., and Ahmad I. Benchmarking the task graph scheduling algorithms. IPPS/SPDP (1998) 531-537
    • (1998) IPPS/SPDP , pp. 531-537
    • Kwok, Y.-K.1    Ahmad, I.2
  • 24
    • 85055840680 scopus 로고    scopus 로고
    • Leung J.Y.-T. (Ed), CRC Press, Boca Raton, FL, USA
    • In: Leung J.Y.-T. (Ed). Handbook of Scheduling (2004), CRC Press, Boca Raton, FL, USA
    • (2004) Handbook of Scheduling
  • 27
    • 0034503926 scopus 로고    scopus 로고
    • C. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proc. of the 41st Annual Symposium on Foundations of Computer Science, FOCS, 2000, pp. 86-92
    • C. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proc. of the 41st Annual Symposium on Foundations of Computer Science, FOCS, 2000, pp. 86-92
  • 28
    • 38949167056 scopus 로고    scopus 로고
    • Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems
    • ACM, Salzburg, Austria
    • Pop P., Poulsen K., and Izosimov V. Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems. CODES-ISSS'07 (2007), ACM, Salzburg, Austria
    • (2007) CODES-ISSS'07
    • Pop, P.1    Poulsen, K.2    Izosimov, V.3
  • 29
    • 0024132223 scopus 로고
    • The Delta-4 approach to dependability in open distributed systems
    • IEEE, Tokyo, Japan
    • Powell D., et al. The Delta-4 approach to dependability in open distributed systems. International Symposium on Fault-Tolerant Computing, FTCS-18 (1988), IEEE, Tokyo, Japan 246-251
    • (1988) International Symposium on Fault-Tolerant Computing, FTCS-18 , pp. 246-251
    • Powell, D.1
  • 30
    • 0013225410 scopus 로고    scopus 로고
    • A review of worst-case execution-time analysis
    • Puschner P., and Burns A. A review of worst-case execution-time analysis. Real-Time Systems 18 2-3 (2000) 115-128
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 115-128
    • Puschner, P.1    Burns, A.2
  • 31
    • 84948470299 scopus 로고    scopus 로고
    • An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems
    • ICPP'02, Vancouver, Canada
    • Qin X., Jiang H., and Swanson D.R. An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. International Conference on Parallel Processing. ICPP'02 (2002), Vancouver, Canada 360-386
    • (2002) International Conference on Parallel Processing , pp. 360-386
    • Qin, X.1    Jiang, H.2    Swanson, D.R.3
  • 32
    • 84867433583 scopus 로고
    • Scheduling parallel program assuming preallocation
    • Lenstra J.K., Chretienne P., Coffman E.G., and Liu Z. (Eds), Wiley
    • Rayward-Smith V., Burton F.N., and Janacek G.J. Scheduling parallel program assuming preallocation. In: Lenstra J.K., Chretienne P., Coffman E.G., and Liu Z. (Eds). Scheduling Theory and its Applications (1995), Wiley 146-165
    • (1995) Scheduling Theory and its Applications , pp. 146-165
    • Rayward-Smith, V.1    Burton, F.N.2    Janacek, G.J.3
  • 33
    • 0025564050 scopus 로고
    • Implementing fault-tolerant services using the state machine approach: A tutorial
    • Schneider F.B. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22 4 (1990) 299-319
    • (1990) ACM Computing Surveys , vol.22 , Issue.4 , pp. 299-319
    • Schneider, F.B.1
  • 34
    • 0026923304 scopus 로고
    • Task allocation for maximizing reliability of distributed computer systems
    • Shatz S., and Wang J.P. Task allocation for maximizing reliability of distributed computer systems. IEEE Transactions on Computers 41 9 (1992) 1156-1169
    • (1992) IEEE Transactions on Computers , vol.41 , Issue.9 , pp. 1156-1169
    • Shatz, S.1    Wang, J.P.2
  • 36
    • 0027542932 scopus 로고
    • A compile-time scheduling heuristic for interconnection-constraint heterogeneous processor architectures
    • Sih G.C., and Lee E.A. A compile-time scheduling heuristic for interconnection-constraint heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems 4 (1993) 175-187
    • (1993) IEEE Transactions on Parallel and Distributed Systems , vol.4 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 37
    • 59149091172 scopus 로고    scopus 로고
    • J. Souyris, E.L. Pavec, G. Himbert, V. Jégu, G. Borios, R. Heckmann, Computing the worst case execution time of an avionics program by abstract interpretation, in: International Workshop on Worst-case Execution Time, WCET'05, Mallorca, Spain, 2005, pp. 21-24
    • J. Souyris, E.L. Pavec, G. Himbert, V. Jégu, G. Borios, R. Heckmann, Computing the worst case execution time of an avionics program by abstract interpretation, in: International Workshop on Worst-case Execution Time, WCET'05, Mallorca, Spain, 2005, pp. 21-24
  • 39
    • 0033750056 scopus 로고    scopus 로고
    • Fast and precise WCET prediction by separate cache and path analyses
    • Theiling H., Ferdinand C., and Wilhelm R. Fast and precise WCET prediction by separate cache and path analyses. Real-Time Systems 18 2-3 (2000) 157-179
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 157-179
    • Theiling, H.1    Ferdinand, C.2    Wilhelm, R.3
  • 41
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous scheduling
    • Topcuoglu H. Performance-effective and low-complexity task scheduling for heterogeneous scheduling. IEEE Transactions on Parallel and Distributed Systems 13 3 (2002) 260-274
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1
  • 42
    • 0037211594 scopus 로고    scopus 로고
    • Characterization of Pareto dominance
    • Voorneveld M. Characterization of Pareto dominance. Operations Research Letters 31 1 (2003) 7-11
    • (2003) Operations Research Letters , vol.31 , Issue.1 , pp. 7-11
    • Voorneveld, M.1
  • 43
    • 35048856562 scopus 로고    scopus 로고
    • An experimental investigation into the rand function of the heterogeneous earliest finish time scheduling algorithm
    • Proc. of EuroPar 03
    • Zhao H., and Sakellariou R. An experimental investigation into the rand function of the heterogeneous earliest finish time scheduling algorithm. Proc. of EuroPar 03. LNCS vol. 2790 (2003) 189-194
    • (2003) LNCS , vol.2790 , pp. 189-194
    • Zhao, H.1    Sakellariou, R.2


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