{"title":"用于搜索的缩放点积处理器","authors":"Amitava Biswas","doi":"10.1109/IS3C.2014.272","DOIUrl":null,"url":null,"abstract":"Dot product of large vectors is speed critical operation in a search engine. We present a dot product processor which can handle large vectors having 10000 components. Our architecture can finish computation in less than 80 clock cycles on average. This was achieved by a simpler circuitry instead of traditional Bloom Filters.","PeriodicalId":149730,"journal":{"name":"2014 International Symposium on Computer, Consumer and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Scaled-Up Dot Product Processor for Searching\",\"authors\":\"Amitava Biswas\",\"doi\":\"10.1109/IS3C.2014.272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dot product of large vectors is speed critical operation in a search engine. We present a dot product processor which can handle large vectors having 10000 components. Our architecture can finish computation in less than 80 clock cycles on average. This was achieved by a simpler circuitry instead of traditional Bloom Filters.\",\"PeriodicalId\":149730,\"journal\":{\"name\":\"2014 International Symposium on Computer, Consumer and Control\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Symposium on Computer, Consumer and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IS3C.2014.272\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Symposium on Computer, Consumer and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IS3C.2014.272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dot product of large vectors is speed critical operation in a search engine. We present a dot product processor which can handle large vectors having 10000 components. Our architecture can finish computation in less than 80 clock cycles on average. This was achieved by a simpler circuitry instead of traditional Bloom Filters.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
