{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:07:56Z","timestamp":1743102476008,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":26,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461468585"},{"type":"electronic","value":"9781461468592"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-6859-2_41","type":"book-chapter","created":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T16:35:53Z","timestamp":1371659753000},"page":"1335-1375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Polyhedral Process Networks"],"prefix":"10.1007","author":[{"given":"Sven","family":"Verdoolaege","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,10]]},"reference":[{"key":"41_CR1","volume-title":"The SUIF compiler for scalable parallel machines","author":"S.P. Amarasinghe","year":"1995","unstructured":"Amarasinghe, S.P., Anderson, J.M., Lam, M.S., Tseng, C.W.: The SUIF compiler for scalable parallel machines. In: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing (1995)"},{"key":"41_CR2","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT \u201904: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, pp. 7\u201316. IEEE Computer Society, Washington, DC, USA (2004). DOI\u00a010.1109\/PACT. 2004.11"},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1109\/TVLSI.2008.2002049","volume":"17","author":"P. Clauss","year":"2009","unstructured":"Clauss, P., Fern\u00e1ndez, F.J., Gabervetsky, D., Verdoolaege, S.: Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 17, 983\u2013996 (2009)","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Cook, W., Rutherford, T., Scarf, H.E., Shallcross, D.F.: An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing 5(2) (1993)","DOI":"10.1287\/ijoc.5.2.206"},{"issue":"10","key":"41_CR5","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/TC.2005.167","volume":"54","author":"A. Darte","year":"2005","unstructured":"Darte, A., Schreiber, R., Villard, G.: Lattice-based memory allocation. IEEE Trans. Comput. 54(10), 1242\u20131257 (2005). DOI\u00a010.1109\/TC.2005. 167","journal-title":"IEEE Trans. Comput."},{"key":"41_CR6","unstructured":"Devos, H., Van\u00a0Campenhout, J., Stroobandt, D.: Finding bounds on ehrhart quasi-polynomials. In: Architecture and Compilers for Embedded Systems (ACES 2007), Edegem. 2007 (2007). DOI\u00a01854\/11101"},{"issue":"3","key":"41_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","volume":"22","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Parametric integer programming. Operationnelle\/Operations Research 22(3), 243\u2013268 (1988)","journal-title":"Operationnelle\/Operations Research"},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. International Journal of Parallel Programming 20(1), 23\u201353 (1991)","journal-title":"International Journal of Parallel Programming"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Geilen, M., Basten, T.: Kahn process networks and a reactive extension. In: S.S. Bhattacharyya, E.F. Deprettere, R.\u00a0Leupers, J.\u00a0Takala (eds.) Handbook of Signal Processing Systems, second edn. Springer (2013)","DOI":"10.1007\/978-1-4614-6859-2_32"},{"key":"41_CR10","unstructured":"Grosser, T., Zheng, H., A, R., Simb\u00fcrger, A., Gr\u00f6sslinger, A., Pouchet, L.N.: Polly - polyhedral optimization in LLVM. In: First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911). Chamonix, France (2011)"},{"key":"41_CR11","unstructured":"Kahn, G.: The semantics of a simple language for parallel programming. In: Proc. of the IFIP Congress 74, pp. 471\u2013475. North-Holland Publishing Co. (1974)"},{"key":"41_CR12","volume-title":"The Omega library","author":"W. Kelly","year":"1996","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega library. Tech. rep., University of Maryland (1996)"},{"key":"41_CR13","unstructured":"Kelly, W., Pugh, W., Rosser, E.: Code generation for multiple mappings. In: Frontiers\u201995 Symposium on the Frontiers of Massively Parallel Computation. McLean (1995)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Kienhuis, B., Rijpkema, E., Deprettere, E.: Compaan: Deriving process networks from Matlab for embedded signal processing architectures. In: CODES \u201900: Proceedings of the eighth international workshop on Hardware\/software codesign, pp. 13\u201317. ACM Press, New York, NY, USA (2000). DOI\u00a010.1145\/334012.334015","DOI":"10.1145\/334012.334015"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Meijer, S., Nikolov, H., Stefanov, T.: Throughput modeling to evaluate process merging transformations in polyhedral process networks. In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE \u201910, pp. 747\u2013752. European Design and Automation Association, 3001 Leuven, Belgium (2010)","DOI":"10.1109\/DATE.2010.5456953"},{"key":"41_CR16","unstructured":"Meister, B., Verdoolaege, S.: Polynomial approximations in the polytope model: Bringing the power of quasi-polynomials to the masses. In: J.\u00a0Sankaran, T.\u00a0Vander\u00a0Aa (eds.) Digest of the 6th Workshop on Optimization for DSP and Embedded Systems, ODES-6 (2008)"},{"key":"41_CR17","unstructured":"Pop, S., Cohen, A., Bastoul, C., Girbal, S., Jouvelot, P., Silber, G.A., Vasilache, N.: Graphite: Loop optimizations based on the polyhedral model for GCC. In: 4th GCC Developer\u2019s Summit. Ottawa, Canada (2006)"},{"key":"41_CR18","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer (2003)"},{"key":"41_CR19","volume-title":"Proceedings of HPEC 2006, 10th Annual Workshop on High Performance Embedded Computing","author":"E. Schweitz","year":"2006","unstructured":"Schweitz, E., Lethin, R., Leung, A., Meister, B.: R-stream: A parametric high level compiler. In: J.\u00a0Kepner (ed.) Proceedings of HPEC 2006, 10th Annual Workshop on High Performance Embedded Computing. Lincoln Labs, Lexington, MA (2006)"},{"key":"41_CR20","unstructured":"Turjan, A.: Compaan - A Process Network Parallelizing Compiler. VDM Verlag (2008)"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S.: isl: An integer set library for the polyhedral model. In: K.\u00a0Fukuda, J.\u00a0Hoeven, M.\u00a0Joswig, N.\u00a0Takayama (eds.) Mathematical Software - ICMS 2010, Lecture Notes in Computer Science, vol. 6327, pp. 299\u2013302. Springer (2010)","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"41_CR22","unstructured":"Verdoolaege, S.: Counting affine calculator and applications. In: First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911). Chamonix, France (2011)"},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/ b107108","volume-title":"Proceedings of 14th International Conference on Compiler Construction, Edinburgh, Scotland, Lecture Notes in Computer Science","author":"S. Verdoolaege","year":"2005","unstructured":"Verdoolaege, S., Beyls, K., Bruynooghe, M., Catthoor, F.: Experiences with enumeration of integer projections of parametric polytopes. In: R.\u00a0Bodik (ed.) Proceedings of 14th International Conference on Compiler Construction, Edinburgh, Scotland, Lecture Notes in Computer Science, vol. 3443, pp. 91\u2013105. Springer-Verlag, Berlin (2005). DOI\u00a010.1007\/ b107108"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Nikolov, H., Stefanov, T.: pn: A tool for improved derivation of process networks. EURASIP Journal on Embedded Systems, special issue on Embedded Digital Signal Processing Systems 2007 (2007). DOI\u00a010.1155\/2007\/75947","DOI":"10.1155\/2007\/75947"},{"issue":"1","key":"41_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S. Verdoolaege","year":"2007","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica 48(1), 37\u201366 (2007). DOI\u00a010.1007\/ s00453-006-1231-0","journal-title":"Algorithmica"},{"key":"41_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Springer-Verlag, Berlin (1995)"}],"container-title":["Handbook of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-6859-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T16:37:21Z","timestamp":1675960641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-6859-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461468585","9781461468592"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-6859-2_41","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"10 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}