{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:01Z","timestamp":1725487201993},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414292"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44467-x_3","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:21:46Z","timestamp":1184602906000},"page":"27-36","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Run-Time Scheme for Exploiting Parallelism on Multiprocessor Systems"],"prefix":"10.1007","author":[{"given":"Tsung-Chuan","family":"Huang1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Po-Hsueh","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Fan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Chen, D. K., Yew, P. C., Torrellas, J.: An Efficient Algorithm for the Run-Time Parallelization of Doacross Loops. Proc. 1994 Supercomputing (1994) 518\u2013527"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BFb0032691","volume-title":"The SPNT Test: A New Technology for Run-Time Speculative Parallelization of Loops","author":"T. C. Huang","year":"1998","unstructured":"Huang, T. C., Hsu, P. H.: The SPNT Test: A New Technology for Run-Time Speculative Parallelization of Loops. Lecture Notes in Computer Science Vol. 1366. Springer-Verlag, Berlin Heidelberg New York (1998) 177\u2013191"},{"issue":"1","key":"3_CR3","first-page":"255","volume":"14","author":"T. C. Huang","year":"1998","unstructured":"Huang, T. C., Hsu, P. H., Sheng, T. N.: Efficient Run-Time Scheduling for Parallelizing Partially Parallel Loops,\u201d J. Information Science and Engineering 14(1), (1998) 255\u2013264","journal-title":"J. Information Science and Engineering"},{"key":"3_CR4","unstructured":"Leung, S. T., Zahorjan, J.: Improving the Performance of Run-Time Parallelization. Proc. 4th ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, (1993) 83\u201391"},{"key":"3_CR5","unstructured":"Leung, S. T., Zahorjan, J.: Extending the Applicability and Improving the Performance of Run-Time Parallelization. Tech. Rep. 95-01-08, Dept. CSE, Univ. of Washington (1995)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1109\/TC.1987.5009499","volume":"12","author":"S. Midkiff","year":"1987","unstructured":"Midkiff, S., Padua, D.: Compiler Algorithms for Synchronization. IEEE Trans. Comput. C-36, 12, (1987) 1485\u20131495","journal-title":"IEEE Trans. Comput. C-36"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1109\/12.2249","volume":"8","author":"C. Polychronopoulos","year":"1988","unstructured":"Polychronopoulos, C.: Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design. IEEE Trans. Comput. C-37, 8, (1988) 991\u20131004","journal-title":"IEEE Trans. Comput. C-37"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF02577866","volume":"26","author":"L. Rauchwerger","year":"1995","unstructured":"Rauchwerger, L., Amato, N., Padua, D.: A Scalable Method for Run-Time Loop Parallelization. Int. J. Parallel Processing, 26(6), (1995) 537\u2013576","journal-title":"Int. J. Parallel Processing"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/71.752782","volume":"10","author":"L. Rauchwerger","year":"1999","unstructured":"Rauchwerger, L., Padua, D.: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. IEEE Trans. Parallel and Distributed Systems, 10(2), (1999) 160\u2013180","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/12.88484","volume":"40","author":"J. Saltz","year":"1991","unstructured":"Saltz, J., Mirchandaney, R., Crowley, K.: Run-time Parallelization and Scheduling of Loops. IEEE Trans. Comput. 40(5), (1991) 603\u2013612","journal-title":"IEEE Trans. Comput."},{"key":"3_CR11","unstructured":"Xu, C., Chaudhary, V.: Time-Stamping Algorithms for Parallelization of Loops at Run-Time. Proc. 11th Int. Parallel Processing Symp. (1997)"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TSE.1987.233477","volume":"13","author":"C. Q. Zhu","year":"1987","unstructured":"Zhu, C. Q., Yew, P. C.: A Scheme to Enforce Data Dependence on Large Multiprocessor Systems. IEEE Trans. Software Eng. 13(6), (1987) 726\u2013739","journal-title":"IEEE Trans. Software Eng."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44467-X_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:07Z","timestamp":1605647167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44467-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540414292"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44467-x_3","relation":{},"subject":[]}}