数据流计算机中动态流处理的改进

V. Lakshmi, C. Arnold
{"title":"数据流计算机中动态流处理的改进","authors":"V. Lakshmi, C. Arnold","doi":"10.1109/ICAPP.1995.472306","DOIUrl":null,"url":null,"abstract":"This paper presents a new method of implementing dynamic streams of streams using token relabelling which reduces the complexity and drawbacks of the previously proposed method due to Gaudiot. Consider a sequence of tokens, Vi/sub [ui]/, which will appear in sequence on the stream-carrying arc. Two tokens Va/sub [ux]/ and Vb/sub [uy]/, will be considered belonging to the same stream if they have the same context: [ux]=[uy]. Elements within a stream are ordered according to the sequence in time that they appear on the arc. Let the highest level of streams has the context [uO], that of the surrounding block. Thus the highest level stream is the sequence of values Vi/sub [uO]/. Each element of this stream has as its value a unique context, namely, that of the stream that it represents. So the token Vi/sub [uO]/ identifies as a stream the sequence of tokens whose context is [Vi].<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improvement to dynamic stream handling in dataflow computers\",\"authors\":\"V. Lakshmi, C. Arnold\",\"doi\":\"10.1109/ICAPP.1995.472306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method of implementing dynamic streams of streams using token relabelling which reduces the complexity and drawbacks of the previously proposed method due to Gaudiot. Consider a sequence of tokens, Vi/sub [ui]/, which will appear in sequence on the stream-carrying arc. Two tokens Va/sub [ux]/ and Vb/sub [uy]/, will be considered belonging to the same stream if they have the same context: [ux]=[uy]. Elements within a stream are ordered according to the sequence in time that they appear on the arc. Let the highest level of streams has the context [uO], that of the surrounding block. Thus the highest level stream is the sequence of values Vi/sub [uO]/. Each element of this stream has as its value a unique context, namely, that of the stream that it represents. So the token Vi/sub [uO]/ identifies as a stream the sequence of tokens whose context is [Vi].<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472306\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种使用令牌重标记实现流的动态流的新方法,该方法降低了先前提出的方法由于高audiot而导致的复杂性和缺点。考虑一个令牌序列,Vi/sub [ui]/,它们将按顺序出现在承载流的弧上。如果两个令牌Va/sub [ux]/和Vb/sub [uy]/具有相同的上下文([ux]=[uy]),则它们将被认为属于同一流。流中的元素按照它们在弧上出现的时间顺序排序。让最高级别的流具有上下文[uO],即周围块的上下文。因此,最高级流是数值Vi/sub [uO]/序列。该流的每个元素的值都有一个唯一的上下文,即它所代表的流的上下文。因此,令牌Vi/sub [uO]/将上下文为[Vi]的令牌序列标识为流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improvement to dynamic stream handling in dataflow computers
This paper presents a new method of implementing dynamic streams of streams using token relabelling which reduces the complexity and drawbacks of the previously proposed method due to Gaudiot. Consider a sequence of tokens, Vi/sub [ui]/, which will appear in sequence on the stream-carrying arc. Two tokens Va/sub [ux]/ and Vb/sub [uy]/, will be considered belonging to the same stream if they have the same context: [ux]=[uy]. Elements within a stream are ordered according to the sequence in time that they appear on the arc. Let the highest level of streams has the context [uO], that of the surrounding block. Thus the highest level stream is the sequence of values Vi/sub [uO]/. Each element of this stream has as its value a unique context, namely, that of the stream that it represents. So the token Vi/sub [uO]/ identifies as a stream the sequence of tokens whose context is [Vi].<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信