CCSTM: A library-based STM for Scala. We introduce CCSTM, a library-based software transactional mem-ory (STM) for Scala, and give an overview of its design and imple-mentation. Our design philosophy is that CCSTM should be a use-ful tool for the parallel programmer, rather than a parallelization mechanism for arbitrary sequential code, or the sole synchroniza-tion primitive in a system. CCSTM expresses transactional reads and writes as explicit method calls on instances of a reference type. Scala’s flexible method names, implicit parameters, and closures keep the syntax concise, and the reference instances provide a natural way to ex-press additional STM functionality. We use a novel hybrid of static and dynamic transaction scoping to retain composability while avoiding the barrier overheads that would otherwise result from an implementation as an unprivileged library. Experiments show that CCSTM’s performance and scalability are on par with bytecode rewriting STMs.

References in zbMATH (referenced in 34 articles )

Showing results 1 to 20 of 34.
Sorted by year (citations)

1 2 next

  1. Abraham, Ittai; Chechik, Shiri; Gavoille, Cyril; Peleg, David: Forbidden-set distance labels for graphs of bounded doubling dimension (2010)
  2. Alon, Noga; Emek, Yuval; Feldman, Michal; Tennenholtz, Moshe: Bayesian ignorance (2010)
  3. Aspnes, James: A modular approach to shared-memory consensus, with applications to the probabilistic-write model (2010)
  4. Barenboim, Leonid; Elkin, Michael: Deterministic distributed vertex coloring in polylogarithmic time (2010)
  5. Bar-Noy, Amotz; Cheilaris, Panagiotis; Feng, Yi; Levin, Asaf: Finding mobile data under delay constraints with searching costs (2010)
  6. Beauquier, Joffroy; Burman, Janna; Clement, Julien; Kutten, Shay: On utilizing speed in networks of mobile agents (2010)
  7. Beerliová-Trubíniová, Zuzana; Hirt, Martin; Nielsen, Jesper Buus: On the theoretical gap between synchronous and asynchronous MPC protocols (2010)
  8. Bhatt, Vibhor; Jayanti, Prasad: Constant RMR solutions to reader writer synchronization (2010)
  9. Censor Hillel, Keren; Shachnai, Hadas: Partial information spreading with application to distributed maximum coverage (2010)
  10. Clementi, Andrea; Monti, Angelo; Silvestri, Riccardo: Fast flooding over Manhattan (2010)
  11. Czyzowicz, Jurek; Kosowski, Adrian; Pelc, Andrzej: How to meet when you forget: log-space rendezvous in arbitrary graphs (2010)
  12. Danek, Robert: The (k)-bakery, local-spin (k)-exclusion using non-atomic reads and writes (2010)
  13. Das Sarma, Atish; Nanongkai, Danupon; Pandurangan, Gopal; Tetali, Prasad: Efficient distributed random walks with applications (2010)
  14. Das, Shantanu; Flocchini, Paola; Santoro, Nicola; Yamashita, Masafumi: On the computational power of oblivious robots, forming a series of geometric patterns (2010)
  15. Elsässer, Robert; Sauerwald, Thomas: Discrete load balancing is (almost) as easy as continuous load balancing (2010)
  16. Emek, Yuval; Halldórsson, Magnús M.; Mansour, Yishay; Patt-Shamir, Boaz; Radhakrishnan, Jaikumar; Rawitz, Dror: Online set packing and competitive scheduling of multi-part tasks (2010)
  17. Emek, Yuval; Korman, Amos: Efficient threshold detection in a distributed environment (extended abstract) (2010)
  18. Eyal, Ittay; Keidar, Idit; Rom, Raphael: Distributed data classification in sensor networks (2010)
  19. Georgiou, Chryssis; Gilbert, Seth; Kowalski, Dariusz R.: Meeting the deadline, on the complexity of fault-tolerant \textscContinuousGossip (2010)
  20. Hanusse, Nicolas; Ilcinkas, David; Kosowski, Adrian; Nisse, Nicolas: Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock? (2010)

1 2 next