"Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD ..."

Yukito Ueno et al. (2020)

> Home

Details and statistics

DOI: 10.1109/NETSOFT48620.2020.9165306

access: closed

type: Conference or Workshop Paper

metadata version: 2020-08-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/netsoft/UenoNKE20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/netsoft/UenoNKE20
Yukito Ueno, Ryo Nakamura, Yohei Kuga, Hiroshi Esaki:
Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD Instructions. NetSoft 2020: 267-271

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.