{"id":66,"date":"2021-03-09T13:16:34","date_gmt":"2021-03-09T11:16:34","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~vniculescu\/?page_id=66"},"modified":"2021-03-09T21:35:15","modified_gmt":"2021-03-09T19:35:15","slug":"pares-a-model-for-parallel-recursive-programs","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/pares-a-model-for-parallel-recursive-programs\/","title":{"rendered":"PARES: A Model for Parallel Recursive Programs"},"content":{"rendered":"<p>PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs.<\/p>\n<p>Base on these theories a model of parallel computation with a very high level of abstraction is defined \u2013 PARES (Parallel Recursive Structures).<\/p>\n<p>A model of parallel computation, to be useful must address the following set of requirements:<\/p>\n<ul>\n<li>abstractness,<\/li>\n<li>software development methodology,<\/li>\n<li>architecture independence,<\/li>\n<li>cost measures,<\/li>\n<li>no preferred scale of granularity,<\/li>\n<li>efficiently implementable.<\/li>\n<\/ul>\n<p>It can be shown that all these requirements are fulfilled for the proposed model.<\/p>\n<p>Being defined based on well-defined theories, programs could be defined to be correct by construction, and also using proving tools assistants &#8211; as Coq &#8211; programs could be also automatically extracted from specifications.<\/p>\n<h2>Related Papers:<\/h2>\n<ul>\n<li>V. Niculescu. <i>PARES &#8211; A Model for Parallel Recursive Programs<\/i>, Romanian Journal of Information Science and Technology (ROMJIST), Ed. Academiei Romane, Volume 14(2011), No. 2, pp. 159\u2013182, 2011 (<a href=\"http:\/\/www.imt.ro\/romjist\/Volum14\/Number14_2\/pdf\/06-VNiculescu.pdf\" target=\"_blank\" rel=\"noopener\">.pdf<\/a>).<\/li>\n<li>Fr\u00e9d\u00e9ric Loulergue, Virginia Niculescu, Julien Tesson. <i>Implementing powerlists with Bulk Synchronous Parallel ML<\/i>. In 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC2014), Timisoara, Romania, 22-25 sept. 2014, IEEE Computer Society, 2014, pp 325-332. [<a href=\"http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=7034701\" target=\"_blank\" rel=\"noopener\">DOI<\/a> ]<\/li>\n<li>Fr\u00e9d\u00e9ric Loulergue, Virginia Niculescu, and Simon Robillard. <i>Powerlists in Coq: Programming and Reasoning<\/i>. In First International Symposium on Computing and Networking (CANDAR 2013) Matsuyama, Japan, Dec. 4-6, 2013, pages 57-65. IEEE Computer Society, 2013. [<a href=\"http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=6726879\" target=\"_blank\" rel=\"noopener\">DOI<\/a>].<\/li>\n<li>V. Niculescu. <i>Data-Distributions in PowerList Theory<\/i>. Lecture Notes in Computer Science Vol. 4711: Theoretical Aspects of Computing, Proceedings of ICTAC 2007, Springer-Verlag, 2007: 396-409 [<a href=\"http:\/\/link.springer.com\/chapter\/10.1007%2F978-3-540-75292-9_27\" target=\"_blank\" rel=\"noopener\">DOI<\/a>].<\/li>\n<li>V. Niculescu, A. Guran. <i>Efficient Recursive Parallel Programs for Polynomial Interpolation<\/i>. Studia Universitatis &#8220;Babes-Bolyai&#8221;, Informatica, Special Issue, Vol. LIV , 2009, pp. 227-230 (<a href=\"http:\/\/www.cs.ubbcluj.ro\/%7Estudia-i\/2009-kept\/Studia-2009-Kept-3-KSE.pdf\" target=\"_blank\" rel=\"noopener\">.pdf<\/a>).<\/li>\n<li>Niculescu, V., Guran, A., <i>Bounded Parallelism in PowerList and ParList Theories<\/i>, SYNASC 2009, Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, 2009, IEEE Society Press, pp. 237-244 (ISI &#8211; Conference Proceedings Citation Index).<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories a model of parallel computation with a very high level of abstraction is defined \u2013 PARES\u2026 <span class=\"read-more\"><a href=\"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/pares-a-model-for-parallel-recursive-programs\/\">Read More &raquo;<\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_links_to":"","_links_to_target":""},"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/pages\/66"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/comments?post=66"}],"version-history":[{"count":4,"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/pages\/66\/revisions"}],"predecessor-version":[{"id":72,"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/pages\/66\/revisions\/72"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~vniculescu\/wp-json\/wp\/v2\/media?parent=66"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}