{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:34:37Z","timestamp":1725485677828},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436744"},{"type":"electronic","value":"9783540478478"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47847-7_44","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T05:43:29Z","timestamp":1180763009000},"page":"479-489","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Static Coarse Grain Task Scheduling with Cache Optimization Using OpenMP"],"prefix":"10.1007","author":[{"given":"Hirofumi","family":"Nakano","sequence":"first","affiliation":[]},{"given":"Kazuhisa","family":"Ishizaka","sequence":"additional","affiliation":[]},{"given":"Motoki","family":"Obata","sequence":"additional","affiliation":[]},{"given":"Keiji","family":"Kimura","sequence":"additional","affiliation":[]},{"given":"Hironori","family":"Kasahara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"44_CR1","unstructured":"APC. \n                    http:\/\/www.apc.waseda.ac.jp\/\n                    \n                  ."},{"issue":"4","key":"44_CR2","first-page":"513","volume":"35","author":"M. Okamoto","year":"1994","unstructured":"M. Okamoto, K. Aida, M. Miyazawa, H. Honda, and H. Kasahara. A hierarchical macro-dataflow computation scheme for oscar multi-grain compiler. Trans. IPSJ, 35(4):513\u2013521, 1994.","journal-title":"Trans. IPSJ"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"H. Kasahara, M. Obata, and K. Ishizaka. Automatic coarse grain task parallel processing on smp using openmp. In Proc. 12th Workshop on Languages and Compilers for Parallel Computing, Aug 2000.","DOI":"10.1007\/3-540-45574-4_13"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"A. W. Lim, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. In Proc. 13th ACM SIGARCH International Conference on Supercomputing, Jun 1999.","DOI":"10.1145\/305138.305197"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"A. W. Lim, S. Liao, and M. S. Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In Proc. of the Eighth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Jun 2001.","DOI":"10.1145\/379539.379586"},{"key":"44_CR6","unstructured":"A. W. Lim and M. S. Lam. Cache optimizations with affine partitioning. In Proc. of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, Mar 2001."},{"key":"44_CR7","unstructured":"S. Vajracharya, S. Karmesin, P. Beckman, J. Crotinger, A. Malony, S. Shende, R. Oldehoeft, and S. Smith. Smarts: exploiting temporal locality and parallelism through vertical execution. In Proc. of the 1999 international conference on Supercomputing, Jun 1999."},{"key":"44_CR8","unstructured":"D. Inaishi, K. Kimura, K. Fujimoto, W. Ogata, M. Okamoto, and H. Kasahara. A cache optimization with earliest executable condition analysis. In Technical report of IPSJ, Aug 1998."},{"key":"44_CR9","unstructured":"K. Ishizaka, M. Obata, and H. Kasahara. Coarse grain task parallel processing with cache optimization on shared memory multiprocessor. In Proc. 14th Workshop on Languages and Compilers for Parallel Computing, Aug 2001."},{"issue":"5","key":"44_CR10","first-page":"2054","volume":"40","author":"A. Yoshida","year":"1999","unstructured":"A. Yoshida, K. Koshizuka, M. Okamoto, and H. Kasahara. A data-localization scheme among loops for each layer in hierarchical coarse grain parallel processing. Trans. IPSJ, 40(5):2054\u20132063, 1999.","journal-title":"Trans. IPSJ"},{"key":"44_CR11","unstructured":"A. Yoshida, S. Yagi, and H. Kasahara. A data-localization scheme for macrotaskgraph with data dependencies on smp. In Technical report of IPSJ, 2001-ARC-141, Jan 2001."},{"key":"44_CR12","unstructured":"H. Kasahara. Parallel Processing Technology. CORONA PUBLISHING CO., LTD., 1991."},{"key":"44_CR13","unstructured":"H. Kasahara, H. Honda, A. Mogi, A. Ogura, K. Fujiwara, and S. Narita. A multigrain parallelizing compilation scheme for oscar. Proc. 4th Workshop on Languages and Compilers for Parallel Computing, Aug 1991."},{"key":"44_CR14","unstructured":"K. Yoshii, G. Matsui, M. Obata, S. Kumazawa, and H. Kasahara. An analysis-time procedure inlining scheme for multi-grain automatic parallelizing compilation. In Technical report of IPSJ, ARC\/HPC, Mar 2000."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47847-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:34:16Z","timestamp":1558272856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47847-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436744","9783540478478"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47847-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}