{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:20:36Z","timestamp":1725560436512},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212973"},{"type":"electronic","value":"9783540247234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24723-4_5","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T20:14:24Z","timestamp":1280261664000},"page":"57-72","source":"Crossref","is-referenced-by-count":24,"title":["Data Dependence Profiling for Speculative Optimizations"],"prefix":"10.1007","author":[{"given":"Tong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Xiaoru","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Wei-Chung","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Pen-Chung","family":"Yew","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6894-6","volume-title":"Dependence Analysis for Supercomputing","author":"U. Banerjee","year":"1988","unstructured":"Banerjee, U.: Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Dordrecht (1988)"},{"volume-title":"Optimizing Supercompilers for Supercomputers","year":"1989","author":"M. Wolfe","key":"5_CR2","unstructured":"Wolfe, M.: Optimizing Supercompilers for Supercomputers. MIT Press, Cambridge (1989)"},{"issue":"8","key":"5_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-48319-5_11","volume-title":"Languages and Compilers for Parallel Computing","author":"R.L. Kennell","year":"1999","unstructured":"Kennell, R.L., Eigenmann, R.: Automatic Parallelization of C by Means of Language Transcription. In: Carter, L., Ferrante, J., Sehr, D., Chatterjee, S., Prins, J.F., Li, Z., Yew, P.-C. (eds.) LCPC 1998. LNCS, vol.\u00a01656, pp. 166\u2013180. Springer, Heidelberg (1999)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Hendren, L.J., Hummel, J., Nicolau, A.: A general data dependence test for dynamic, pointer-based data structures. In: Proceedings of the SIGPLAN 1994 Conference on Programming Language Design and Implementation, June 1994, pp. 218\u2013229 (1994)","DOI":"10.1145\/773473.178262"},{"volume-title":"Symposium on Principle of Program Language","year":"1996","author":"R. Ghiya","key":"5_CR6","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a dag, or a cyclic graph? In: Symposium on Principle of Program Language, January 1996, ACM, New York (1996)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: Haven\u2019t we solved this problem yet? In: ACM SIGPLANSIGSOFT Workshop on Program Analysis for Software Tools and Engineering, Snowbird, Utah, June 2001, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Lavery, D., Sehr, D.: On the Importance of Points-To Analysis and Other Memory Disambiguation methods For C programs. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, June 2001, pp. 47\u201358 (2001)","DOI":"10.1145\/378795.378806"},{"issue":"7","key":"5_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/2.689674","volume":"31","author":"C. Dulong","year":"1998","unstructured":"Dulong, C.: The IA-64 Architecture at Work. IEEE Computer\u00a031(7), 24\u201332 (1998)","journal-title":"IEEE Computer"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Sohi, G.S., Breach, S.E., Vijaykumar, T.N.: Multiscalar Processors. In: The 22nd Annual International Symposium on Computer Architecture, June 1995, pp. 414\u2013425 (1995)","DOI":"10.1145\/223982.224451"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Tsai, J.-Y., Huang, J., Amlo, C., Lilja, D.J., Yew, P.-C.: The Superthreaded Processor Architecture. IEEE Transactions on Computers, Special Issue on Multithreaded Architectures\u00a048(9) (September 1999)","DOI":"10.1109\/12.795219"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gallagher, D.M., Chen, W.Y., Mahlke, S.A., Gyllenhaal, J.C., Hwu, W.W.: Dynamic Memory Disambiguation Using the Memory Conflict Buffer. In: Proc. Sixth Int\u2019l. Conf. on ASPLOS, October 1994, pp. 183\u2013193 (1994)","DOI":"10.1145\/195473.195534"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Zilles, C., Sohi, G.: A programmable co-processor for profiling. In: Proceedings of the 7th International Symposium on High Performance Computer Architecture (HPCA-7), January 2001, p. 12 (2001)","DOI":"10.1109\/HPCA.2001.903267"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/319301.319348","volume":"21","author":"R. Kennedy","year":"1999","unstructured":"Kennedy, R., Chan, S., Liu, S., Lo, R., Tu, P., Chow, F.: Partial Redundancy Elimination in SSA Form. ACM Trans. on Programming Languages and systems\u00a021(3), 627\u2013676 (1999)","journal-title":"ACM Trans. on Programming Languages and systems"},{"key":"5_CR15","unstructured":"Ju, R.D.-C., Chan, S., Wu, C.: Open Research Compiler (ORC) for the Itanium Processor Family. Tutorial presented at Micro 34 (2001)"},{"key":"5_CR16","unstructured":"Ju, R.D.-C., Chan, S., Chow, F., Feng, X.: Open Research Compiler (ORC): Beyond Version 1.0. Tutorial presented at PACT 2002 (2002)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Arnold, M., Ryder, B.G.: A Framework for Reducing the Cost of Instrumented Code SIGPLAN Conference on Programming Language Design and Implementation (2001)","DOI":"10.1145\/378795.378832"},{"key":"5_CR18","unstructured":"http:\/\/www.specbench.org\/osg\/cpu2000\/"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Kennedy, R., Chan, S., Liu, S.-M., Io, R., Tu, P., Chow, F.: Partial redundancy elimination in SSA form. ACM Trans. Program. Languages and Systems (May 1999)","DOI":"10.1145\/319301.319348"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Lin, J., Chen, T., Hsu, W.C., Yew, P.C.: Speculative Register Promotion Using Advanced Load Address Table (ALAT). In: Proceedings of First Annual IEEE\/ACM International Symposium on Code Generation and Optimization, San Francisco, California, March 2003, pp. 125\u2013134 (2003)","DOI":"10.1109\/CGO.2003.1191539"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Lin, J., Chen, T., Hsu, W.-C., Yew, P.-C., Ju, R.D.-C., Ngai, T.-F., Chan, S.: A Compiler Framework for Speculative Analysis and Optimizations. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (June 2003)","DOI":"10.1145\/781131.781164"},{"key":"5_CR22","unstructured":"pfmon project web site, http:\/\/www.hpl.hp.com\/research\/linux\/perfmon\/"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0743-7315(88)90002-0","volume":"5","author":"D. Callahan","year":"1988","unstructured":"Callahan, D., Cocke, J., Kennedy, K.: Estimating Interlock and Improving Balance for Pipelined Architectures. Journal of Parallel and Distributed Computing\u00a05, 334\u2013348 (1988)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Larus, J.: Whole program paths. In: Programming Languages Design and Implementation, PLDI (1999)","DOI":"10.1145\/301618.301678"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Ball, T., Mataga, P., Sagiv, M.: Edge profiling versus path profiling: The showdown. In: Conference Record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 1998)","DOI":"10.1145\/268946.268958"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Ju, R.D.-C., Collard, J., Oukbir, K.: Probabilistic Memory Disambiguation and its Application to Data Speculation. Computer Architecture News\u00a027(1) (March 1999)","DOI":"10.1145\/309758.309769"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Chen, M., Olukotun, K.: TEST: A Tracer for Extracting Speculative Threads. In: Proceedings of First Annual IEEE\/ACM International Symposium on Code Generation and Optimization, San Francisco, California, March 2003, pp. 301\u2013312 (2003)","DOI":"10.1109\/CGO.2003.1191554"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24723-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:29:20Z","timestamp":1559316560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24723-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212973","9783540247234"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24723-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}
