مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

1,378
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

AN EFFICIENT METHOD FOR PARALLEL IMPLEMENTATION OF H-TRIE PACKET CLASSIFICATION ALGORITHM ON GPU

Pages

  181-196

Abstract

Href="/search/paper/PACKET CLASSIFICATION/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">PACKET CLASSIFICATION is a fundamental process in network processors. In this process, input packets are classified into distinct set of flows via matching against a set of filters. Software implementation of Href="/search/paper/PACKET CLASSIFICATION/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">PACKET CLASSIFICATION algorithms, though Having lower cost and more scalability as compared with Hardware implementations, are slower. In this paper, we use parallel processing capabilities of the graphical processors to accelerate Hierarchical-Trie Href="/search/paper/PACKET CLASSIFICATION/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">PACKET CLASSIFICATION algorithm and propose different scenarios based on the architecture of their global and shared memories. Results of implementing these scenarios, conforming computed time and memory complexities, show that the PERFORMANCE of the scenarios that divide the filter set into sub-trees, equal to/ smaller than the shared memory and copy them to it, is lower than that of a scenario which keeps the total data structure in the global memory. The PERFORMANCE of these scenarios increases by decreasing the number of sub-trees and duplicated filters. Moreover, a scenario that can keep Hierarchical tree and corresponding filters in shared memory, without any partitioning, is the best scenario. The experimental results show that, on a same GPU, this scenario attains a throughput of approximately 2.1 times compared to the existing methods.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    RAFIEE, M., ABBASI, M., & NASSIRI, M.. (2016). AN EFFICIENT METHOD FOR PARALLEL IMPLEMENTATION OF H-TRIE PACKET CLASSIFICATION ALGORITHM ON GPU. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, 46(3 (77)), 181-196. SID. https://sid.ir/paper/256459/en

    Vancouver: Copy

    RAFIEE M., ABBASI M., NASSIRI M.. AN EFFICIENT METHOD FOR PARALLEL IMPLEMENTATION OF H-TRIE PACKET CLASSIFICATION ALGORITHM ON GPU. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING[Internet]. 2016;46(3 (77)):181-196. Available from: https://sid.ir/paper/256459/en

    IEEE: Copy

    M. RAFIEE, M. ABBASI, and M. NASSIRI, “AN EFFICIENT METHOD FOR PARALLEL IMPLEMENTATION OF H-TRIE PACKET CLASSIFICATION ALGORITHM ON GPU,” TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, vol. 46, no. 3 (77), pp. 181–196, 2016, [Online]. Available: https://sid.ir/paper/256459/en

    Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top