Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan, M. Vijayaraghavan
{"title":"High-throughput Pipelined Mergesort","authors":"Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan, M. Vijayaraghavan","doi":"10.1109/MEMCOD.2008.4547704","DOIUrl":null,"url":null,"abstract":"We present an implementation of a high-throughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a software implementation.","PeriodicalId":221804,"journal":{"name":"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEMCOD.2008.4547704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
We present an implementation of a high-throughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a software implementation.