{"title":"Simulation of fine-grained parallel algorithms with the ALT (Animated Language Tools) system","authors":"Yuri Pogudin","doi":"10.1109/IDSRTA.1997.568654","DOIUrl":null,"url":null,"abstract":"Presents an experimental approach toward designing a language interface for fine-grained parallel algorithms simulation. The deep integration of graphical and textual elements at the level of the source code is its main characteristic. The behavior of simulated algorithms is visualized only in the terms of their source representation and in precise functional details at the same time. The mechanism of binding covers implements the basic concepts of the parallel substitution algorithm model. It makes interactive graphic forms serve not only to display data structures but also to describe some functional elements of the source code. The separation of the parallel algorithm scheme from graphical data objects and functions written in the C language is the principal method to implement such an approach. It provides direct opportunities for optimizing equivalent transformations.","PeriodicalId":117186,"journal":{"name":"Proceedings First International Workshop on Distributed Interactive Simulation and Real Time Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings First International Workshop on Distributed Interactive Simulation and Real Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDSRTA.1997.568654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Presents an experimental approach toward designing a language interface for fine-grained parallel algorithms simulation. The deep integration of graphical and textual elements at the level of the source code is its main characteristic. The behavior of simulated algorithms is visualized only in the terms of their source representation and in precise functional details at the same time. The mechanism of binding covers implements the basic concepts of the parallel substitution algorithm model. It makes interactive graphic forms serve not only to display data structures but also to describe some functional elements of the source code. The separation of the parallel algorithm scheme from graphical data objects and functions written in the C language is the principal method to implement such an approach. It provides direct opportunities for optimizing equivalent transformations.