Sciweavers

MEMOCODE
2008
IEEE

High-throughput Pipelined Mergesort

13 years 10 months ago
High-throughput Pipelined Mergesort
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a software implementation.
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Kha
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where MEMOCODE
Authors Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan, Muralidaran Vijayaraghavan
Comments (0)