ACM Home Page
Please provide us with feedback. Feedback
Transactifying Apache's cache module
Full text PdfPdf (456 KB)
Source ACM International Conference Proceeding Series archive
Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference table of contents
Haifa, Israel
SESSION: Distributed systems and concurrency table of contents
Article No. 2  
Year of Publication: 2009
ISBN:978-1-60558-623-6
Authors
Haggai Eran  Israel Institute of Technology
Ohad Lutzky  Israel Institute of Technology
Zvika Guz  Israel Institute of Technology
Idit Keidar  Israel Institute of Technology
Sponsors
: Melanox Technologies
: Hebrew University of Jerusalem
IBM : IBM
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1534530.1534533
What is a DOI?

ABSTRACT

Apache is a large-scale industrial multi-process and multithreaded application, which uses lock-based synchronization. We report on our experience in modifying Apache's cache module to employ transactional memory instead of locks, a process we refer to as transactification; we are not aware of any previous efforts to transactify legacy software of such a large scale. Along the way, we learned some valuable lessons about which tools one should use, which parts of the code one should transactify and which are better left untouched, as well as on the intricacy of commit handlers. We also stumbled across weaknesses of existing software transactional memory (STM) toolkits, leading us to identify desirable features they are currently lacking. Finally, we present performance results from running Apache on a 32-core machine, showing that, there are scenarios where the performance of the STM-based version is close to that of the lock-based version. These results suggest that there are applications for which the overhead of using a software-only implementation of transactional memory is insignificant.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Albert Cohen. GCC for Transactional Memory. http://www.hipeac.net/system/files/TM_for_GCC_design_0_94.pdf, 29 Aug. 2008.
 
2
 
3
C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. Stamp: Stanford transactional applications for multi-processing. In IISWC '08: Proceedings of The IEEE International Symposium on Workload Characterization, September 2008.
 
4
O. S. D. Dice and N. Shavit. Transactional locking ii. In Proc. of the 20th International Symposium on Distributed Computing (DISC 2006), pages 194--208, 2006.
 
5
P. Felber, C. Fetzer, U. Müller, T. Riegel, M. Süßkraut, and H. Sturzrehm. Transactifying applications using an open compiler framework. In TRANSACT, August 2007.
6
 
7
K. Fraser. Practical lock freedom. PhD thesis, Cambridge University Computer Laboratory, 2003. Also available as Technical Report UCAM-CL-TR-579.
8
9
 
10
Intel. Transactional memory ABI. http://software.intel.com/file/8097.
 
11
Jeffrey Fulmer. Siege HTTP regression testing and benchmarking utility. http://www.joedog.org/JoeDog/Siege.
 
12
 
13
V. J. Marathe, M. F. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. N. S. Iii, and M. L. Scott. Lowering the overhead of nonblocking software transactional memory. In Dept. of Computer Science, Univ. of Rochester, 2006.
14
15
 
16
The Apache Software Foundation. Apache HTTP Server Project. http://httpd.apache.org/.

Collaborative Colleagues:
Haggai Eran: colleagues
Ohad Lutzky: colleagues
Zvika Guz: colleagues
Idit Keidar: colleagues