{"title":"Visual programming by transaction network","authors":"T.D. Kimura","doi":"10.1109/HICSS.1988.11863","DOIUrl":null,"url":null,"abstract":"A parallel computation model is introduced that is suitable for pursuit of large-scale concurrency. The goal is to develop a semantically clean paradigm for distributed computation with fine-grained parallelism. The approach taken is to promote the notion of transaction, an anonymous atomic action void of internal state, as the basic element of computation. A computation is organized as a network, called a transaction net, of databases connected by transactions. A transaction, when it is fired, consumers data objects from source databases and produces data objects in target databases as an atomic action. A transaction net is akin to a Petri net, where the token, the place, and the transition corresponds to the data, the database, and the transaction, respectively. The state of computation is represented by the data state without the control state. An informal definition of the model is given. Solutions are given for well-known programming problems.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1988.11863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
A parallel computation model is introduced that is suitable for pursuit of large-scale concurrency. The goal is to develop a semantically clean paradigm for distributed computation with fine-grained parallelism. The approach taken is to promote the notion of transaction, an anonymous atomic action void of internal state, as the basic element of computation. A computation is organized as a network, called a transaction net, of databases connected by transactions. A transaction, when it is fired, consumers data objects from source databases and produces data objects in target databases as an atomic action. A transaction net is akin to a Petri net, where the token, the place, and the transition corresponds to the data, the database, and the transaction, respectively. The state of computation is represented by the data state without the control state. An informal definition of the model is given. Solutions are given for well-known programming problems.<>