Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Marziyeh Nourian"'
Publikováno v:
2022 IEEE International Conference on Big Data (Big Data).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f59ffd204321b0db0eb8e8e4221d5f8
https://doi.org/10.1109/bigdata55660.2022.10020756
https://doi.org/10.1109/bigdata55660.2022.10020756
Publikováno v:
IEEE Transactions on Computers. 68:1201-1212
In this paper, we study the acceleration of applications that identify all the occurrences of thousands of string-patterns in an input data-stream using the Automata Processor (AP). For this evaluation, we use two applications from two fields, namely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f4358bd2ad17f8ba623bc3524817473
https://doi.org/10.1109/tc.2019.2901466
https://doi.org/10.1109/tc.2019.2901466
Publikováno v:
ICPADS
Automata processing is at the core of many pattern matching applications. Previous efforts have proposed designs to accelerate automata traversal on various parallel platforms. Many existing acceleration methods store the finite automata states and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ba71fdf4b8c12f2148b68cdc65a2261
https://doi.org/10.1109/padsw.2018.8644852
https://doi.org/10.1109/padsw.2018.8644852
Publikováno v:
HiPC
Several applications from computational linguistic and genomics perform similarity analysis between sequences of characters based on Hamming and Levenshtein distance measures. Hamming and Levenshtein distance-based matching maps well onto non-determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d107c068043a97574f8110983f62df10
https://doi.org/10.1109/hipc.2017.00053
https://doi.org/10.1109/hipc.2017.00053
Publikováno v:
ICS
Many established and emerging applications perform at their core some form of pattern matching, a computation that maps naturally onto finite automata abstractions. As a consequence, in recent years there has been a substantial amount of work on high
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6420f7c75ef6e526efc73abe93cfb9b
https://doi.org/10.1145/3079079.3079100
https://doi.org/10.1145/3079079.3079100
Publikováno v:
IPDPS
In this paper, we study the acceleration of applications that require searching for all occurrences of thousands of string-patterns in an input data-stream, using the Automata Processor (AP). For this purpose, we use two applications from two fields,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c265ccf48bbfacfda5734a856bdcd611
https://doi.org/10.1109/ipdps.2016.94
https://doi.org/10.1109/ipdps.2016.94