Abstract
The idea of Force-Directed Scheduling (FDS) was first introduced by Paulin and Knight [1] to minimize the number of resources required in the high-level synthesis of high-throughput ASICs. In the frame of our recent Data Transfer and Storage Exploration (DTSE) research [7],[15],[18], we have extended FDS for low-cost1 scheduling in real-time embedded system synthesis. We have shown that FDS is in fact a projected solution to a more general multi-dimensional space/time scheduling problem [19]. By using this reformulation and by introducing (very) low-complexity dynamic and clustering graph techniques [21], we have shown that the interactive design of low-cost but still high-throughput telecom networks, speech, image and video embedded systems is feasible using a runtime parameterizable Generalized Conflict-Directed Ordering (G-CDO(k)) algorithm. Because G-CDO(k) is based on a true multi-dimensional design space exploration mechanism, it is in principle able to analyze design bottlenecks with a much higher resolution than any other technique. In this paper, we develop novel multi-dimensional selection techniques to allow this powerful feature. Experiments of redesigning the large-scale and parallel Segment Protocol Processor (SPP) from Alcatel give promising results.
By low-cost embedded system, we refer to an embedded system exhibiting a good compromise between low-power, low-bandwidth, low-memory size (i.e. low-area) and also low-runtime (i.e. fast). In our DTSE methodology, this compromise is parameterizable and is a pragmatic choice left to the designer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. G. Paulin and J. P. Knight, “Force-Directed Scheduling in Automatic Data Path Synthesis”, Proc. 24th ACM/IEEE Design Automation Conf., Miami Beach, FL, IEEE Computer Society Press, pp. 195–202, June 1987.
I. Verbauwhede, F. Catthoor, J. Vandewalle, H. De Man, “Background memory management for the synthesis of algebraic algorithms on multi-processor DSP chips”, Proc. VLSI’89, Int. Conf. on VLSI, Munich, Germany, pp. 2098–2118, Aug. 1989.
P. Lippens, J. van Meerbergen, W. Verhaegh, A. van der Werf, “Allocation of multiport memories for hierarchical data streams”, Proc. IEEE Int. Conf. Comp. Aided Design, pp. 728–735, Santa Clara, Nov. 1993.
Lode Nachtergaele & al., “Optimization of memory organization and partitioning for decreased size and power in video and image processing systems”, IEEE Int. Workshop on Memory Technology, pp. 82–87, San Jose, CA, Aug. 1995.
N. Passos, E. Sha, “Push-up scheduling: optimal polynomial-time resource constrained scheduling for multi-dimensional applications”, Proc. IEEE Int. Conf. Comp. Aided Design, San Jose, CA, pp. 588–591, Nov. 1995.
W. Verhaegh, E. Aarts, J. Korst, P. Lippens, “Improved Force-Directed Scheduling (IFDS) in high-throughput digital signal processing”, IEEE Transactions on Computer-Aided Design, Vol. 14, p. 945–960, 1995.
S. Wuytack & al., “Flow Graph Balancing for Minimizing the Required Memory Bandwidth”, Proc. 9th ACM/IEEE Int. Symposium on System-Level Synthesis, La Jolla CA, pp.127–132, Nov. 1996.
Cosytec, “Application development with the CHIP system”, 1997. Available at: http://www.cosytec.fr/.
C. Schulte, “OzExplorer: A Visual Constraint Programming Tool”, Proc. 14th Int. Conf. on Logic Programming, Lee Naish (eds), MIT Press, Cambridge, pp. 286–300, July 1997.
Jurgen Teich, E. Zitzler, S. Bhattacharyya, “Optimized software synthesis for digital signal processing algorithms-an evolutionary approach”, Proc. 1998 IEEE Workshop on Signal Processing Systems (SiPS), 1998.
Q. Zhao, S. Karisch, F. Rendl, H. Wolkowicz, “Semidefinite programming relaxations for the quadratic assignment problem”, University of Waterloo Tech. Report CORR-95-27, University of Copenhagen DIKU TR-96/32, Feb. 1998.
P. R. Panda, N. D. Dutt, A. Nicolau, “Incorporating DRAM access modes into highlevel synthesis”, IEEE Trans. CAD Integrated Circuits and Systems, Vol. 17, No. 2, Feb. 1998.
C. Ancourt & al., “Automatic data mapping of signal processing applications”, ENSMP-CRI, UVSQ-PRiSM, Thomson CSF-LRC, 1998.
J. L. da Silva Jr. & al., “Efficient System Exploration and Synthesis of Applications with Dynamic Data Storage and Intensive Data Transfer”, Proc. 35th ACM/IEEE Design Automation Conf., pp. 76–81, 1998.
F. Catthoor & al., “Custom Memory Management Methodology-Exploration of Memory Organization for Embedded Multimedia System Design”, Kluwer Academic Publishers, ISBN 0-7923-8288-9, 1998.
A. Vandecappelle & al., “Global Multimedia System Design Exploration using Accurate Memory Organization Feedback”, Proc. 36th ACM/IEEE Design Automation Conf., pp. 327–332, June 1999.
E. Brockmeyer, S. Wuytack, A. Vandecappelle, F. Catthoor, “Low power storage cycle budget distribution for hierarchical graphs”, DATE Userforum, pp. 249–254, April 2000.
F. Catthoor, K. Danckaert, C. Kulkarni, T. Omnès, “Data transfer and storage architecture issues and exploration in modern DSPs”, Book chapter in Programmable Digital Signal Processors: Architecture, Programming, and Applications (ed. Y.H. Yu), Marcel Dekker, Inc., New York, 2000.
T. Omnès, T. Franzetti, F. Catthoor, “Interactive algorithms for minimizing memory bandwidth in high throughput telecom and multimedia”, Proc. 37th IEEE/ACM Design Automation Conf., pp. 328–331, June 2000.
Thierry Franzetti, “Survey of Scheduling Algorithms for the Design of Embedded Multimedia Systems”, Joint IMEC-Computer Science and Applied Mathematics Department of INP-ENSEEIHT internship report, June 2000.
T. Omnès, T. Franzetti, F. Catthoor, “Dynamic algorithms for minimizing memory bandwidth in high throughput telecom networks, speech, image and video embedded systems”, in special issue of Technique et Science Informatiques (TSI), Techniques de parallélisation automatique, C. Mongenet, S. Rajopadhye and Y. Robert (eds), Éditions Hermès, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omnès, T.JF., Franzetti, T., Catthoor, F. (2000). Multi-dimensional Selection Techniques for Minimizing Memory Bandwidth in High-Throughput Embedded Systems. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive