Sukumar Ghosh, S. Bandyopadhyay, C. Mazumdar, S. Bhattacharya
{"title":"数据流模型中的递归处理","authors":"Sukumar Ghosh, S. Bandyopadhyay, C. Mazumdar, S. Bhattacharya","doi":"10.1145/800171.809621","DOIUrl":null,"url":null,"abstract":"Programs for dataflow machines often require efficient support for recursive procedure invocation to achieve high performance and programming flexibility. This paper discusses different methods presently used in contemporary dataflow models for handling recursion. Also, an alternative approach is proposed for handling recursion in token storage type of packet communication dataflow architecture.","PeriodicalId":218138,"journal":{"name":"ACM '84","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Handling of recursion in dataflow model\",\"authors\":\"Sukumar Ghosh, S. Bandyopadhyay, C. Mazumdar, S. Bhattacharya\",\"doi\":\"10.1145/800171.809621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Programs for dataflow machines often require efficient support for recursive procedure invocation to achieve high performance and programming flexibility. This paper discusses different methods presently used in contemporary dataflow models for handling recursion. Also, an alternative approach is proposed for handling recursion in token storage type of packet communication dataflow architecture.\",\"PeriodicalId\":218138,\"journal\":{\"name\":\"ACM '84\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '84\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800171.809621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '84","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800171.809621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Programs for dataflow machines often require efficient support for recursive procedure invocation to achieve high performance and programming flexibility. This paper discusses different methods presently used in contemporary dataflow models for handling recursion. Also, an alternative approach is proposed for handling recursion in token storage type of packet communication dataflow architecture.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
