一种用于非格式化数据处理的并行VLSI架构

Kuo-Chu Lee, O. Frieder, V. Mak
{"title":"一种用于非格式化数据处理的并行VLSI架构","authors":"Kuo-Chu Lee, O. Frieder, V. Mak","doi":"10.1109/DPDS.1988.675005","DOIUrl":null,"url":null,"abstract":"A novel, high performance subsystem for information retrieval called JAS is introduced. The JAS subsystem sustains gigabyte per second comparison rates due to its “early-out” CMOS substring search processor. The complexity of each JAS unit is independent of the complexity of the query. This query complexity independence is achieved via the utilization of a decoupled instruction set. The JAS subsystem architecture is described and the performance is evaluated.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Parallel VLSI Architecture For Unformatted Data Processing\",\"authors\":\"Kuo-Chu Lee, O. Frieder, V. Mak\",\"doi\":\"10.1109/DPDS.1988.675005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel, high performance subsystem for information retrieval called JAS is introduced. The JAS subsystem sustains gigabyte per second comparison rates due to its “early-out” CMOS substring search processor. The complexity of each JAS unit is independent of the complexity of the query. This query complexity independence is achieved via the utilization of a decoupled instruction set. The JAS subsystem architecture is described and the performance is evaluated.\",\"PeriodicalId\":390919,\"journal\":{\"name\":\"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DPDS.1988.675005\",\"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 [1988] International Symposium on Databases in Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DPDS.1988.675005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

介绍了一种新型的高性能信息检索子系统JAS。由于其“早出”CMOS子串搜索处理器,JAS子系统保持每秒千兆字节的比较速率。每个JAS单元的复杂性与查询的复杂性无关。这种查询复杂性独立性是通过使用解耦指令集实现的。介绍了JAS子系统体系结构,并对其性能进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Parallel VLSI Architecture For Unformatted Data Processing
A novel, high performance subsystem for information retrieval called JAS is introduced. The JAS subsystem sustains gigabyte per second comparison rates due to its “early-out” CMOS substring search processor. The complexity of each JAS unit is independent of the complexity of the query. This query complexity independence is achieved via the utilization of a decoupled instruction set. The JAS subsystem architecture is described and the performance is evaluated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信