-
2
-
-
77954758373
-
Imperative self- adjusting computation
-
Umut A. Acar, Amal Ahmed, and Matthias Blume. Imperative Self- Adjusting Computation. In POPL, pages 309-322, 2008.
-
(2008)
POPL
, pp. 309-322
-
-
Acar, U.A.1
Ahmed, A.2
Blume, M.3
-
3
-
-
33746090532
-
Compiler and runtime support for efficient software transactional memory
-
Ali-Reza Adl-Tabatabai, Brian T. Lewis, Vijay Menon, Brian R. Murphy, Bratin Saha, and Tatiana Shpeisman. Compiler and Runtime Support for Efficient Software Transactional Memory. In PLDI, pages 26-37, 2006.
-
(2006)
PLDI
, pp. 26-37
-
-
Adl-Tabatabai, A.-R.1
Lewis, B.T.2
Menon, V.3
Murphy, B.R.4
Saha, B.5
Shpeisman, T.6
-
4
-
-
0027621765
-
The 007 benchmark
-
Michael J. Carey, David J. DeWitt, and Jeffrey F. Naughton. The 007 benchmark. SIGMOD Record, 22(2):12-21, 1993.
-
(1993)
SIGMOD Record
, vol.22
, Issue.2
, pp. 12-21
-
-
Carey, M.J.1
Dewitt, D.J.2
Naughton, J.F.3
-
5
-
-
33750381793
-
Transactional events
-
Kevin Donnelly and Matthew Fluet. Transactional Events. In ICFP, pages 124-135, 2006.
-
(2006)
ICFP
, pp. 124-135
-
-
Donnelly, K.1
Fluet, M.2
-
6
-
-
59249094247
-
Transactional events for ml
-
ISBN 978-1-59593- 919-7
-
Laura Effinger-Dean, Matthew Kehrt, and Dan Grossman. Transactional events for ml. In ICFP '08, pages 103-114, 2008. ISBN 978-1-59593- 919-7.
-
(2008)
ICFP '08
, pp. 103-114
-
-
Effinger-Dean, L.1
Kehrt, M.2
Grossman, D.3
-
7
-
-
33846471996
-
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
-
Michael I. Gordon, William Thies, and Saman Amarasinghe. Exploiting Coarse-Grained Task, Data, and Pipeline Parallelism in Stream Programs. In ASPLOS-XII, pages 151-162, 2006.
-
(2006)
ASPLOS-XII
, pp. 151-162
-
-
Gordon, M.I.1
Thies, W.2
Amarasinghe, S.3
-
8
-
-
34548036715
-
STMBench7: A benchmark for software transactional memory
-
Rachid Guerraoui, Michal Kapalka, and Jan Vitek. STMBench7: A Benchmark for Software Transactional Memory. In EuroSys, pages 315-324, 2007.
-
(2007)
EuroSys
, pp. 315-324
-
-
Guerraoui, R.1
Kapalka, M.2
Vitek, J.3
-
10
-
-
1442263994
-
Language support for lightweight transactions
-
Tim Harris and Keir Fraser. Language support for lightweight transactions. In OOPSLA, pages 388-402, 2003.
-
(2003)
OOPSLA
, pp. 388-402
-
-
Harris, T.1
Fraser, K.2
-
11
-
-
31844442209
-
Composable memory transactions
-
Tim Harris, Simon Marlow, Simon Peyton-Jones, and Maurice Herlihy. Composable Memory Transactions. In Proceedings of the ACM Conference on Principles and Practice of Parallel Programming, pages 48-60, 2005.
-
(2005)
Proceedings of the ACM Conference on Principles and Practice of Parallel Programming
, pp. 48-60
-
-
Harris, T.1
Marlow, S.2
Peyton-Jones, S.3
Herlihy, M.4
-
12
-
-
0034446995
-
Caching function calls using precise dependencies
-
Allan Heydon, Roy Levin, and Yuan Yu. Caching function calls using precise dependencies. In PLDI, pages 311-320, 2000.
-
(2000)
PLDI
, pp. 311-320
-
-
Heydon, A.1
Levin, R.2
Yu, Y.3
-
13
-
-
67650095167
-
Compiling self-adjusting programs with continuations
-
Ruy Ley-Wild, Matthew Fluet, and Umut A. Acar. Compiling self-adjusting programs with continuations. In ICFP, pages 321-334, 2008.
-
(2008)
ICFP
, pp. 321-334
-
-
Ley-Wild, R.1
Fluet, M.2
Acar, U.A.3
-
14
-
-
84957614508
-
Caching intermediate results for program improvement
-
Yanhong A. Liu and Tim Teitelbaum. Caching Intermediate Results for Program Improvement. In PEPM, pages 190-201, 1995.
-
(1995)
PEPM
, pp. 190-201
-
-
Liu, Y.A.1
Teitelbaum, T.2
-
15
-
-
51849117754
-
Streaming algorithms for k-center clustering with outliers and with anonymity
-
Richard Matthew Mccutchen and Samir Khuller. Streaming algorithms for k-center clustering with outliers and with anonymity. In APPROX '08/RANDOM '08, pages 165-178, 2008.
-
(2008)
APPROX '08/RANDOM '08
, pp. 165-178
-
-
Mccutchen, R.M.1
Khuller, S.2
-
16
-
-
84869656905
-
-
MLton. http://www.mlton.org.
-
-
-
-
18
-
-
0024866906
-
Incremental computation via function caching
-
W. Pugh and T. Teitelbaum. Incremental Computation via Function Caching. In POPL, pages 315-328, 1989.
-
(1989)
POPL
, pp. 315-328
-
-
Pugh, W.1
Teitelbaum, T.2
-
19
-
-
85019193443
-
An improved replacement strategy for function caching
-
William Pugh. An Improved Replacement Strategy for Function Caching. In LFP, pages 269-276, 1988.
-
(1988)
LFP
, pp. 269-276
-
-
Pugh, W.1
-
20
-
-
1442312211
-
Summarizing procedures in concurrent programs
-
Shaz Qadeer, Sriram K. Rajamani, and Jakob Rehof. Summarizing procedures in concurrent programs. In POPL, pages 245-255, 2004.
-
(2004)
POPL
, pp. 245-255
-
-
Qadeer, S.1
Rajamani, S.K.2
Rehof, J.3
-
21
-
-
59249091839
-
Towards a parallel implementation of concurrent ML
-
January 2008
-
John Reppy and Yingqi Xiao. Towards a Parallel Implementation of Concurrent ML. In DAMP 2008, January 2008.
-
DAMP
, pp. 2008
-
-
Reppy, J.1
Xiao, Y.2
-
24
-
-
33751032129
-
McRT-STM: A high performance software transactional memory system for a multi-core runtime
-
Proceedings of the 2006 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP'06
-
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Chi Cao Minh, and Benjamin Hertzberg. McRT-STM: a High-Performance Software Transactional Memory system for a Multi-Core Runtime. In PPoPP, pages 187-197, 2006. (Pubitemid 44758689)
-
(2006)
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
, vol.2006
, pp. 187-197
-
-
Saha, B.1
Adl-Tabatabai, A.-R.2
Hudson, R.L.3
Chi, C.M.4
Hertzberg, B.5
-
25
-
-
34250646270
-
A monadic approach for avoiding code duplication when staging memoized functions
-
Kedar Swadi, Walid Taha, Oleg Kiselyov, and Emir Pasalic. A Monadic Approach for Avoiding Code Duplication When Staging Memoized Functions. In PEPM, pages 160-169, 2006.
-
(2006)
PEPM
, pp. 160-169
-
-
Swadi, K.1
Taha, W.2
Kiselyov, O.3
Pasalic, E.4
|