{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T18:10:10Z","timestamp":1743963010604,"version":"3.40.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T00:00:00Z","timestamp":1344470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10766-012-0212-y","type":"journal-article","created":{"date-parts":[[2012,8,8]],"date-time":"2012-08-08T12:13:03Z","timestamp":1344427983000},"page":"49-76","source":"Crossref","is-referenced-by-count":0,"title":["Impact of Reverse Computing on Information Locality in Register Allocation for High Performance Computing"],"prefix":"10.1007","volume":"42","author":[{"given":"Mouad","family":"Bahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Eisenbeis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,9]]},"reference":[{"key":"212_CR1","unstructured":"http:\/\/developer.nvidia.com\/nvidia-gpu-computing-documentation"},{"key":"212_CR2","doi-asserted-by":"crossref","unstructured":"Bahi, M., Eisenbeis, C.: Rematerialization-based register allocation through reverse computing. In: Proceedings of the 8th ACM International Conference on Computing Frontiers, CF \u201911, pp. 24:1\u201324:2. New York, NY, USA, ACM (2011)","DOI":"10.1145\/2016604.2016632"},{"key":"212_CR3","doi-asserted-by":"crossref","unstructured":"Baker, H.G.: NREVERSAL of fortune\u2014the thermodynamics of garbage collection. In: IWMM, pp. 507\u2013524 (1992)","DOI":"10.1007\/BFb0017210"},{"issue":"6","key":"212_CR4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"212_CR5","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"C.H. Bennett","year":"1989","unstructured":"Bennett C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"212_CR6","unstructured":"Berson, D.A., Gupta, R., Soffa, M.L.: URSA: A unified resource allocator for registers and functional units in vliw architectures. In: PACT\u201993: Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, pp. 243\u2013254. North-Holland Publishing Co., Amsterdam, The Netherlands (1993)"},{"key":"212_CR7","doi-asserted-by":"crossref","unstructured":"Bishop, P.G.: Using reversible computing to achieve fail-safety. In: Proceedings of the Eighth International Symposium on Software Reliability Engineering, ISSRE \u201997, pp. 182\u2013191. IEEE Computer Society, Washington, DC, USA (1997)","DOI":"10.1109\/ISSRE.1997.630863"},{"key":"212_CR8","unstructured":"Bouchez, F.: A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases. PhD thesis, ENS Lyon (2009)"},{"key":"212_CR9","unstructured":"Briggs, P.: Register allocation via graph coloring. PhD thesis Rice University, Houston TX USA (1992)"},{"key":"212_CR10","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Rematerialization. In: Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, PLDI \u201992, pp. 311\u2013321. ACM, New York, NY, USA (1992)","DOI":"10.1145\/143095.143143"},{"key":"212_CR11","doi-asserted-by":"crossref","unstructured":"Carothers, C.D., Perumalla, K.S., Fujimoto, R.M.: Efficient optimistic parallel simulations using reverse computation. In: Proceedings of the Thirteenth Workshop on Parallel and Distributed Simulation, PADS \u201999, pp. 126\u2013135. IEEE Computer Society, Washington, DC, USA (1999)","DOI":"10.1109\/PADS.1999.766169"},{"key":"212_CR12","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation & spilling via graph coloring. In: SIGPLAN \u201982: Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, pp. 98\u2013105. ACM, New York, NY, USA (1982)","DOI":"10.1145\/800230.806984"},{"key":"212_CR13","unstructured":"Frank, M.P.: The R programming language and compiler, pp. 1\u201318. Memo M8 MIT AI Lab (1997)"},{"issue":"1","key":"212_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TC.2003.1159750","volume":"52","author":"R. Govindarajan","year":"2003","unstructured":"Govindarajan R., Yang H., Amaral J.N., Zhang C., Gao G.R.: Minimum register instruction sequencing to reduce register spills in out-of-order issue superscalar architectures. IEEE Trans. Comput. 52(1), 4\u201320 (2003)","journal-title":"IEEE Trans. Comput."},{"key":"212_CR15","unstructured":"Lutz, C., Derby, H.: Janus: a Time-Reversible Language. Caltech Class Project (1982)"},{"key":"212_CR16","unstructured":"Murphy, M.: Nvidia\u2019s experience with open64. Open64 Workshop at CGO (2008)"},{"key":"212_CR17","unstructured":"Punjani, M.: Register rematerialization in gcc. In: GCC Developers\u2019 Summit, pp. 131\u2013139 (2004)"},{"key":"212_CR18","unstructured":"Simpson L.T.: Value-Driven Redundancy Elimination. PhD thesis, Rice University, Houston, TX, USA (1996)"},{"key":"212_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cpc.2005.08.006","volume":"174","author":"C. Urbach","year":"2006","unstructured":"Urbach C., Jansen K., Shindler A., Wenger U.: HMC algorithm with multiple time scale integration and mass preconditioning. Comput. Phys. Commun. 174, 87\u201398 (2006)","journal-title":"Comput. Phys. Commun."},{"key":"212_CR20","unstructured":"Zhang, T., Zhuang, X., Pande, S.: Compiler optimizations to reduce security overhead. In: Proceedings of the International Symposium on Code Generation and Optimization, CGO \u201906, pp. 346\u2013357. IEEE Computer Society, Washington, DC, USA (2006)"},{"issue":"2","key":"212_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/609761.609767","volume":"36","author":"Y. Zhang","year":"2001","unstructured":"Zhang Y., Kwon Y.-J., Lee H.J.: A systematic generation of initial register-reuse chains for dependence minimization. SIGPLAN Not. 36(2), 47\u201354 (2001)","journal-title":"SIGPLAN Not."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-012-0212-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-012-0212-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-012-0212-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T17:55:56Z","timestamp":1743962156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-012-0212-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s10766-012-0212-y","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2012,8,9]]}}}