{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T08:10:06Z","timestamp":1767168606716,"version":"build-2238731810"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02n03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2000,6]]},"abstract":"<jats:p>High level modeling and (quantitative) performance analysis of signal processing systems requires high level models for the applications (algorithms) and the implementations (architectures), a mapping of the former into the latter, and a simulator for fast execution of the whole. Signal processing algorithms are very often nested-loop algorithms with a high degree of inherent parallelism. This paper presents \u2013 for such applications \u2013 a suitable application model and a method to convert a given imperative executable specification to a specification in terms of this application model. The methods and tools are illustrated by means of an example.<\/jats:p>","DOI":"10.1142\/s0129626400000172","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T07:04:45Z","timestamp":1027753485000},"page":"165-176","source":"Crossref","is-referenced-by-count":7,"title":["DERIVING PROCESS NETWORKS FROM NESTED LOOP ALGORITHMS"],"prefix":"10.1142","volume":"10","author":[{"given":"EDWIN","family":"RIJPKEMA","sequence":"first","affiliation":[{"name":"Leiden University, Niels Bohrweg 1 2333 CA Leiden, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ED F.","family":"DEPRETTERE","sequence":"additional","affiliation":[{"name":"Leiden University, Niels Bohrweg 1 2333 CA Leiden, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BART","family":"KIENHUIS","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA 94720, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","first-page":"17","author":"Leijten Jeroen A.J.","year":"1997","journal-title":"Proc. ED&TC, Mar."},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1109\/VLSISP.1996.558379"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"p_6","first-page":"15","author":"Kienhuis Bart","year":"1998","journal-title":"Washington. Mar."},{"issue":"3","key":"p_13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","volume":"22","author":"Feautrier Paul","year":"1988","journal-title":"Recherche Operationelle; Operations Research"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008069920230"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626400000172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:44:29Z","timestamp":1565102669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626400000172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":6,"aliases":["10.1016\/s0129-6264(00)00017-2"],"journal-issue":{"issue":"02n03","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,6]]}},"alternative-id":["10.1142\/S0129626400000172"],"URL":"https:\/\/doi.org\/10.1142\/s0129626400000172","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}