Conference paper

MATOUŠEK Jiří. Optimalizace vyhledání nejdelšího prefixu síťové adresy s využitím částečné dynamické rekonfigurace FPGA. In: Počítačové architektury a diagnostika. Milovy: Faculty of Information Technology, Czech Technical University, 2012, pp. 67-72. ISBN 978-80-01-05106-1.
Publication language:czech
Original title:Optimalizace vyhledání nejdelšího prefixu síťové adresy s využitím částečné dynamické rekonfigurace FPGA
Title (en):Optimization of Longest Prefix Match on Network Address Using Dynamic Partial Reconfiguration of FPGA
Pages:67-72
Proceedings:Počítačové architektury a diagnostika
Conference:Počítačové architektury a diagnostika 2012, PAD 2012
Place:Milovy, CZ
Year:2012
ISBN:978-80-01-05106-1
Publisher:Faculty of Information Technology, Czech Technical University
Files: 
+Type Name Title Size Last modified
iconpad2012.pdf224 KB2012-10-15 11:07:57
^ Select all
With selected:
Keywords
LPM, Tree Bitmap, FPGA
Annotation
This paper deals with optimizing longest prefix match operation implemented by Tree Bitmap algorithm. Optimizations are built around properties and possibilities of available FPGAs. The paper also contains a section about current status of my Ph.D. thesis research.
BibTeX:
@INPROCEEDINGS{
   author = {Ji{\v{r}}{\'{i}} Matou{\v{s}}ek},
   title = {Optimalizace vyhled{\'{a}}n{\'{i}} nejdel{\v{s}}{\'{i}}ho
	prefixu s{\'{i}}{\v{t}}ov{\'{e}} adresy s
	vyu{\v{z}}it{\'{i}}m {\v{c}}{\'{a}}ste{\v{c}}n{\'{e}}
	dynamick{\'{e}} rekonfigurace FPGA},
   pages = {67--72},
   booktitle = {Po{\v{c}}{\'{i}}ta{\v{c}}ov{\'{e}} architektury a
	diagnostika},
   year = {2012},
   location = {Milovy, CZ},
   publisher = {Faculty of Information Technology, Czech Technical
	University},
   ISBN = {978-80-01-05106-1},
   language = {czech},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso-8859-2?id=10138}
}

Your IPv4 address: 54.163.61.66
Switch to IPv6 connection

DNSSEC [dnssec]