{"_id":{"_str":"51f67df959ced8df44000cb5"},"__v":0,"authorIDs":[],"author_short":["Poss","Raphael `kena'"],"bibbaseid":"--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"poss12sl\"> </a>SL---a "quick and dirty" but working intermediate language for SVP systems.</span>\n\t<span class=\"bibbase_paper_author\">\nPoss; and Raphael `kena'</span>\n\t<!-- <span class=\"bibbase_paper_year\">2012</span>. -->\n</span>\n\n\nTechnical Report \narXiv:1208.4572v1 [cs.PL], University of Amsterdam, August 2012.\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012', 'http://arxiv.org/abs/1208.4572')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://arxiv.org/abs/1208.4572\"\n onclick=\"javascript:log_download('--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012', 'http://arxiv.org/abs/1208.4572')\">\n <img src=\"http://www.bibbase.org/img/filetypes/blank.png\"\n\t alt=\"SL---a "quick and dirty" but working intermediate language for SVP systems [.4572]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012', 'http://staff.science.uva.nl/~poss/pub/poss.12.sl.pdf')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://staff.science.uva.nl/~poss/pub/poss.12.sl.pdf\"\n onclick=\"javascript:log_download('--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012', 'http://staff.science.uva.nl/~poss/pub/poss.12.sl.pdf')\">\n <img src=\"http://www.bibbase.org/img/filetypes/pdf.png\"\n\t alt=\"SL---a "quick and dirty" but working intermediate language for SVP systems [.pdf]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Local</span></a> \n \n \n <a href=\"javascript:showBib('poss12sl')\">\n <img src=\"http://www.bibbase.org/img/filetypes/bib.png\" \n\t alt=\"SL---a "quick and dirty" but working intermediate language for SVP systems [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n \n\n \n \n \n \n \n\n \n <a class=\"bibbase_abstract_link\" href=\"javascript:showAbstract('poss12sl')\">Abstract</a>\n \n \n</span>\n\n<!-- -->\n<!-- <div id=\"abstract_poss12sl\"> -->\n<!-- Many-core architectures of the future are likely to have distributed memory organizations and need fine grained concurrency management to be used effectively. The Self-adaptive Virtual Processor (SVP) is an abstract concurrent programming model which can provide this, but the model and its current implementations assume a single address space shared memory. We investigate and extend SVP to handle distributed environments, and discuss a prototype SVP implementation which transparently supports execution on heterogeneous distributed memory clusters over TCP/IP connections, while retaining the original SVP programming model. -->\n<!-- </div> -->\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"--slaquickanddirtybutworkingintermediatelanguageforsvpsystems-2012","urls":{"Local":"http://staff.science.uva.nl/~poss/pub/poss.12.sl.pdf","Paper":"http://arxiv.org/abs/1208.4572"},"role":"author","year":"2012","urllocal":"pub/poss.12.sl.pdf","url":"http://arxiv.org/abs/1208.4572","type":"techreport","title":"SL---a \"quick and dirty\" but working intermediate language for SVP systems","read":"1","number":"arXiv:1208.4572v1 [cs.PL]","month":"August","key":"poss12sl","institution":"University of Amsterdam","id":"poss12sl","date-modified":"2013-03-21 08:45:13 +0100","date-added":"2012-08-22 20:50:48 +0200","bibtype":"techreport","bibtex":"@techreport{ poss12sl,\n abstract = {Many-core architectures of the future are likely to have distributed memory organizations and need fine grained concurrency management to be used effectively. The Self-adaptive Virtual Processor (SVP) is an abstract concurrent programming model which can provide this, but the model and its current implementations assume a single address space shared memory. We investigate and extend SVP to handle distributed environments, and discuss a prototype SVP implementation which transparently supports execution on heterogeneous distributed memory clusters over TCP/IP connections, while retaining the original SVP programming model. },\n author = {Poss, {Raphael `kena'}},\n date-added = {2012-08-22 20:50:48 +0200},\n date-modified = {2013-03-21 08:45:13 +0100},\n institution = {University of Amsterdam},\n month = {August},\n number = {arXiv:1208.4572v1 [cs.PL]},\n read = {1},\n title = {{SL}---a \"quick and dirty\" but working intermediate language for {SVP} systems},\n url = {http://arxiv.org/abs/1208.4572},\n urllocal = {pub/poss.12.sl.pdf},\n year = {2012}\n}","author_short":["Poss","Raphael `kena'"],"author":["Poss","Raphael `kena'"],"abstract":"Many-core architectures of the future are likely to have distributed memory organizations and need fine grained concurrency management to be used effectively. The Self-adaptive Virtual Processor (SVP) is an abstract concurrent programming model which can provide this, but the model and its current implementations assume a single address space shared memory. We investigate and extend SVP to handle distributed environments, and discuss a prototype SVP implementation which transparently supports execution on heterogeneous distributed memory clusters over TCP/IP connections, while retaining the original SVP programming model."},"bibtype":"techreport","biburl":"http://staff.science.uva.nl/~poss/pub.bib","downloads":0,"title":"SL---a \"quick and dirty\" but working intermediate language for SVP systems","year":2012,"dataSources":["6NgaDESeaHjBRZoZn"]}