메뉴 건너뛰기




Volumn , Issue , 2008, Pages 253-260

Space profiling for parallel functional programs

Author keywords

Cost semantics; Parallelism; Profiling; Scheduling; Standard ML

Indexed keywords

COST SEMANTICS; FUNCTIONAL PROGRAMS; PARALLELISM; PROFILING; PROFILING TOOLS; PROGRAM SOURCE CODES; RESOURCE USE; RUN-TIME; RUN-TIME SYSTEMS; SCHEDULING POLICIES; SEMANTIC SPACES; SPACE USE; STANDARD ML;

EID: 59249105571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411204.1411240     Document Type: Conference Paper
Times cited : (39)

References (32)
  • 1
    • 59249091835 scopus 로고    scopus 로고
    • Shail Aditya, Arvind, Jan-Willem Maessen, and Lennart Augustsson. Semantics of pH: A parallel dialect of Haskell. Technical. Report Computation Structures Group Memo 377-1, MIT, June 1995.
    • Shail Aditya, Arvind, Jan-Willem Maessen, and Lennart Augustsson. Semantics of pH: A parallel dialect of Haskell. Technical. Report Computation Structures Group Memo 377-1, MIT, June 1995.
  • 2
    • 0343887272 scopus 로고
    • Profiling in the presence of optimization and garbage collection
    • Technical Report CS-TR-197-88, Princeton University, November
    • Andrew W. Appel, Bruce Duba, and David B. MacQueen. Profiling in the presence of optimization and garbage collection. Technical Report CS-TR-197-88, Princeton University, November 1988.
    • (1988)
    • Appel, A.W.1    Duba, B.2    MacQueen, D.B.3
  • 3
    • 0024751383 scopus 로고    scopus 로고
    • Arvind, Rishiyur S. Nikhil, and Keshav K. Pingali. I-structures: data structures for parallel computing. ACM Trans. Program. Lang. Syst., 1.1 (4): 598-632, 1989.
    • Arvind, Rishiyur S. Nikhil, and Keshav K. Pingali. I-structures: data structures for parallel computing. ACM Trans. Program. Lang. Syst., 1.1 (4): 598-632, 1989.
  • 6
    • 0025380943 scopus 로고
    • Compiling collection-oriented languages onto massively parallel computers
    • Guy E. Blelloch and Gary W. Sabot. Compiling collection-oriented languages onto massively parallel computers. J. Parallel Distrib. Comput., 8(2): 119-134, 1990.
    • (1990) J. Parallel Distrib. Comput , vol.8 , Issue.2 , pp. 119-134
    • Blelloch, G.E.1    Sabot, G.W.2
  • 8
    • 0003575841 scopus 로고    scopus 로고
    • Provably efficient scheduling for languages with fine-grained parallelism
    • Guy E. Blelloch, Phillip B. Gibbons, and Yossi Matias. Provably efficient scheduling for languages with fine-grained parallelism. J. ACM, 46(2): 281-321, 1999.
    • (1999) J. ACM , vol.46 , Issue.2 , pp. 281-321
    • Blelloch, G.E.1    Gibbons, P.B.2    Matias, Y.3
  • 9
    • 0038036149 scopus 로고    scopus 로고
    • Space-efficient scheduling of multithreaded computations
    • Robert D. Blumofe and Charles E. Leiserson. Space-efficient scheduling of multithreaded computations. SIAMJ. Comp., 27(1):202-229, 1998.
    • (1998) SIAMJ. Comp , vol.27 , Issue.1 , pp. 202-229
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 10
    • 0000269759 scopus 로고    scopus 로고
    • Scheduling multithreaded computations by work stealing
    • Robert D. Blumofe and Charles E. Leiserson.. Scheduling multithreaded computations by work stealing. J. ACM, 46(5):720-748, 1999.
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 720-748
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 11
    • 0034538882 scopus 로고    scopus 로고
    • More types for nested data parallel programming
    • New York, NY, USA, ACM
    • Manuel M. T. Chakravarty and Gabriele Keller. More types for nested data parallel programming. In Proc. of the Int. Conf. on Funct. Program., pages 94-105, New York, NY, USA, 2000. ACM.
    • (2000) Proc. of the Int. Conf. on Funct. Program , pp. 94-105
    • Chakravarty, M.M.T.1    Keller, G.2
  • 13
    • 0034819524 scopus 로고    scopus 로고
    • A parallel, real-time garbage collector
    • Perry Cheng and Guy E. Blelloch. A parallel, real-time garbage collector. SIGPLAN Not., 36(5): 125-136, 2001.
    • (2001) SIGPLAN Not , vol.36 , Issue.5 , pp. 125-136
    • Cheng, P.1    Blelloch, G.E.2
  • 15
    • 59249101573 scopus 로고    scopus 로고
    • Adaptive Evaluation of Non-Strict Programs. PhD thesis, University of Cambridge
    • Robert Ennals. Adaptive Evaluation of Non-Strict Programs. PhD thesis, University of Cambridge, 2004.
    • (2004)
    • Ennals, R.1
  • 17
    • 59249108406 scopus 로고    scopus 로고
    • A scheduling framework for general-purpose parallel languages
    • New York, NY, USA, ACM
    • Matthew Fluet, Michael Rainey, and John Reppy. A scheduling framework for general-purpose parallel languages. In Proc. of the Int. Conf. on Funct. Program., New York, NY, USA, 2008. ACM.
    • (2008) Proc. of the Int. Conf. on Funct. Program
    • Fluet, M.1    Rainey, M.2    Reppy, J.3
  • 18
    • 18944407832 scopus 로고    scopus 로고
    • Jörgen Gustavsson and David Sands. A foundation for space-safe transformations of call-by-need programs. In Proc. of Workshop on Higher Order Operational Techniques in Semantics, number 26 of Electronic Notes in Theoretical Computer Science, September 1999.
    • Jörgen Gustavsson and David Sands. A foundation for space-safe transformations of call-by-need programs. In Proc. of Workshop on Higher Order Operational Techniques in Semantics, number volume 26 of Electronic Notes in Theoretical Computer Science, September 1999.
  • 20
    • 84868870499 scopus 로고    scopus 로고
    • Kevin Hammond, Hans-Wolfgang Loidl, and Andrew S. Partridge. Visualising Granularity in Parallel Programs: A Graphical. Winnowing System for Haskell. In A. P. Wim. Böhm and John T. Feo, editors, High Performance Functional Computing, pages 208-221, 1995.
    • Kevin Hammond, Hans-Wolfgang Loidl, and Andrew S. Partridge. Visualising Granularity in Parallel Programs: A Graphical. Winnowing System for Haskell. In A. P. Wim. Böhm and John T. Feo, editors, High Performance Functional Computing, pages 208-221, 1995.
  • 22
    • 0004243121 scopus 로고    scopus 로고
    • Cambridge University Press, New York, NY, USA
    • John H. Reppy. Concurrent programming in ML. Cambridge University Press, New York, NY, USA, 1999.
    • (1999) Concurrent programming in ML
    • Reppy, J.H.1
  • 23
    • 0029708795 scopus 로고    scopus 로고
    • Lag, drag, void and use-heap profiling and space-efficient compilation revisited
    • Niklas Röjemo and Colin Runciman. Lag, drag, void and use-heap profiling and space-efficient compilation revisited. SIGPLAN Not., 31(6):34-41, 1996.
    • (1996) SIGPLAN Not , vol.31 , Issue.6 , pp. 34-41
    • Röjemo, N.1    Runciman, C.2
  • 25
    • 84974318126 scopus 로고
    • Heap profiling of lazy functional programs
    • Colin Runciman and David Wakeling. Heap profiling of lazy functional programs. J. Funct. Program., 3(2):217-245, 1993a.
    • (1993) J. Funct. Program , vol.3 , Issue.2 , pp. 217-245
    • Runciman, C.1    Wakeling, D.2
  • 26
    • 0343039072 scopus 로고
    • Profiling Parallel Functional Computations (Without Parallel Machines)
    • Springer-Verlag
    • Colin Runciman and David Wakeling. Profiling Parallel Functional Computations (Without Parallel Machines). In Functional Programming, Glasgow '93, pages 236-251. Springer-Verlag, 1993b.
    • (1993) Functional Programming, Glasgow '93 , pp. 236-251
    • Runciman, C.1    Wakeling, D.2
  • 27
    • 0003571360 scopus 로고
    • Calculi for Time Analysis of Functional
    • PhD thesis, Department of Computing, Imperial College, University of London, September
    • David Sands. Calculi for Time Analysis of Functional. Programs. PhD thesis, Department of Computing, Imperial College, University of London, September 1990.
    • (1990) Programs
    • Sands, D.1
  • 29
    • 0029180094 scopus 로고
    • Time and space profiling for non-strict, higher-order functional languages
    • New York, NY, USA, ACM
    • Patrick M. Sansom and Simon L. Peyton Jones. Time and space profiling for non-strict, higher-order functional languages. In Proc. of the Symposium on Principles of Program. Languages, pages 355-366, New York, NY, USA, 1995. ACM.
    • (1995) Proc. of the Symposium on Principles of Program. Languages , pp. 355-366
    • Sansom, P.M.1    Peyton Jones, S.L.2
  • 30
    • 0028464101 scopus 로고
    • Space-efficient closure representations
    • New York, NY, USA, ACM
    • Zhong Shao and Andrew W Appel. Space-efficient closure representations. In Proc. of the Conf on LISP and Funct. Program., pages 150-161, New York, NY, USA, 1994. ACM.
    • (1994) Proc. of the Conf on LISP and Funct. Program , pp. 150-161
    • Shao, Z.1    Appel, A.W.2
  • 31
    • 59249098284 scopus 로고    scopus 로고
    • Space profiling for parallel functional programs
    • Technical Report CMU-CS-08-110, Carnegie Mellon University, April
    • Daniel Spoonhower, Guy E. Blelloch, Robert Harper, and Phillip B. Gibbons. Space profiling for parallel functional programs. Technical Report CMU-CS-08-110, Carnegie Mellon University, April 2008.
    • (2008)
    • Spoonhower, D.1    Blelloch, G.E.2    Harper, R.3    Gibbons, P.B.4
  • 32
    • 34247349075 scopus 로고    scopus 로고
    • Whole-program compilation in mlton
    • New York, NY, USA, ACM
    • Stephen Weeks. Whole-program compilation in mlton. In Proc. of the Workshop on ML, page 1, New York, NY, USA, 2006. ACM.
    • (2006) Proc. of the Workshop on ML , pp. 1
    • Weeks, S.1


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