Earticle

초록

영어

Bank switching in embedded processors having partitioned memory architecture results in code size as well as run time overhead. An algorithm and its application to assist the compiler in eliminating the redundant bank switching codes introduced and deciding the optimum data allocation to banked memory is presented in this work. A relation matrix formed for the memory bank state transition corresponding to each bank selection instruction is used for the detection of redundant codes. Data allocation to memory is done by considering all possible permutation of memory banks and combination of data. The compiler output corresponding to each data mapping scheme is subjected to a static machine code analysis which identifies the one with minimum number of bank switching codes. Even though the method is compiler independent, the algorithm utilizes certain architectural features of the target processor. A prototype based on PIC 16F87X microcontrollers is described. This method scales well into larger number of memory blocks and other architectures so that high performance compilers can integrate this technique for efficient code generation. The technique is illustrated with an example.

목차

Abstract
 1. Introduction
 2. Motivation and Approach
 3. Detection of Redundant Bank Switching Codes
  3.1 Relation Matrix Formulation
  3.2 Realization
  3.3 Tool Evaluation
 4. Optimization Technique
  4.1 Variable Partitioning
  4.2 Optimum Memory Bank Allocation
 5. Conclusion
 References

키워드

저자

• Mariamma Chacko [ Department of Ship Technology, Cochin University of Science and Technology, Cochin, India ]
• K. Poulose Jacob [ Department of Computer Science, Cochin University of Science and Technology, Cochin, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605