Checkpoints and continuations instead of nested transactions

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 160-168

  Koskinen, Eric ^a   Herlihy, Maurice ^a  

^a Brown Univerity   (United States)

Author keywords

Boosting; Checkpoints; Concurrency; Continuations; Parallel programming; Transactional memory

Indexed keywords

BOOSTING; CHECKPOINTS; CONCURRENCY; CONTINUATIONS; TRANSACTIONAL MEMORY;

DATA STRUCTURES; FILE ORGANIZATION; PARALLEL PROGRAMMING;

PARALLEL ALGORITHMS;

EID: 57349187155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378563     Document Type: Conference Paper

References (15)

1. APPEL. A. W. Modern Compiler Implementation in ML. Cambridge University Press, New York, NY, USA, 2004.
2. CAO MINH, C., TRAUTMANN. M., CHUNG, J., MCDONALD, A., BRONSON, N., CASPER, J., KOZYRAKIS, C, AND OLUKOTUN, K. An effective hybrid transactional memory system with strong isolation guarantees. In Proceedings of the 34th Annual International Symposium on Computer Architecture (ISCA 07). Jun 2007.
3. CARLSTROM, B. D., MCDONALD, A., CARBIN, M., KOZYRAKIS, C, AND OLUKOTUN, K. Transactional collection classes. In Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP'07) (New York, NY, USA, 2007), ACM, pp. 56-67.
4. CRAIG, T. Building fifo and priority-queueing spin locks from atomic swap. Technical Report 93-02-02, Department of Computer Science & Engineering, University of Washington, 1993.
5. CRAIG, T. Queuing spin lock algorithms to support timing predictability. Proceedings of the Real-Time Systems Symposium, (1993), 148-157.
6. DICE, D., SHALEV, O., AND SHAVIT, N. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing (DISC '06) (September 2006).
7. HARRIS, T., AND STTPIĆ, S. Abstract nested transactions. In Proceedings of the 2nd ACM SIGPLAN Workshop on Languages, compilers, and hardware support for transactional computing (TRANSACT '07) (2007).
8. HERLIHY, M., AND KOSKINEN, E. Transactional boosting: A methodology for highly concurrent transactional objects. Technical Report CS-07-08, Department of Computer Science, Brown University, 2007.
9. HERLIHY, M., AND KOSKINEN, E. Transactional boosting: A methodology for highly concurrent transactional objects. In Proceedings of the 13th ACM SIGPLAN symposium, on Principles and practice of parallel, programming (PPoPP '08) (2008).
10. LEV, Y., AND MAESSEN, J.-W. Split hardware transactions: True nesting of transactions using best-effort hardware transactional memory. In Proceedings of the 13th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP '08) (2008).
11. MAGNUSSON, P. S., LANDIN, A., AND HAGERSTEN, E. Queue locks on cache coherent multiprocessors. In Proceedings of the 8th International Symposium, on Parallel Processing (Washington, DC, USA, 1994), IEEE Computer Society, pp. 165-171.
12. MORAVAN, M. J., BOBBA, J., MOORE, K. E., YEN, L., HILL, M. D., LIBLIT, B., SWIFT, M. M., AND WOOD, D. A. Supporting nested transactional memory in LogTM. In Proceedings of the 12th international conference on Architectural support for programming languages and operating systems (ASPLOS-XII) (New York, NY, USA, 2006), ACM Press, pp. 359-370.
13. NI, Y., MENON, V. S., ADL-TABATABAI, A.-R., HOSKING, A. L., HUDSON, R. L., MOSS, J. E. B., SAHA, B., AND SHPEISMAN, T. Open nesting in software transactional memory. In Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice, of parallel programming (PPoPP '07) (New York, NY, USA, 2007), ACM Press, pp. 68-78.
14. SCHERER, III, W. N., AND SCOTT, M. L. Advanced contention management for dynamic software transactional memory. In PODC '05: Proceedings of the. 24th annual ACM symposium on Principles of distributed computing (New York, NY, USA, 2005), ACM, pp. 240-248.
15. STRACHEY, C, AND WADSWORTH, CP. Continuations: A mathematical semantics for handling fulljumps. Higher Order Symbol. Comput. 13, 1-2 (2000), 135-152.