{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T16:45:26Z","timestamp":1749487526450},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11432-014-5131-7","type":"journal-article","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T07:21:34Z","timestamp":1402471294000},"page":"1-18","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Acyclic orientation graph coloring for software-managed memory allocation"],"prefix":"10.1007","volume":"57","author":[{"given":"Li","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JingLing","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XueJun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"5131_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/774789.774805","volume-title":"Proceedings of the 10th International Symposium on Hardware\/Software Codesign, Estes Park","author":"R Banakar","year":"2002","unstructured":"Banakar R, Steinke S, Lee B-S, et al. Scratchpad memory: design alternative for cache on-chip memory in embedded systems. In: Proceedings of the 10th International Symposium on Hardware\/Software Codesign, Estes Park, 2002. 73\u201378"},{"key":"5131_CR2","first-page":"35","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing, Phoenix","author":"W J Dally","year":"2003","unstructured":"Dally W J, Labonte F, Das A, et al. Merrimac: supercomputing with streams. In: Proceedings of the ACM\/IEEE Conference on Supercomputing, Phoenix, 2003. 35"},{"key":"5131_CR3","first-page":"11","volume-title":"Proceedings of Workshop on Modeling, Benchmarking, and Simulation, Madison","author":"J D Cuvillo","year":"2005","unstructured":"Cuvillo J D, Zhu W, Ziang H U, et al. Fast: a functionally accurate simulation toolset for the cyclops64 cellular architecture. In: Proceedings of Workshop on Modeling, Benchmarking, and Simulation, Madison, 2005. 11\u201320"},{"key":"5131_CR4","first-page":"1","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing, New York","author":"J Makino","year":"2007","unstructured":"Makino J, Hiraki K, Inaba M. GRAPE-DR: 2-pflops massively-parallel computer with 512-core, 512-Gflops processor chips for scientific computing. In: Proceedings of the ACM\/IEEE Conference on Supercomputing, New York, 2007. 1\u201311"},{"key":"5131_CR5","first-page":"1","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing, Austin","author":"K J Barker","year":"2008","unstructured":"Barker K J, Davis K, Hoisie A, et al. Entering the petaflop era: the architecture and performance of roadrunner. In: Proceedings of the ACM\/IEEE Conference on Supercomputing, Austin, 2008. 1\u201311"},{"key":"5131_CR6","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/1016720.1016748","volume-title":"Proceedings of the 2nd IEEE\/ACM\/IFIP International Conference on Hardware\/software Codesign and System Synthesis, Stockholm","author":"M Verma","year":"2004","unstructured":"Verma M, Wehmeyer L, Marwedel P. Dynamic overlay of scratchpad memory for energy minimization. In: Proceedings of the 2nd IEEE\/ACM\/IFIP International Conference on Hardware\/software Codesign and System Synthesis, Stockholm, 2004. 104\u2013109"},{"key":"5131_CR7","first-page":"690","volume-title":"Proceedings of the 38th Conference on Design Automation, Las Vegas","author":"M Kandemir","year":"2001","unstructured":"Kandemir M, Ramanujam J, Irwin J, et al. Dynamic management of scratch-pad memory space. In: Proceedings of the 38th Conference on Design Automation, Las Vegas, 2001. 690\u2013695"},{"key":"5131_CR8","first-page":"329","volume-title":"Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques, Washington","author":"L Li","year":"2005","unstructured":"Li L, Gao L, Xue J L. Memory coloring: a compiler approach for scratchpad memory management. In: Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques, Washington, 2005. 329\u2013338"},{"key":"5131_CR9","first-page":"207","volume-title":"Proceedings of the ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, San Diego","author":"L Li","year":"2007","unstructured":"Li L, Nguyen Q-H, Xue J L. Scratchpad allocation for data aggregates in superperfect graphs. In: Proceedings of the ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, San Diego, 2007. 207\u2013216"},{"key":"5131_CR10","first-page":"1","volume":"6","author":"L Li","year":"2009","unstructured":"Li L, Feng H, Xue J L. Compiler-directed scratchpad memory management via graph coloring. ACM Trans Archit Code Optim, 2009, 6: 1\u201317","journal-title":"ACM Trans Archit Code Optim"},{"key":"5131_CR11","first-page":"28","volume":"10","author":"L Li","year":"2011","unstructured":"Li L, Xue J L, Knoop J. Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs. ACM Trans Embed Comput Syst, 2011, 10: 28","journal-title":"ACM Trans Embed Comput Syst"},{"key":"5131_CR12","first-page":"41","volume-title":"Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems, Beijing","author":"Q Wan","year":"2012","unstructured":"Wan Q, Wu H, Xue J L. WCET-aware data selection and allocation for scratchpad memory. In: Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems, Beijing, 2012. 41\u201350"},{"key":"5131_CR13","first-page":"98","volume-title":"Proceedings of the SIGPLAN Symposium on Compiler Construction, Boston","author":"G J Chaitin","year":"1982","unstructured":"Chaitin G J. Register allocation & spilling via graph coloring. In: Proceedings of the SIGPLAN Symposium on Compiler Construction, Boston, 1982. 98\u2013101"},{"key":"5131_CR14","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F C Chow","year":"1990","unstructured":"Chow F C, Hennessy J L. The priority-based coloring approach to register allocation. ACM Trans Program Lang Syst, 1990, 12: 501\u2013536","journal-title":"ACM Trans Program Lang Syst"},{"key":"5131_CR15","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P Briggs","year":"1994","unstructured":"Briggs P, Cooper K D, Torczon L. Improvements to graph coloring register allocation. ACM Trans Program Lang Syst, 1994, 16: 428\u2013455","journal-title":"ACM Trans Program Lang Syst"},{"key":"5131_CR16","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/229542.229546","volume":"18","author":"L George","year":"1996","unstructured":"George L, Appel A W. Iterated register coalescing. ACM Trans Program Lang Syst, 1996, 18: 300\u2013324","journal-title":"ACM Trans Program Lang Syst"},{"key":"5131_CR17","first-page":"277","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Washington","author":"M D Smith","year":"2004","unstructured":"Smith M D, Ramsey N, Holloway G. A generalized algorithm for graph-coloring register allocation. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Washington, 2004. 277\u2013288"},{"key":"5131_CR18","first-page":"161","volume-title":"Proceedings of the ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, Tucson","author":"L Wang","year":"2008","unstructured":"Wang L, Yang X J, Xue J L, et al. Optimizing scientific application loops on stream processors. In: Proceedings of the ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, Tucson, 2008. 161\u2013170"},{"key":"5131_CR19","first-page":"111","volume-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Raleigh","author":"X J Yang","year":"2009","unstructured":"Yang X J, Wang L, Xue J L, et al. Comparability graph coloring for optimizing utilization of stream register files in stream processors. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Raleigh, 2009. 111\u2013120"},{"key":"5131_CR20","first-page":"5","volume":"9","author":"X J Yang","year":"2012","unstructured":"Yang X J, Wang L, Xue J L, et al. Comparability graph coloring for optimizing utilization of software-managed stream register files for stream processors. ACM Trans Archit Code Optim, 2012, 9: 5","journal-title":"ACM Trans Archit Code Optim"},{"key":"5131_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/872732.806957","volume":"14","author":"J Fabri","year":"1979","unstructured":"Fabri J. Automatic storage optimization. SIGPLAN Not, 1979, 14: 83\u201391","journal-title":"SIGPLAN Not"},{"key":"5131_CR22","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: a Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co., 1979"},{"key":"5131_CR23","first-page":"907","volume-title":"Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia","author":"J Gergov","year":"1999","unstructured":"Gergov J. Algorithms for compile-time memory optimization. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 1999. 907\u2013908"},{"key":"5131_CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(91)90011-P","volume":"87","author":"H A Kierstead","year":"1991","unstructured":"Kierstead H A. A polynomial time approximation algorithm for dynamic storage allocation. Discrete Math, 1991, 87: 231\u2013237","journal-title":"Discrete Math"},{"key":"5131_CR25","first-page":"556","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego","author":"A L Buchsbaum","year":"2003","unstructured":"Buchsbaum A L, Karloff H, Kenyon C, et al. Opt versus load in dynamic storage allocation. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, 2003. 556\u2013564"},{"key":"5131_CR26","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/S0167-8191(98)00029-5","volume":"24","author":"V Lefebvre","year":"1998","unstructured":"Lefebvre V, Feautrier P. Automatic storage management for parallel programs. Parallel Comput, 1998, 24: 649\u2013671","journal-title":"Parallel Comput"},{"key":"5131_CR27","volume-title":"Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)","author":"M C Golumbic","year":"2004","unstructured":"Golumbic M C. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). Amsterdam: North-Holland Publishing Co., 2004"},{"key":"5131_CR28","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/jagm.1997.0891","volume":"26","author":"M B Squire","year":"1998","unstructured":"Squire M B. Generating the acyclic orientations of a graph. J Algorithms, 1998, 26: 275\u2013290","journal-title":"J Algorithms"},{"key":"5131_CR29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"V C Barbosa","year":"1999","unstructured":"Barbosa V C, Szwarcfiter J L. Generating all the acyclic orientations of an undirected graph. Inf Process Lett, 1999, 72: 71\u201374","journal-title":"Inf Process Lett"},{"key":"5131_CR30","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","volume":"5","author":"R P Stanley","year":"1973","unstructured":"Stanley R P. Acyclic orientations of graphs. Discrete Math, 1973, 5: 171\u2013178","journal-title":"Discrete Math"},{"key":"5131_CR31","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0607036","volume":"7","author":"N Linial","year":"1986","unstructured":"Linial N. Hard enumeration problems in geometry and combinatorics. SIAM J Algebr Discrete Methods, 1986, 7: 331\u2013335","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"5131_CR32","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ipl.2006.01.008","volume":"98","author":"S Hack","year":"2006","unstructured":"Hack S, Goos G. Optimal register allocation for ssa-form programs in polynomial time. Inf Process Lett, 2006, 98: 150\u2013155","journal-title":"Inf Process Lett"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5131-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5131-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5131-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:57Z","timestamp":1559403477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5131-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["5131"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5131-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,11]]}}}