Author:
Wang Li,Yang XueJun,Dai HuaDong
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Banakar R, Steinke S, Lee B-S, et al. Scratchpad memory: design alternative for cache on-chip memory in embedded systems. In: CODES’ 02: Proceedings of the 10th International Symposium on Hardware/Software Codesign. Estes Park: ACM, 2002. 73–78
2. Golumbic M C. Algorithmic Graph Theory and Perfect Graphs. 2nd ed. Amsterdam: North-Holland Publishing Co., 2004. 105–148
3. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co., 1979. 190–205
4. Li L, Nguyen Q H, Xue J L. Scratchpad allocation for data aggregates in superperfect graphs. In: Proceedings of the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems. San Diego: ACM, 2007. 207–216
5. Panda P R, Dutt N D, Nicolau A. Efficient utilization of scratch-pad memory in embedded processor applications. In: EDTC’97: Proceedings of the 1997 European Conference on Design and Test. Washington: IEEE Computer Society, 1997
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献