{"title":"并行图形重写工具","authors":"S. Despréaux, A. Maignan","doi":"10.1109/SYNASC.2018.00021","DOIUrl":null,"url":null,"abstract":"GPaR is a parallel graph rewriting software implemented in C++ with a graphical user interface. Considering an initial graph g and a system of rewriting rules R = {li->ri, i = 1...n}, GPaR rewrites the graph g into a graph g' by using, simultaneously, the rules of R whose left-hand sides, li, match subgraphs of g. GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems. Our proposition is illustrated on the examples of adaptive mesh and Pythagorean tree. The performance of GPaR is compared to the performance of other tools on the Sierpinski triangle benchmark.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"26 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"GPaR: A Parallel Graph Rewriting Tool\",\"authors\":\"S. Despréaux, A. Maignan\",\"doi\":\"10.1109/SYNASC.2018.00021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"GPaR is a parallel graph rewriting software implemented in C++ with a graphical user interface. Considering an initial graph g and a system of rewriting rules R = {li->ri, i = 1...n}, GPaR rewrites the graph g into a graph g' by using, simultaneously, the rules of R whose left-hand sides, li, match subgraphs of g. GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems. Our proposition is illustrated on the examples of adaptive mesh and Pythagorean tree. The performance of GPaR is compared to the performance of other tools on the Sierpinski triangle benchmark.\",\"PeriodicalId\":273805,\"journal\":{\"name\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"26 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2018.00021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
GPaR是一个用c++实现的并行图形重写软件,具有图形用户界面。考虑一个初始图g和一个重写规则系统R = {li->ri, i = 1…n}, GPaR通过同时使用R的规则将图g重写为图g', R的左手边li匹配g的子图。GPaR解决了重叠匹配的问题,因此可以用于包括分形系统在内的各种重写问题。用自适应网格和毕达哥拉斯树的例子说明了我们的命题。将GPaR的性能与Sierpinski三角形基准测试上的其他工具的性能进行比较。
GPaR is a parallel graph rewriting software implemented in C++ with a graphical user interface. Considering an initial graph g and a system of rewriting rules R = {li->ri, i = 1...n}, GPaR rewrites the graph g into a graph g' by using, simultaneously, the rules of R whose left-hand sides, li, match subgraphs of g. GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems. Our proposition is illustrated on the examples of adaptive mesh and Pythagorean tree. The performance of GPaR is compared to the performance of other tools on the Sierpinski triangle benchmark.