Abstract
Stream (data-flow) computing is considered an effective para-digm for parallel programming of high-end multi-core architectures for embedded applications (networking, multimedia, wireless communication). Our work addresses a key step in stream programming for embedded multicores, namely, the efficient mapping of a synchronous data-flow graph (SDFG) onto a multi-core platform subject to a minimum throughput requirement. This problem has been extensively studied in the past, and its complexity has lead researches to develop incomplete algorithms which cannot exclude false negatives. We developed a CP-based complete algorithm based on a new throughput-bounding constraint. The algorithm has been tested on a number of non-trivial SDFG mapping problems with promising results.
This is a preview of subscription content, log in via an institution to check access.
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
Lee, E., Messerschmitt, D.: Synchronous dataflow. Proceedings of the IEEE 75(9), 1235–1245 (1987)
Sriram, S., Bhattacharyya, S.: Embedded Multiprocessors Scheduling and Synchronization. Marcel Dekker, Inc., New York (2000)
Muller, M.: Embedded Processing at the Heart of Life and Style. In: IEEE ISSCC 2008, pp. 32–37 (2008)
Jerraya, A., et al.: Roundtable: Envisioning the Future for Multiprocessor SoC. IEEE Design & Test of Computers 24(2), 174–183 (2007)
Pham, D., et al.: Overview of the architecture, circuit design, and physical implementation of a first-generation cell processor. IEEE Journal of Solid-State Circuits 41(1), 179–196 (1996)
Paganini, M.: Nomadik: A Mobile Multimedia Application Processor Platform. In: IEEE ASP-DAC 2007, pp. 749–750 (2007)
Bell, S., et al.: TILE64 Processor: A 64-Core SoC with Mesh Interconnect. In: ISSCC 2008, pp. 88–598 (2008)
Lee, A., Bhattacharyya, S.S., Murthy, K.: Software synthesis from data flow graphs. Kluwer Academic Publishers, Dordrecht (1996)
Moreira, O., Poplavko, P., Pastrnak, M., Mesman, B., Mol, J.D., Stuijk, S., Gheoghita, V., Bekooij, M., Hoes, R., van Meerbergen, J.: Data Flow analysys for real-time embedded multiprocessor system design. In: Dynamic and robust streaming in and between connected consumer-electronic devices. Springer, Heidelberg (2005)
Lee, E.A., Messerschmitt, D.C.: Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. on Computers (Feburary 1987)
Sriram, S., Lee, E.: Determining the order of processor transactions in statically scheduled multiprocessors. Journal of VLSI Signal Processing 15, 207–220 (1996)
Moreira, O., Mol, J.D., Bekooij, M., van Meerbergen, J.: Multiprocessor Resource Allocation for Hard-Real Time Streaming with a Dynamic Job-Mix. In: IEEE RTAS 2005, pp. 332–341 (2005)
Geilen, M., Stuijk, S., Basten, T., Corporaal, H.: Multiprocessor resource allocation for throughput-constrained synchronous data flow graphs. In: DAC 2007 (2007)
Stuijk, S., Basten, T., Moonen, A., Bekooij, M., Theelen, B., Mousavi, M., Ghamarian, A., Geilen, M.: Throughput analysis of synchronous data flow graphs. Application of Concurrency to System Design (2006)
Ito, K., Parhi, K.K.: Determining the Minimum Iteration Period of an Algorithm. VLSI Signal Processing 11(3), 229–244 (1995)
Dasdan, A., Gupta, R.K.: Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Trans. on CAD of Integrated Circuits and Systems 17(10), 889–899 (1998)
Stuijk, S., Geilen, M., Basten, T.: Sdf3: sdf for free. In: Acsd 2006, pp. 276–278 (2006)
Goodacre, J., Sloss, A.N.: Parallelism and the ARM instruction set architecture. Computer 38(7), 42–50 (2005)
Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.M.: An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science 32, 12–29 (1998)
Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From precedence constraint posting to partial order schedules: a csp approach to robust scheduling. AI Commun. 20(3), 163–180 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonfietti, A., Lombardi, M., Milano, M., Benini, L. (2009). Throughput Constraint for Synchronous Data Flow Graphs. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-01929-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01928-9
Online ISBN: 978-3-642-01929-6
eBook Packages: Computer ScienceComputer Science (R0)