메뉴 건너뛰기




Volumn , Issue , 2012, Pages 237-250

All about Eve: Execute-verify replication for multi-core servers

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SPECIFIC; CONCURRENCY BUGS; MULTI-CORE SERVERS; ROLL BACK; STATE MACHINE REPLICATION;

EID: 84889665331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (153)

References (50)
  • 1
    • 72249094336 scopus 로고    scopus 로고
    • ODR: Output-deterministic replay for multicore debugging
    • G. Altekar and I. Stoica. ODR: output-deterministic replay for multicore debugging. In SOSP, 2009.
    • (2009) SOSP
    • Altekar, G.1    Stoica, I.2
  • 2
    • 80051876614 scopus 로고    scopus 로고
    • Efficient system-enforced deterministic parallelism
    • A. Aviram, S.-C. Weng, S. Hu, and B. Ford. Efficient system-enforced deterministic parallelism. In OSDI, 2010.
    • (2010) OSDI
    • Aviram, A.1    Weng, S.-C.2    Hu, S.3    Ford, B.4
  • 6
    • 1542328400 scopus 로고
    • Primary-backup protocols: Lower bounds and optimal implementations
    • N. Budhiraja, K. Marzullo, F. B. Schneider, and S. Toueg. Primary-backup protocols: Lower bounds and optimal implementations. In CDCCA, 1992.
    • (1992) CDCCA
    • Budhiraja, N.1    Marzullo, K.2    Schneider, F.B.3    Toueg, S.4
  • 7
    • 0345757358 scopus 로고    scopus 로고
    • Practical Byzantine fault tolerance and proactive recovery
    • M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 2002.
    • (2002) ACM Trans. Comput. Syst.
    • Castro, M.1    Liskov, B.2
  • 8
    • 84889649428 scopus 로고    scopus 로고
    • PhD thesis, The University of Texas at Austin, Dec
    • A. Clement. UpRight Fault Tolerance. PhD thesis, The University of Texas at Austin, Dec. 2010.
    • (2010) UpRight Fault Tolerance
    • Clement, A.1
  • 10
    • 74049138884 scopus 로고    scopus 로고
    • Making Byzantine fault tolerant systems tolerate Byzantine faults
    • A. Clement, M. Marchetti, E. Wong, L. Alvisi, and M. Dahlin. Making Byzantine fault tolerant systems tolerate Byzantine faults. In NSDI, 2009.
    • (2009) NSDI
    • Clement, A.1    Marchetti, M.2    Wong, E.3    Alvisi, L.4    Dahlin, M.5
  • 11
    • 85009705400 scopus 로고    scopus 로고
    • HQ replication: A hybrid quorum protocol for Byzantine fault tolerance
    • J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In OSDI, 2006.
    • (2006) OSDI
    • Cowling, J.1    Myers, D.2    Liskov, B.3    Rodrigues, R.4    Shrira, L.5
  • 12
    • 82655162762 scopus 로고    scopus 로고
    • Efficient deterministic multithreading through schedule relaxation
    • H. Cui, J. Wu, J. Gallagher, H. Guo, and J. Yang. Efficient deterministic multithreading through schedule relaxation. In SOSP, 2011.
    • (2011) SOSP
    • Cui, H.1    Wu, J.2    Gallagher, J.3    Guo, H.4    Yang, J.5
  • 14
    • 67650035136 scopus 로고    scopus 로고
    • DMP: Deterministic shared memory multiprocessing
    • J. Devietti, B. Lucia, L. Ceze, and M. Oskin. DMP: deterministic shared memory multiprocessing. In ASPLOS, 2009.
    • (2009) ASPLOS
    • Devietti, J.1    Lucia, B.2    Ceze, L.3    Oskin, M.4
  • 16
    • 77952406152 scopus 로고    scopus 로고
    • Execution replay for multiprocessor virtual machines
    • G. Dunlap, D. Lucchetti, M. Fetterman, and P. Chen. Execution replay for multiprocessor virtual machines. In VEE, 2008.
    • (2008) VEE
    • Dunlap, G.1    Lucchetti, D.2    Fetterman, M.3    Chen, P.4
  • 18
    • 77956599886 scopus 로고    scopus 로고
    • A study of the internal and external effects of concurrency bugs
    • P. Fonseca, C. Li, V. Singhal, and R. Rodrigues. A study of the internal and external effects of concurrency bugs. In DSN, 2010.
    • (2010) DSN
    • Fonseca, P.1    Li, C.2    Singhal, V.3    Rodrigues, R.4
  • 20
    • 79955896214 scopus 로고    scopus 로고
    • Calvin: Deterministic or not? Free will to choose
    • D. Hower, P. Dudnik, M. Hill, and D. Wood. Calvin: Deterministic or not? Free will to choose. In HPCA, 2011.
    • (2011) HPCA
    • Hower, D.1    Dudnik, P.2    Hill, M.3    Wood, D.4
  • 21
    • 79951761350 scopus 로고    scopus 로고
    • Zookeeper: Wait-free coordination for internet-scale systems
    • P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. Zookeeper: wait-free coordination for internet-scale systems. In USENIX, 2010.
    • (2010) USENIX
    • Hunt, P.1    Konar, M.2    Junqueira, F.P.3    Reed, B.4
  • 25
    • 4544373717 scopus 로고    scopus 로고
    • High throughput Byzantine fault tolerance
    • R. Kotla and M. Dahlin. High throughput Byzantine fault tolerance. In DSN, 2004.
    • (2004) DSN
    • Kotla, R.1    Dahlin, M.2
  • 26
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. CACM, 1978.
    • (1978) CACM
    • Lamport, L.1
  • 28
  • 29
    • 82655165279 scopus 로고    scopus 로고
    • Detecting failures in distributed systems with the Falcon spy network
    • J. B. Leners, H. Wu, W.-L. Hung, M. K. Aguilera, and M. Walfish. Detecting failures in distributed systems with the Falcon spy network. In SOSP, 2011.
    • (2011) SOSP
    • Leners, J.B.1    Wu, H.2    Hung, W.-L.3    Aguilera, M.K.4    Walfish, M.5
  • 30
    • 82655162766 scopus 로고    scopus 로고
    • DThreads: Efficient deterministic multithreading
    • T. Liu, C. Curtsinger, and E. D. Berger. Dthreads: efficient deterministic multithreading. In SOSP, 2011.
    • (2011) SOSP
    • Liu, T.1    Curtsinger, C.2    Berger, E.D.3
  • 31
    • 78649472522 scopus 로고    scopus 로고
    • Mencius: Building efficient replicated state machines for WANs
    • Y. Mao, F. P. Junqueira, and K. Marzullo. Mencius: building efficient replicated state machines for WANs. In OSDI, 2008.
    • (2008) OSDI
    • Mao, Y.1    Junqueira, F.P.2    Marzullo, K.3
  • 32
    • 52649147142 scopus 로고    scopus 로고
    • Delorean: Recording and deterministically replaying shared-memory multiprocessor execution efficiently
    • J. T. Pablo Montesinos, Luis Ceze. Delorean: Recording and deterministically replaying shared-memory multiprocessor execution efficiently. In ISCA, 2008.
    • (2008) ISCA
    • Pablo Montesinos, J.T.1    Ceze, L.2
  • 33
    • 72249098984 scopus 로고    scopus 로고
    • PRES: Probabilistic replay with execution sketching on multiprocessor
    • S. Park, Y. Zhou, W. Xiong, Z. Yin, R. Kaushik, K. H. Lee, and S. Lu. PRES: probabilistic replay with execution sketching on multiprocessor. In SOSP, 2009.
    • (2009) SOSP
    • Park, S.1    Zhou, Y.2    Xiong, W.3    Yin, Z.4    Kaushik, R.5    Lee, K.H.6    Lu, S.7
  • 35
    • 85076780225 scopus 로고    scopus 로고
    • Browsershield: Vulnerability-driven filtering of dynamic HTML
    • C. Reis, J. Dunagan, H. Wang, O. Dubrovsky, and S. Esmeir. BrowserShield: Vulnerability-driven filtering of dynamic HTML. In OSDI, 2006.
    • (2006) OSDI
    • Reis, C.1    Dunagan, J.2    Wang, H.3    Dubrovsky, O.4    Esmeir, S.5
  • 36
    • 0038562599 scopus 로고    scopus 로고
    • BASE: Using abstraction to improve fault tolerance
    • R. Rodrigues, M. Castro, and B. Liskov. BASE: using abstraction to improve fault tolerance. In SOSP, 2001.
    • (2001) SOSP
    • Rodrigues, R.1    Castro, M.2    Liskov, B.3
  • 37
    • 67650073654 scopus 로고    scopus 로고
    • RecPlay: A fully integrated practical record/replay system
    • M. Ronsse and K. De Bosschere. RecPlay: a fully integrated practical record/replay system. ACM TCS, 1999.
    • (1999) ACM TCS
    • Ronsse, M.1    De Bosschere, K.2
  • 38
    • 0025564050 scopus 로고
    • Implementing fault-tolerant services using the state machine approach: A tutorial
    • F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, 1990.
    • (1990) ACM Computing Surveys
    • Schneider, F.B.1
  • 41
    • 79959981273 scopus 로고    scopus 로고
    • The case for determinism in database systems
    • A. Thomson and D. J. Abadi. The case for determinism in database systems. VLDB, 2010.
    • (2010) VLDB
    • Thomson, A.1    Abadi, D.J.2
  • 43
    • 85080688862 scopus 로고    scopus 로고
    • Transaction Processing Performance Council. The TPC-W home page. http://www.tpc.org/tpcw.
    • The TPC-W Home Page
  • 44
  • 45
    • 70449894288 scopus 로고    scopus 로고
    • Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling
    • B. Vandiver, H. Balakrishnan, B. Liskov, and S. Madden. Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling. In SOSP, 2007.
    • (2007) SOSP
    • Vandiver, B.1    Balakrishnan, H.2    Liskov, B.3    Madden, S.4
  • 48
    • 0038684791 scopus 로고    scopus 로고
    • A “flight data recorder” for enabling full-system multiprocessor deterministic replay
    • M. Xu, R. Bodik, and M. D. Hill. A “flight data recorder” for enabling full-system multiprocessor deterministic replay. In ISCA, 2003.
    • (2003) ISCA
    • Xu, M.1    Bodik, R.2    Hill, M.D.3
  • 49
    • 52649086050 scopus 로고    scopus 로고
    • Retrace: Collecting execution trace with virtual machine deterministic replay
    • M. Xu, V. Malyugin, J. Sheldon, G. Venkitachalam, and B. Weiss-man. Retrace: Collecting execution trace with virtual machine deterministic replay. In MOBS, 2007.
    • (2007) MOBS
    • Xu, M.1    Malyugin, V.2    Sheldon, J.3    Venkitachalam, G.4    Weiss-Man, B.5
  • 50
    • 33845575341 scopus 로고    scopus 로고
    • Separating agreement from execution for Byzantine fault tolerant services
    • J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In SOSP, 2003.
    • (2003) SOSP
    • Yin, J.1    Martin, J.-P.2    Venkataramani, A.3    Alvisi, L.4    Dahlin, M.5


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