{"title":"DVispatch: a visual language with distributed rewriting","authors":"Kenji Miyamoto, Yasunori Harada","doi":"10.1109/VL.1998.706158","DOIUrl":null,"url":null,"abstract":"Our figure rewriting visual language is extended by a general method so that it rewrites figures distributed on multiple hosts. With this language, network applications or distributed systems can be built simply by drawing figures as a graphical code on a single host. At run time, the code is partitioned according to the number of target hosts and distributed on them. The partitioned code then starts running distributively and asynchronously, so as to simulate, as a whole, the behaviour of the code in the original single host language. Conversely speaking, a programmer can design and test the distributed behaviour of the program by working on the code on a single host. With rewriting rules reflecting the locality of operations, describing distributed systems in such a visual geometrical language makes it easy to grasp the topological structure of their algorithm. Furthermore, geometrical coding of distributed resources enables finer grained control of resources than the conventional models.","PeriodicalId":185794,"journal":{"name":"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE Symposium on Visual Languages (Cat. No.98TB100254)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VL.1998.706158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Our figure rewriting visual language is extended by a general method so that it rewrites figures distributed on multiple hosts. With this language, network applications or distributed systems can be built simply by drawing figures as a graphical code on a single host. At run time, the code is partitioned according to the number of target hosts and distributed on them. The partitioned code then starts running distributively and asynchronously, so as to simulate, as a whole, the behaviour of the code in the original single host language. Conversely speaking, a programmer can design and test the distributed behaviour of the program by working on the code on a single host. With rewriting rules reflecting the locality of operations, describing distributed systems in such a visual geometrical language makes it easy to grasp the topological structure of their algorithm. Furthermore, geometrical coding of distributed resources enables finer grained control of resources than the conventional models.