This thesis is devoted to the investigation of prioritization mechanism for web based anomaly detection. We propose a hardware realization of parallel binary heap as an application of web based anomaly prioritization. The heap is implemented in pipelined fashion in FPGA platform. The propose design takes O(1) time for all operations by ensuring minimum waiting time between two consecutive operations. We present the various design issues and hardware complexity. We explicitly analyze the design trade-offs of the proposed priority queue implementations.
| Identifer | oai:union.ndltd.org:GEORGIA/oai:scholarworks.gsu.edu:cs_theses-1082 |
| Date | 09 May 2015 |
| Creators | Alam, Md Monjur |
| Publisher | ScholarWorks @ Georgia State University |
| Source Sets | Georgia State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Computer Science Theses |
Page generated in 0.0023 seconds