| References: [1] Atri, Sunil., Ramanujam, Jagannathan., Kandemir, Mahmut T. (2000). Improving offset assignment on embedded processors using transformations. In Valero, Mateo, Prasanna, Viktor K.,Vajapeyam, Sriram (Eds.), Proc. of the 7th International Conference on High Performance Computing (HiPC’00), Bangalore, India, December 17–20, 2000, volume 1970 of Lecture Notes in Computer Science, pages 367–374. Springer. doi:10.1007/3-540-44467-X_33.
[2] Bartley, David H. (1992). Optimizing stack frame accesses for processors with restricted addressing modes. Software, Practice and Experience, 22(2), 101–110. doi:10.1002/ spe.4380220202.
[3] Burkard, Rainer E., Dell’Amico, Mauro, & Martello, Silvano. (2009). Assignment Problems. SIAM. Retrieved from http://www.ec-securehost.com/SIAM/OT106.html.
[4] Choi, Yoonseo., Kim, Taewhan. (2002). Address assignment combined with scheduling in DSP code generation. In: Proc. of the 39th Design Automation Conference (DAC’02), New Orleans, LA, USA, June 10–14, 2002, pages 225–230. ACM. doi:10.1145/513918.513975.
[5] Dantzig, George B., Fulkerson, David R., Johnson, Selmer M. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 3, 393–410.
[6] Dezso, Balázs.,Jüttner, Alpár., Kovács, Péter. (2011). LEMON - an open source C++ graph template library. Electr. Notes Theor. Comput. Sci., 264(5), 23–45. doi:10.1016/ j.entcs.2011.06.003.
[7] Gebotys, Catherine H. (1997). DSP address optimization using a minimum cost circulation technique. In Otten, Ralph H. J. M.,Yasuura, Hiroto (Eds.), Proc. of the 1997 IEEE/ACM International Conference on Computer-Aided Design (ICCAD’97), San Jose, CA, USA, November 9–13, 1997, pages 100–103. IEEE Computer Society / ACM. doi:10.1109/ICCAD.1997.643380.
[8] Gebotys, Catherine H. (1999). A minimum-cost circulation approach to DSP address-code generation. IEEE Trans. on CAD of Integrated Circuits and Systems, 18(6), 726–741. doi:10.1109/ 43.766724.
[9] Huynh, Johnny., Amaral, José Nelson., Berube, Paul., Touati, Sid Ahmed Ali. (2011). Evaluating address register assignment and offset assignment algorithms. ACM Trans. Embedded Comput. Syst., 10(3), 37. doi:10.1145/1952522.1952530.
[10] IBM. (2013). IBM ILOG CPLEX Optimization Studio Version 12.6.
[11] Jünger, Michael., Mallach, Sven. (2013). Solving the simple offset assignment problem as a traveling salesman. In Corporaal, Henk, &Stuijk, Sander (Eds.), Proceedings of the International Workshop on Software and Compilers for Embedded Systems (M-SCOPES’13), Sankt Goar, Germany, June 19–21, 2013 (pp. 31–39). ACM. doi:10.1145/2463596.2463601.
[12] Király, Zoltán., Kovács, Péter. (2012). Efficient implementations of minimum-cost flow algorithms. Acta Universitatis Sapientiae, Informatica, 4(1), 67–118. Retrieved from http:// www.acta.sapientia.ro/acta-info/C4-1/info41-5.pdf.
[13] Lawler, Eugene. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.
[14] Leupers, Rainer. (2003). Offset assignment showdown: Evaluation of DSP address code optimization algorithms. In Hedin, Görel (Ed.), Proceedings of the 12th International Conference on Compiler Construction (CC’03), held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS’03), Warsaw, Poland, April 7–11, 2003, volume 2622 of Lecture Notes in Computer Science (pp. 290–302). Springer. doi:10.1007/3-540-36579-6_21.
[15] Leupers, Rainer., David, Fabian. (1998). A uniform optimization technique for offset assignment problems. In Catthoor, Francky (Ed.), Proceedings of the 11th International Symposium on System Synthesis (ISSS’98), Hsinchu, Taiwan, December 2–4, 1998 (pp. 3–8). ACM / IEEE Computer Society. doi:10.1109/ISSS.1998.730589.
[16] Leupers, Rainer.,Marwedel, Peter. (1996). Algorithms for address assignment in DSP code generation. In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design (ICCAD’96) (pp. 109–112). doi:10.1109/ICCAD.1996.569409.
[17] Liao, Stan Yi-Huang. (1996). Code generation and optimization for embedded digital signal processors [PhD thesis, Massachusetts Institute of Technology]. Retrieved from http://hdl.handle.net/ 1721.1/11048.
[18] Mallach, Sven., Lozano, Roberto Castañeda. (2014). Optimal general offset assignment. In Corporaal, Henk., Stuijk, Sander (Eds.), Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems (SCOPES’14), Sankt Goar, Germany, June 10–11, 2014 (pp. 50–59). ACM. doi:10.1145/2609248.2609251.
[19] McCormick, Garth P. (1976). Computability of global solutions to factorable nonconvex programs: Part I – convex underestimating problems. Mathematical Programming, 10(1), 147– 175. doi:10.1007/BF01580665.
[20] Ozturk, Ozcan., Kandemir, Mahmut T., Tosun, Suleyman. (2006). An ILP based approach to address code generation for digital signal processors. In Qu, Gang, Ismail, Yehea I., Vijaykrishnan, Narayanan, & Zhou, Hai (Eds.), Proceedings of the 16th ACM Great Lakes Symposium on VLSI (GLSVLSI’06), Philadelphia, PA, USA, April 30–May 1, 2006 (pp. 37–42). ACM. doi:10.1145/ 1127908.1127919.
[21] Padberg, Manfred., Rinaldi, Giovanni. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33(1), 60–100. doi:10.1137/ 1033004.
[22] Padberg, Manfred W., Rao, Mendu R. (1982). Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, 7(1), 67–80. URL: http://www.jstor.org/stable/3689360.
[23] Rao, Amit., Pande, Santosh. (1999). Storage assignment optimizations to generate compact and efficient code on embedded DSPs. In Ryder, Barbara G., & Zorn, Benjamin G. (Eds.), Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’99), Atlanta, Georgia, USA, May 1–4, 1999 (pp. 128–138). ACM. doi:10.1145/ 301618.301653.
[24] Sugino, Nobuhiko., Iimuro, Satoshi., Nishihara, Akinori., Fujii, Nobuo. (1996). DSP code optimization utilizing memory addressing operation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 79(8), 1217–1224.
[25] Wess, Bernhard.,Gotschlich, Martin. (1997). Optimal DSP memory layout generation as a quadratic assignment problem. In: Proceedings of the 1997 IEEE International Symposium on Circuits and Systems (ISCAS’97), volume 3, pages 1712–1715. doi:10.1109/ISCAS.1997.621465. |
Author Rights 
