Advertisement

Dynamic Memory Oriented Transformations in the MPEG4 IM1-Player on a Low Power Platform

  • P. Marchal
  • C. Wong
  • A. Prayati
  • N. Cossement
  • F. Catthoor
  • R. Lauwereins
  • D. Verkest
  • H. De Man
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2008)

Abstract

In this paper we propose several system-level transformations that allow to reduce the dynamic memory requirements of complex real-time multimedia systems. We demonstrate these transformations on the protocol layer of the MPEG4 IM1-player. As a consequence, up to 20% of the global power consumption of the protocol subsystem can be eliminated, which is significant due to the programmable processor target. The entire MPEG4 description is assumed to be mapped on a heterogeneous platform combining several software processors and hardware accelerators.

Keywords

Dynamic Memory Hardware Accelerator Garbage Collector Compression Layer Loop Transformation 
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.
    P. Marchal et al., “Large Impact of task-level concurrency transformations on the MPEG4 IM1 player for weakly parallel processor platforms”, Proc. PACT, Philadelphia PA, USA, Oct. 2000.Google Scholar
  2. 2.
    C. Ykman-Couvreur et al., “Stepwise Exploration and Specification Refinement of Telecom Network Systems”, accepted for IEEE Trans. on VLSI Systems, Vol.8, 2000.Google Scholar
  3. 3.
    F. Catthoor et al., “System-level data-flow transformation exploration and powerarea trade-offs demonstrated on video codecs”, special issue on “Systematic tradeoff analysis in signal processing systems design” (eds. M. Ibrahim, W. Wolf) in Journal of VLSI Signal Processing, Vol.18, No.1, Kluwer, Boston, pp.39–50, 1998.Google Scholar
  4. 4.
    F. Catthoor et al., “System-level data-flow transformations for power reduction in image and video processing”, Proc. Intnl. Conf. on Electronic Circuits and Systems, Greece, pp.1025–1028, Oct. 1996.Google Scholar
  5. 5.
    U. Banerjee, “Loop Transformations for Restructuring Compilers: the Foundations”, Kluwer, Boston, 1993.Google Scholar
  6. 6.
    A. Prayati et al., “Task concurrency management experiment for power-efficient speed-up of embedded MPEG4 player”, Proc. ICPP, Toronto, Canada, Aug. 2000.Google Scholar
  7. 7.
    N. Cossement et al., “DF*: An extension of synchronous dataflow with data dependency and non-determinism” accepted for Forum on Design Languages (FDL), Tuebingen, Germany, Sep. 2000.Google Scholar
  8. 8.
    “Information technology-Coding of audio-visual objects-Part 1: Systems” ISO/IEC 14496-1:1999(E) Google Scholar
  9. 9.
    B. Dave et al., “COHRA: hardware-software cosynthesis of hierarchical heterogeneous distributed embedded systems”,IEEE Trans. on Comp.-aided Design, Vol.CAD-17, No.10, pp.900–919, Oct. 1998.CrossRefGoogle Scholar
  10. 10.
    S. Ha et al., “Compile-time scheduling of dynamic constructs in dataflow program graphs”, IEEE Trans. on Computers, Vol.C-47, No.7, pp.768–778, July 1997.CrossRefMathSciNetGoogle Scholar
  11. 11.
    I. Hong et al. “On-line scheduling of hard real-time tasks on variable voltage processor”, Proc. IEEE Int. Conf. on Comp. Aided Design, Santa Clara CA, pp.653–656, Nov. 1998.Google Scholar
  12. 12.
    K. Konstantinides et al. “Task allocation and scheduling models for multi-processor digital signal processing”, IEEE Trans. on Acoustics, Speech and Signal Processing, Vol.ASSP–38, No.12, pp.2151–2161, Dec. 1990.CrossRefGoogle Scholar
  13. 13.
    Y. Li et al.,, “Scheduling and allocation of single-chip multi-processors for multimedia”, Proc. IEEE Wsh. on Signal Processing Systems (SIPS), Leicester, UK, pp.97–106, Nov. 1997.Google Scholar
  14. 14.
    F. Catthoor et al., “Proposal for unified system design meta flow in task-level and instruction-level design technology research for multi-media applications”, Proc.ACM/IEEE Intnl. Symp. on System-Level Synthesis, Hsinchu, Taiwan, pp.89–95, Dec. 1998.Google Scholar
  15. 15.
    S. Sriram et al., “Determining the order of processor transactions in statically scheduled multiprocessors”, Journal of VLSI Signal Processing, No.15, Kluwer, Boston, pp.207–220, 1997.Google Scholar
  16. 16.
    F. Thoen et al., “Modeling, Verification and Exploration of Task-level Concurrency in Real-Time Embedded Systems”, ISBN 0-7923-7737-0, Kluwer Acad. Publ., Boston, 1999.Google Scholar
  17. 17.
    P. Eles et al., “Scheduling of conditional process graphs for the synthesis of embedded systems”, Proc. 1st ACM/IEEE Design and Test in Europe Conf., Paris, France, pp.132–138, Feb. 1998.Google Scholar
  18. 18.
    R. Dick et al., “CORDS: hardware-software co-synthesis of reconfigurable real-time distributed embedded systems”, Proc. IEEE Int. Conf. Comp. Aided Design, Santa Clara CA, pp.62–68, Nov. 1998.Google Scholar
  19. 19.
    P. Hoang et al., “Scheduling of DSP programs onto multiprocessors for maximum throughput”, IEEE Trans. on Signal Processing, Vol.SP-41, No.6, pp.2225–2235, June 1993.CrossRefGoogle Scholar
  20. 20.
    W.H. Lee et al., “An efficient dynamic memory allocation policy based on empirical investigations”, Midwest Society Programming Languages and Systems Workshop,Chicago, IL,Oct. 9, 1999Google Scholar
  21. 21.
    J.M. Chang et al., “A high-performance memory allocator for object-oriented systems”, in IEEE Trans. on Comp., Vol.45, No.3, pp.357–366, 1996zbMATHCrossRefGoogle Scholar
  22. 22.
    J.M. Chang et al, “Measuring Dynamic Memory Invocations in Object-oriented Programs”, Proc. IEEE Int. Conf. Computers and Communications, Phoenix AZ, Feb. 10-12, 1999. pp. 268–274Google Scholar
  23. 23.
    B. Zorn, D. Grunwald, “Empirical measurements of six allocation intensive C Programs”, Technical Report CU-CS-604-92, Department of computer science, Univ. of Colorado, Boulder CO, July, 1992Google Scholar
  24. 24.
    P.R. Wilson et al., “Dynamic storage allocation: a survey and critical review”, Technical Report, Department of computer science, Univ. of Texas, Austin TX, pp.5–32, 1995Google Scholar
  25. 25.
    J.L. da Silva Jr. et al., “Efficient system exploration and synthesis of applications with dynamic data storage and intensive data transfer.” Proceedings of the Design Automation Conference, June 1998.Google Scholar
  26. 26.
    F. Catthoor et al., Custom Memory Management Methodology-Exploration of Memory Organisation for Embedded Multimedia System Design. Kluwer Academic, Boston, 1998Google Scholar
  27. 27.
    K.D. Nilsen et al., “The real-time behavior of dynamic memory management in C++”, Proc. IEEE Real-Time Technology and Application Symposium, Chicago IL, May 1995Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • P. Marchal
    • 1
    • 2
  • C. Wong
    • 1
    • 2
  • A. Prayati
    • 3
  • N. Cossement
    • 2
  • F. Catthoor
    • 1
    • 2
  • R. Lauwereins
    • 2
  • D. Verkest
    • 1
  • H. De Man
    • 1
    • 2
  1. 1.IMECLeuvenBelgium
  2. 2.K.U.Leuven-ESATLeuvenBelgium
  3. 3.Department of Electrical and Computer EngineeringUniversity of PatrasGreece

Personalised recommendations