Advertisement

Efficient Variable Allocation to Dual Memory Banks of DSPs

  • Viera Sipkova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2826)

Abstract

To improve the overall performance, many of the modern advanced digital signal processors (DSPs) are equipped with on-chip multiple data memory banks which can be accessed in parallel in one instruction. In order to effectively exploit this architectural feature, the compiler must partition program variables between the memory banks appropriately – two parallel memory accesses always must take place on different memory banks. There is some research work that addresses this issue, however, most of this has been proposed as a post-pass (machine dependent) optimization. We attempt to resolve this problem by applying an algorithm which operates on the high-level intermediate representation, independent of the target machine. The partitioning scheme is based on the concepts of the interference graph which is constructed utilizing the control flow, data flow, and alias information. Partitioning of the interference graph is modeled as a Max Cut problem. The variable partitioning algorithm has been designed as an optional optimization phase integrated in the C compiler for a digital signal processor. This paper describes our efforts. The experimental results demonstrate that our partitioning algorithm finds a fairly good assignment of variables to memory banks. For small kernels from the DSPstone benchmark suite the performance is improved from 10% to 20%, for FFT filters by about 10%.

Keywords

Memory Access Basic Block Digital Signal Processor Variable Partitioning Memory Bank 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Panis, C., Laure, G., Lazian, W., Krall, A., Grünbacher, H., Nurmi, J.: DSPxPlore – Design Space Exploration for a Configurable DSP Core. In: Proceedings of the GSPx, Dallas, Texas, USA (2003)Google Scholar
  2. 2.
    Leupers, R., Kotte, D.: Variable Partitioning for Dual Memory Bank DSPs. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ASSP), vol. 2, pp. 1121–1124 (2001)Google Scholar
  3. 3.
    Powell, D.B., Lee, E.A., Newman, W.C.: Direct Synthesis of Optimized DSP Assembly Code from Signal Flow Block Diagrams. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ASSP), vol. 5, pp. 553–556 (1992)Google Scholar
  4. 4.
    Saghir, M.A.R., Chow, P., Lee, C.G.: Automatic Data Partitioning for HLL DSP Compilers. In: Proceedings of the 6th International Conference on Signal Processing Applications and Technology, pp. I–866–871 (1995)Google Scholar
  5. 5.
    Saghir, M.A.R., Chow, P., Lee, C.G.: Exploiting Dual Data-Memory Banks inDigital Signal Processor. In: ACM SIGOPS Operating Systems Review, Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 30(5), pp. 234–243 (1996)Google Scholar
  6. 6.
    Sudarsanam, A., Malik, S.: Memory Bank and Register Allocation in Software Synthesis for ASIPs. In: Proceedings of the IEEE/ACM International Conference on Computer Aided Design, pp. 388–392 (1995)Google Scholar
  7. 7.
    Sudarsanam, A., Malik, S.: Simultaneous Reference Allocation in Code Generation for Dual Data Memory Bank ASIPs. Journal of the ACM Transactions on Automation of Electronic Systems (TODAES) 5, 242–264 (2000)CrossRefGoogle Scholar
  8. 8.
    Cho, J., Paek, Y., Whalley, D.: Efficient Register and Memory Assignment for Non-orthogonal Architectures via Graph Coloring and MST Algorithm. In: Proceedings of the International Conference on the LCTES and SCOPES, Berlin, Germany (2002)Google Scholar
  9. 9.
    Zhuang, X., Pande, S., Greenland, J.S.: A Framework for Parallelizing Load/Stores on Embedded Processors. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), Virginia (2002)Google Scholar
  10. 10.
    Zhuge, Q., Xiao, B., Sha, E.H.-M.: Variable Partitioning and Scheduling of Multiple Memory Architectures for DSP. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2002)Google Scholar
  11. 11.
    Sahni, S., Gonzales, T.: P-complete Approximation Problems. Journal of the ACM 23, 555–565 (1976)zbMATHCrossRefGoogle Scholar
  12. 12.
    Goemans, M.X., Williamson, D.P.: 0.878-Approximation Algorithms for MAXCUT and MAX 2SAT. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 422–431 (1994)Google Scholar
  13. 13.
    Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for MAX CUT and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42, 1115–1145 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Frieze, A., Jerrum, M.: Improved Approximation Algorithms for Max k-Cut and Max Bisection. Algorithmica 18, 61–77 (1997)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Hromkovic, J.: Algorithmics for Hard Problems. Springer, Berlin (2001)Google Scholar
  16. 16.
    Fujisawa, K., Kojima, M., Nakata, K., Yamashita, M.: SDPA (Semidefinite Programming Algorithm), vers. 4.10, Research Report on Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan (1998)Google Scholar
  17. 17.
    Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs. SIAM Journal on Optimization 12, 503–521 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Burer, S., Monteiro, R.D.C., Zhang, Y.: CirCut vers. 1.0612, Fortran 90 Package for Finding Approximate Solutions of Certain Binary Quadratic Programs (2000)Google Scholar
  19. 19.
    Zivojnovic, V., Velarde, J.M., Schager, C., Meyr, H.: DSPstone – A DSP oriented Benchmarking Methodology. In: Proceedings of the 6th International Conference on Signal Processing Applications and Technology (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Viera Sipkova
    • 1
  1. 1.CD-Lab Compilation Techniques for Embedded Processors, Institut für ComputersprachenTechnische Universität WienViennaAustria

Personalised recommendations