{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:28Z","timestamp":1725560608477},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280095"},{"type":"electronic","value":"9783540318132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532378_10","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:16:36Z","timestamp":1279653396000},"page":"117-131","source":"Crossref","is-referenced-by-count":0,"title":["JuliusC: A Practical Approach for the Analysis of Divide-and-Conquer Algorithms"],"prefix":"10.1007","author":[{"given":"Paolo","family":"D\u2019Alberto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Nicolau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/292395.292412","volume":"24","author":"B. Kagstr\u00f6m","year":"1998","unstructured":"Kagstr\u00f6m, B., Ling, P., van Loan, C.: Gemm-based level 3 blas: high-performance model implementations and performance evaluation benchmark. ACM Transactions on Mathematical Software\u00a024, 268\u2013302 (1998)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10_CR2","unstructured":"(LAPACK \u2013 Linear Algebra PACKage), http:\/\/www.netlib.org\/lapack\/"},{"key":"10_CR3","volume-title":"Numerical Linear Algebra for Performance Computers.","author":"J. Dongarra","year":"2000","unstructured":"Dongarra, J., Duff, I., Soransen, D.C., van Der Vorst, H.: Numerical Linear Algebra for Performance Computers. SIAM, Philadelphia (2000)"},{"key":"10_CR4","unstructured":"Golub, G., van Loan, C.: Matrix Computations. Ed. The Johns Hopins University Press (1996)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Frens, J., Wise, D.: Auto-blocking matrix-multiplication or tracking blas3 performance from source code. In: Proc. 1997 ACM Symp. on Principles and Practice of Parallel Programming, vol.\u00a032, pp. 206\u2013216 (1997)","DOI":"10.1145\/263764.263789"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: Proceedings of the International Parallel and Distributed Processing Symposium (2002)","DOI":"10.1109\/IPDPS.2002.1015509"},{"key":"10_CR7","first-page":"1","volume-title":"Proceedings of the 1998 ACM\/IEEE conference on Supercomputing (CDROM","author":"R. Whaley","year":"1998","unstructured":"Whaley, R., Dongarra, J.J.: Automatically tuned linear algebra software. In: Proceedings of the 1998 ACM\/IEEE conference on Supercomputing (CDROM), pp. 1\u201327. IEEE Computer Society, Los Alamitos (1998)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/263580.263662","volume-title":"Proceedings of the 11th international conference on Supercomputing","author":"J. Bilmes","year":"1997","unstructured":"Bilmes, J., Asanovic, K., Chin, C., Demmel, J.: Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In: Proceedings of the 11th international conference on Supercomputing, pp. 340\u2013347. ACM Press, New York (1997)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Lam, M., Rothberg, E., Wolfe, M.: The cache performance and optimizations of blocked algorithms. In: Proceedings of the fourth international conference on architectural support for programming languages and operating system, pp. 63\u201374 (1991)","DOI":"10.1145\/106972.106981"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/592843.592845","volume":"28","author":"I. Jonsson","year":"2002","unstructured":"Jonsson, I., Kagstr\u00f6m, B.: Recursive blocked algorithms for solving triangular systems part i: one-sided and coupled sylvester-type matrix equations. ACM Trans. Math. Softw.\u00a028, 392\u2013415 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"10_CR11","doi-asserted-by":"crossref","DOI":"10.1145\/107214","volume-title":"Parallel functional languages and compilers","author":"B. Szymanski","year":"1991","unstructured":"Szymanski, B.: Parallel functional languages and compilers. ACM Press, New York (1991)"},{"key":"10_CR12","first-page":"285","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"M. Frigo","year":"1999","unstructured":"Frigo, M., Leiserson, C., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 285. IEEE Computer Society, Los Alamitos (1999)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S0895479896297744","volume":"18","author":"S. Toledo","year":"1997","unstructured":"Toledo, S.: Locality of reference in lu decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications\u00a018, 1065\u20131081 (1997)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Bilardi, G., D\u2019Alberto, P., Nicolau, A.: Fractal matrix multiplication: a case study on portability of cache performance. In: Workshop on Algorithm Engineering 2001, Aarhus, Denmark (2001)","DOI":"10.1007\/3-540-44688-5_3"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Gustavson, F., Henriksson, A., Jonsson, I., Ling, P., Kagstr\u00f6m, B.: Recursive blocked data formats and BLAS\u2019s for dense linear algebra algorithms. In: Verlag, S. (ed.) PARA 1998. LNCS, vol.\u00a01541, pp. 195\u2013206 (1998)","DOI":"10.1007\/BFb0095337"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.: The fastest fourier transform in the west. Technical Report MIT-LCS-TR-728, Massachusetts Institute of technology (1997)","DOI":"10.21236\/ADA479065"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Languages and Compilers for Parallel Computing","author":"P. D\u2019Alberto","year":"2004","unstructured":"D\u2019Alberto, P., Nicolau, A., Veidenbaum, A.: A data cache with dynamic mapping. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol.\u00a02958, Springer, Heidelberg (2004)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/151640.151644","volume":"1","author":"J. Hummel","year":"1992","unstructured":"Hummel, J., Hendren, L., Nicolau, A.: Abstract description of pointer data structures: an approach for improving the analysis and optimization of imperative programs. ACM Lett. Program. Lang. Syst.\u00a01, 243\u2013260 (1992)","journal-title":"ACM Lett. Program. Lang. Syst."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/301104.301111","volume-title":"Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming","author":"R. Rugina","year":"1999","unstructured":"Rugina, R., Rinard, M.: Automatic parallelization of divide and conquer algorithms. In: Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pp. 72\u201383. ACM Press, New York (1999)"},{"key":"10_CR20","unstructured":"D\u2019Alberto: (JuliusC), http:\/\/halps.ics.uci.edu\/~paolo\/JuliusC"},{"key":"10_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-44404-1_24","volume-title":"Logic for Programming and Automated Reasoning","author":"E. Albert","year":"2000","unstructured":"Albert, E., Hanus, M., Vidal, G.: Using an Abstract Representation to Specialize Functional Logic Programs. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 381\u2013398. Springer, Heidelberg (2000)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/128861.128864","volume":"14","author":"C. Gomard","year":"1992","unstructured":"Gomard, C.: A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics. ACM Trans. Program. Lang. Syst.\u00a014, 147\u2013172 (1992)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR23","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N. Jones","year":"1993","unstructured":"Jones, N., Gomard, C., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Soft edn. Prentice Hall International, Englewood Cliffs (1993)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/178243.178256","volume-title":"Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation","author":"J. Knoop","year":"1994","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Partial dead code elimination. In: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 147\u2013158. ACM Press, New York (1994)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/75277.75305","volume-title":"Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"W. Pugh","year":"1989","unstructured":"Pugh, W., Teitelbaum, T.: Incremental computation via function caching. In: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 315\u2013328. ACM Press, New York (1989)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/62678.62719","volume-title":"Proceedings of the 1988 ACM conference on LISP and functional programming","author":"W. Pugh","year":"1988","unstructured":"Pugh, W.: An improved replacement strategy for function caching. In: Proceedings of the 1988 ACM conference on LISP and functional programming, pp. 269\u2013276. ACM Press, New York (1988)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/349299.349341","volume-title":"Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation","author":"A. Heydon","year":"2000","unstructured":"Heydon, A., Levin, R., Yu, Y.: Caching function calls using precise dependencies. In: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pp. 311\u2013320. ACM Press, New York (2000)"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/232627.232638","volume-title":"Proceedings of the first ACM SIGPLAN international conference on Functional programming","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Lampson, B., L\u00e9vy, J.: Analysis and caching of dependencies. In: Proceedings of the first ACM SIGPLAN international conference on Functional programming, pp. 83\u201391. ACM Press, New York (1996)"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1023068020483","volume":"16","author":"Y. Liu","year":"2003","unstructured":"Liu, Y., Stoller, S.: Dynamic programming via static incrementalization. Higher Order Symbol. Comput.\u00a016, 37\u201362 (2003)","journal-title":"Higher Order Symbol. Comput."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Y., Stoller, S.: From recursion to iteration: What are the optimizations? In: Partial Evaluation and Semantic-Based Program Manipulation, pp. 73\u201382 (2000)","DOI":"10.1145\/328691.328700"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/349299.349323","volume-title":"Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation","author":"Q. Yi","year":"2000","unstructured":"Yi, Q., Adve, V., Kennedy, K.: Transforming loops to recursion for multi-level memory hierarchies. In: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pp. 169\u2013181. ACM Press, New York (2000)"},{"key":"10_CR32","unstructured":"Lam, M.: SUIF (1994-current), http:\/\/suif.stanford.edu\/"},{"key":"10_CR33","unstructured":"D\u2019Alberto, P.: Performance evaluation of data locality exploitation. Technical report, University of Bologna, Computer Science (2000)"},{"key":"10_CR34","series-title":"Lecture Notes in Math","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The development of the number field sieve","author":"A. Lenstra","year":"1993","unstructured":"Lenstra, A.: The development of the number field sieve. Lecture Notes in Math., vol.\u00a01554. Springer, Heidelberg (1993)"},{"key":"10_CR35","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Algorithm 97: Shortest path. Communications of the ACM\u00a05 (1962)","DOI":"10.1145\/367766.368168"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Ullman, J., Yannakakis, M.: The input\/output complexity of transitive closure. In: Proceedings of the 1990 ACM SIGMOD international conference on Management of data, vol.\u00a019 (1990)","DOI":"10.1145\/93597.93620"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532378_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:00Z","timestamp":1619506260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532378_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280095","9783540318132"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11532378_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}