Pipelined Architecture for Multi-String Matching

Pipelined Architecture for Multi-String Matching
复制标题

用于多字符串匹配的流水线架构

DOI:
10.1109/l-ca.2008.5
复制
发表时间:
2008-07
影响因子:
2.3
通讯作者:
--
中科院分区:
计算机科学3区
文献类型:
--
作者:

文献摘要

参考文献

相似文献

这封信提出了一种新的不经意路由算法的3D网状网络称为随机部分最小(RPM)路由,可证明达到最佳的最坏情况下的吞吐量为3D网格网络时,网络基数fc是偶数和1/k2的最佳的因素,当k是奇数。虽然这个最优结果已经实现了最小路由算法OITURN的二维情况下,最坏情况下的吞吐量OITURN大大降低在更高的维度。其他现有的路由算法遭受较差的最坏情况吞吐量(DOR,ROMM)或较差的延迟(瓦尔)。另一方面,RPM实现了接近最佳的最坏情况和良好的平均情况吞吐量以及良好的延迟性能。
This letter presents a new oblivious routing algorithm for 3D mesh networks called randomized partially-minimal (RPM) routing that provably achieves optimal worst- case throughput for 3D meshes when the network radix fc is even and within a factor of 1/k2 of optimal when k is odd. Although this optimality result has been achieved with the minimal routing algorithm OITURN for the 2D case, the worst-case throughput of OITURN degrades tremendously in higher dimensions. Other existing routing algorithms suffer from either poor worst-case throughput (DOR, ROMM) or poor latency (VAL). RPM on the other hand achieves near optimal worst-case and good average-case throughput as well as good latency performance.
DOI: 10.1109/icnp.2006.320212
发表时间: 2006-11
期刊: Proceedings of the 2006 IEEE International Conference on Network Protocols
影响因子: --
作者:
M. Alicherry;M. Muthuprasanna;Vijay P. Kumar
通讯作者: M. Alicherry;M. Muthuprasanna;Vijay P. Kumar
DOI: 10.1109/fpl.2005.1515696
发表时间: 2005-10
期刊: International Conference on Field Programmable Logic and Applications, 2005.
影响因子: --
作者:
G. Papadopoulos;D. Pnevmatikatos
通讯作者: G. Papadopoulos;D. Pnevmatikatos
DOI: 10.1109/tvlsi.2007.912036
发表时间: 2008-02-01
影响因子: 2.8
作者:
Sourdis, Ioannis;Pnevmatikatos, Dionisios N.;Vassiliadis, Stamatis
通讯作者: Vassiliadis, Stamatis
DOI: 10.1109/infocom.2006.204
发表时间: 2006-04
期刊: Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
影响因子: --
作者:
J. V. Lunteren
通讯作者: J. V. Lunteren
DOI: 10.1109/infcom.2004.1354682
发表时间: 2004-03
期刊: IEEE INFOCOM 2004
影响因子: --
作者:
Nathan Tuck;T. Sherwood;B. Calder;G. Varghese
通讯作者: Nathan Tuck;T. Sherwood;B. Calder;G. Varghese