메뉴 건너뛰기




Volumn 44, Issue 9, 2009, Pages 161-172

Partial memoization of concurrency and communication

Author keywords

Concurrent ml; Concurrent programming; Multicore systems; Partial memoization; Software transactions

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

EID: 70350435468     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1631687.1596575     Document Type: Conference Paper
Times cited : (10)

References (26)
  • 1
    • 0037967781 scopus 로고    scopus 로고
    • Selective memoization
    • Umut A. Acar, Guy E. Blelloch, and Robert Harper. Selective Memoization. In POPL, pages 14-25, 2003.
    • (2003) POPL , pp. 14-25
    • Acar, U.A.1    Blelloch, G.E.2    Harper, R.3
  • 2
    • 77954758373 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 5
    • 33750381793 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 12
    • 0034446995 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • MLton. http://www.mlton.org.
  • 18
    • 0024866906 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 25
    • 34250646270 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.