Optimizing multi-core algorithms for pattern search

Autores
Gil Costa, Graciela Verónica; Ochoa, César; Printista, Alicia Marcela
Año de publicación
2013
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
The suffix array index is a data structure formed by sorting the suffixes of a string into lexicographic order. It is used for string matching, which is perhaps one of those tasks on which computers and servers spend quite a bit of time. Research in this area spans from genetics (finding DNA sequences), to keyword search in billions of web documents, to cyberespionage. The attractiveness is that they are completely “array based” and have some benefits in terms of improving the locality of memory references. In this work we propose and evaluate the performance achieved by a static scheduling algorithm for suffix array query search. We focus on multi-core systems 32- core system. Results show that our proposed algorithm can dramatically reduce the cost of computing string matching.
WPDP- XIII Workshop procesamiento distribuido y paralelo
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Web-based services
genética
Web-based interaction
pattern query search
multi-core
scheduling
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/31700
Acceder
id SEDICI_805d6a0d8da1aac31e49d9be88673eef
oai_identifier_str oai:sedici.unlp.edu.ar:10915/31700
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Optimizing multi-core algorithms for pattern searchGil Costa, Graciela VerónicaOchoa, CésarPrintista, Alicia MarcelaCiencias InformáticasWeb-based servicesgenéticaWeb-based interactionpattern query searchmulti-coreschedulingThe suffix array index is a data structure formed by sorting the suffixes of a string into lexicographic order. It is used for string matching, which is perhaps one of those tasks on which computers and servers spend quite a bit of time. Research in this area spans from genetics (finding DNA sequences), to keyword search in billions of web documents, to cyberespionage. The attractiveness is that they are completely “array based” and have some benefits in terms of improving the locality of memory references. In this work we propose and evaluate the performance achieved by a static scheduling algorithm for suffix array query search. We focus on multi-core systems 32- core system. Results show that our proposed algorithm can dramatically reduce the cost of computing string matching.WPDP- XIII Workshop procesamiento distribuido y paraleloRed de Universidades con Carreras en Informática (RedUNCI)2013-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/31700enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:30:47Zoai:sedici.unlp.edu.ar:10915/31700Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:30:49.078SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Optimizing multi-core algorithms for pattern search
title Optimizing multi-core algorithms for pattern search
spellingShingle Optimizing multi-core algorithms for pattern search
Gil Costa, Graciela Verónica
Ciencias Informáticas
Web-based services
genética
Web-based interaction
pattern query search
multi-core
scheduling
title_short Optimizing multi-core algorithms for pattern search
title_full Optimizing multi-core algorithms for pattern search
title_fullStr Optimizing multi-core algorithms for pattern search
title_full_unstemmed Optimizing multi-core algorithms for pattern search
title_sort Optimizing multi-core algorithms for pattern search
dc.creator.none.fl_str_mv Gil Costa, Graciela Verónica
Ochoa, César
Printista, Alicia Marcela
author Gil Costa, Graciela Verónica
author_facet Gil Costa, Graciela Verónica
Ochoa, César
Printista, Alicia Marcela
author_role author
author2 Ochoa, César
Printista, Alicia Marcela
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Web-based services
genética
Web-based interaction
pattern query search
multi-core
scheduling
topic Ciencias Informáticas
Web-based services
genética
Web-based interaction
pattern query search
multi-core
scheduling
dc.description.none.fl_txt_mv The suffix array index is a data structure formed by sorting the suffixes of a string into lexicographic order. It is used for string matching, which is perhaps one of those tasks on which computers and servers spend quite a bit of time. Research in this area spans from genetics (finding DNA sequences), to keyword search in billions of web documents, to cyberespionage. The attractiveness is that they are completely “array based” and have some benefits in terms of improving the locality of memory references. In this work we propose and evaluate the performance achieved by a static scheduling algorithm for suffix array query search. We focus on multi-core systems 32- core system. Results show that our proposed algorithm can dramatically reduce the cost of computing string matching.
WPDP- XIII Workshop procesamiento distribuido y paralelo
Red de Universidades con Carreras en Informática (RedUNCI)
description The suffix array index is a data structure formed by sorting the suffixes of a string into lexicographic order. It is used for string matching, which is perhaps one of those tasks on which computers and servers spend quite a bit of time. Research in this area spans from genetics (finding DNA sequences), to keyword search in billions of web documents, to cyberespionage. The attractiveness is that they are completely “array based” and have some benefits in terms of improving the locality of memory references. In this work we propose and evaluate the performance achieved by a static scheduling algorithm for suffix array query search. We focus on multi-core systems 32- core system. Results show that our proposed algorithm can dramatically reduce the cost of computing string matching.
publishDate 2013
dc.date.none.fl_str_mv 2013-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/31700
url http://sedici.unlp.edu.ar/handle/10915/31700
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260151790206976
score 13.13397

Publicaciones similares