Improving server applications with system transactions

EuroSys'12 - Proceedings of the EuroSys 2012 Conference

Volumn , Issue , 2012, Pages 15-28

  Kim, Sangman ^a   Lee, Michael Z ^a   Dunn, Alan M ^a   Hofmann, Owen S ^a   Wang, Xuan ^b   Witchel, Emmett ^a   Porter, Donald E ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

System transactions

Indexed keywords

APPLICATION CODES; BYZANTINE FAULT; E-MAIL SERVERS; HIGH-THROUGHPUT; SERVER APPLICATIONS; SYSTEM TRANSACTIONS;

SEMANTICS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 84860599572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2168836.2168839     Document Type: Conference Paper

References (50)

1. Dovecot mailbox format - maildir. http://wiki.dovecot.org/MailboxFormat/ Maildir. §1, §4.1, §8.2
2. Welcome to the dovecot wiki. http://wiki2.dovecot.org/. §1
3. University of oregon route views project. http://www.routeviews.org/, 2000. §8.1
4. A. Aviram, S.-C. Weng, S. Hu, and B. Ford. Efficient system-enforced deterministic parallelism. In OSDI, pages 1-16, 2010. §3.2
5. T. Bergan, N. Hunt, L. Ceze, and S. D. Gribble. Deterministic process groups in dOS. In OSDI, pages 1-16, 2010. §3.2
6. D. J. Bernstein. Using maildir format (the original specification), 1995. http://cr.yp.to/proto/maildir.html. §1, §4.1, §8.2
7. C. Blundell, E. C. Lewis, and M. M. K. Martin. Deconstructing transactions: The subtleties of atomicity. In WDDD. Jun 2005. §2
8. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. JACM, 32(4):824-840, 1985. §3.1
9. J. Bull, L. Smith, M. Westhead, D. Henty, and R. Davey. A benchmark suite for high performance java. Concurrency - Practice and Experience, 12(6):375-388, 2000. §8.1
10. X. Cai, Y. Gui, and R. Johnson. Exploiting unix file-system races via algorithmic complexity attacks. In Oakland, pages 27-41, 2009. §3
11. M. Castro and B. Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS), 20(4):398-461, Nov. 2002. §9 (Pubitemid 135702591)
12. A. Clement, M. Kapritsos, S. Lee, Y. Wang, L. Alvisi, M. Dahlin, and T. Riché. Upright cluster services. In SOSP, pages 277-290, 2009. §1, §3.1
13. M. Crispin. INTERNET MESSAGE ACCESS PROTOCOL - VERSION 4rev1. RFC 3501 (Proposed Standard), March 2003. Obsoletes by RFC 2060. §1, §4
14. D. Dice, H. Huang, and M. Yang. Asymmetric dekker synchronization, July 2001. http://home.comcast.net/pjbishop/Dave/Asymmetric-Dekker-Synchronization. txt. §7.1
15. Dovecot maildir and racing. http://www.dovecot.org/list/dovecot/2006- March/011811.html. §4.1, §8.2
16. H. Franke, R. Russel, and M. Kirkwood. Fuss, futexes and furwocks: Fast userlevel locking in Linux. In Proceedings of the Ottawa Linux Symposium, 2002. §6.1
17. E. Gal and S. Toledo. A transactional flash file system for microcontrollers. In USENIX, pages 89-104, 2005. §9
18. R. Garcia, R. Rodrigues, and N. Preguiça. Efficient middleware for byzantine fault tolerant database replication. In EuroSys, pages 107-122. ACM, 2011. §3.2, §9
19. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993. §2, §2
20. J. N. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger. Granularity of locks and degrees of consistency in a shared data base. Modeling in Data Base Management Systems, pages 364-394, 1976. §2
21. M. Herlihy and J. E. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA, pages 289-300, 1993. §2 (Pubitemid 23675551)
22. S. Jana, D. E. Porter, and V. Shmatikov. TxBox: Building secure, efcient sandboxes with system transactions. In Oakland, Oakland, CA, May 2011. §5.4
23. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative byzantine fault tolerance. SOSP, pages 45-58, 2007. §3.1, §9 (Pubitemid 351429388)
24. R. Kotla and M. Dahlin. High throughput Byzantine fault tolerance. In DSN, pages 575-584. IEEE, 2003. §3.2, §9
25. L. Lamport. Lower bounds for asynchronous consensus. Distributed Computing, 19(2):104-125, 2006. §3.1 (Pubitemid 44673723)
26. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. TOPLAS, 4(3):382-401, 1982. §3
27. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In SIGKDD, pages 177-187. ACM, 2005. §8.1 (Pubitemid 43218279)
28. M. J. Moravan, J. Bobba, K. E. Moore, L. Yen, M. D. Hill, B. Liblit, M. M. Swift, and D. A. Wood. Supporting nested transactional memory in LogTM. In ASPLOS, pages 359-370, 2006. §9
29. J. Myers. Post Office Protocol - Version 3. RFC 1939 (Standard), May 1996. Obsoletes by RFC 1725. §4
30. E. B. Nightingale, P. M. Chen, and J. Flinn. Speculative execution in a distributed file system. In SOSP, pages 191-205, 2005. §9 (Pubitemid 44892213)
31. E. B. Nightingale, D. Peek, P. M. Chen, and J. Flinn. Parallelizing security checks on commodity hardware. In ASPLOS, pages 308-318, 2008. §9 (Pubitemid 351585416)
32. E. B. Nightingale, K. Veeraraghavan, P. M. Chen, and J. Flinn. Rethink the sync. In OSDI, pages 1-14, 2006. §9
33. D. E. Porter. Operating System Transactions. PhD thesis, The University of Texas at Austin, December 2010. §2
34. D. E. Porter, O. S. Hofmann, C. J. Rossbach, A. Benn, and E. Witchel. Operating systems transactions. In SOSP, pages 161-176. ACM, 2009. §1, §1, §2, §2, §8.2, §9
35. K. Russell and D. Detlefs. Eliminating synchronization-related atomic operations with biased locking and bulk rebiasing. ACM SIGPLAN Notices, 41(10):263-272, 2006. §7.1 (Pubitemid 46726086)
36. M. Russinovich and D. Solomon. Windows Internals. Microsoft Press, 2009. §9
37. F. Schmuck and J. Wylie. Experience with transactions in QuickSilver. In SOSP, pages 239-253. ACM, 1991. §9
38. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv., 22(4):299-319, 1990. §3
39. M. I. Seltzer. Transaction support in a log-structured file system. In IDCE, pages 503-510, 1993. §9
40. M. I. Seltzer, Y. Endo, C. Small, and K. A. Smith. Dealing with disaster: Surviving misbehaved kernel extensions. In OSDI, pages 213-227, 1996. §9
41. N. Shavit and D. Touitou. Software transactional memory. In PODC, pages 204-213, 1995. §2
42. A. Singh, T. Das, P. Maniatis, P. Druschel, and T. Roscoe. BFT protocols under fire. In NSDI, pages 189-204, 2008. §3.2
43. R. Spillane, S. Gaikwad, M. Chinni, E. Zadok, and C. P. Wright. Enabling transactional file access via lightweight kernel extensions. In FAST, pages 29-42, 2009. §9
44. Y.-Y. Su, M. Attariyan, and J. Flinn. AutoBash: Improving configuration management with operating system causality analysis. In SOSP, pages 237-250, 2007. §9 (Pubitemid 351429379)
45. B. Vandiver, H. Balakrishnan, B. Liskov, and S. Madden. Tolerating byzantine faults in transaction processing systems using commit barrier scheduling. In SOSP, pages 59-72. ACM, 2007. §3.2, §9 (Pubitemid 351429369)
46. M. J. Weinstein, J. Thomas W. Page, B. K. Livezey, and G. J. Popek. Transactions and synchronization in a distributed operating system. In SOSP, pages 115-126, 1985. §9
47. B. Wester, J. Cowling, E. B. Nightingale, P. M. Chen, J. Flinn, and B. Liskov. Tolerating latency in replicated state machines. In NSDI, pages 245-260, 2009. §9
48. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for byzantine fault tolerant services. In SOSP, pages 253-267, 2003. §3.1 (Pubitemid 40929701)
49. M. Zalewski. Delivering signals for fun and profit, 2001. http://lcamtuf.coredump.cx/signals.txt. §3
50. C. Zilles and L. Baugh. Extending hardware transactional memory to support non-busy waiting and non-transactional actions. In TRANSACT. ACM, 2006. §9