Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFMS |
Texto Completo: | http://dx.doi.org/10.1109/TPDS.2012.149 https://repositorio.ufms.br/handle/123456789/1755 |
Resumo: | Given a sequence A of real numbers, we wish to find a list of all nonoverlapping contiguous subsequences of A that are maximal. A maximal subsequence M of A has the property that no proper subsequence of M has a greater sum of values. Furthermore, M may not be contained properly within any subsequence of A with this property. This problem has several applications in Computational Biology and can be solved sequentially in linear time. We present a BSP/CGM algorithm that solves this problem using p processors in O(|A|=p) time and O(|A|=p) space per processor. The algorithm uses a constant number of communication rounds of size at most O(|A|=p). Thus, the algorithm achieves linear speedup and is highly scalable. To our knowledge, there are no previous known parallel BSP/CGM algorithms to solve this problem. |
id |
UFMS_cfa8b9bc42b9b26d5d481122c8f22c9d |
---|---|
oai_identifier_str |
oai:repositorio.ufms.br:123456789/1755 |
network_acronym_str |
UFMS |
network_name_str |
Repositório Institucional da UFMS |
repository_id_str |
2124 |
spelling |
2013-08-06T17:56:17Z2021-09-30T19:57:56Z2013-04ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. Ieee Transactions On Parallel And Distributed Systems, v. 4, n. 24, p.724-733, abr. 2013. Disponível em: <http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149>. Acesso em: 06 ago. 2013.1045-9219http://dx.doi.org/10.1109/TPDS.2012.149https://repositorio.ufms.br/handle/123456789/1755http://dx.doi.org/10.1109/TPDS.2012.149Given a sequence A of real numbers, we wish to find a list of all nonoverlapping contiguous subsequences of A that are maximal. A maximal subsequence M of A has the property that no proper subsequence of M has a greater sum of values. Furthermore, M may not be contained properly within any subsequence of A with this property. This problem has several applications in Computational Biology and can be solved sequentially in linear time. We present a BSP/CGM algorithm that solves this problem using p processors in O(|A|=p) time and O(|A|=p) space per processor. The algorithm uses a constant number of communication rounds of size at most O(|A|=p). Thus, the algorithm achieves linear speedup and is highly scalable. To our knowledge, there are no previous known parallel BSP/CGM algorithms to solve this problem.engIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSOtimização CombinatóriaCombinatorial OptimizationArquiteturas e Programação ParalelasParallel Architecture and ProgrammingAlgoritmos e Estruturas de DadosAlgorithms and Data StructuresTeoria da ComputaçãoTheory of ComputationFinding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Roundsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleAlves, Carlos Eduardo RodriguesCáceres, Edson NorbertoSong, Siang Wuninfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFMSinstname:Universidade Federal de Mato Grosso do Sul (UFMS)instacron:UFMSTHUMBNAILResumo.pdf.jpgResumo.pdf.jpgGenerated Thumbnailimage/jpeg1775https://repositorio.ufms.br/bitstream/123456789/1755/4/Resumo.pdf.jpge64d5e0f6a920b0b91ba4d1c4cb941ecMD54ORIGINALResumo.pdfResumo.pdfapplication/pdf79774https://repositorio.ufms.br/bitstream/123456789/1755/1/Resumo.pdf1977e58aa3e29a5f0752e349faa0513dMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748https://repositorio.ufms.br/bitstream/123456789/1755/2/license.txt8a4605be74aa9ea9d79846c1fba20a33MD52TEXTResumo.pdf.txtResumo.pdf.txtExtracted texttext/plain5476https://repositorio.ufms.br/bitstream/123456789/1755/3/Resumo.pdf.txt6d76b65e9b8eeb3f67426f8c204234a3MD53123456789/17552021-09-30 15:57:56.663oai:repositorio.ufms.br:123456789/1755Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositório InstitucionalPUBhttps://repositorio.ufms.br/oai/requestri.prograd@ufms.bropendoar:21242021-09-30T19:57:56Repositório Institucional da UFMS - Universidade Federal de Mato Grosso do Sul (UFMS)false |
dc.title.pt_BR.fl_str_mv |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
title |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
spellingShingle |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds Alves, Carlos Eduardo Rodrigues Otimização Combinatória Combinatorial Optimization Arquiteturas e Programação Paralelas Parallel Architecture and Programming Algoritmos e Estruturas de Dados Algorithms and Data Structures Teoria da Computação Theory of Computation |
title_short |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
title_full |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
title_fullStr |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
title_full_unstemmed |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
title_sort |
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds |
author |
Alves, Carlos Eduardo Rodrigues |
author_facet |
Alves, Carlos Eduardo Rodrigues Cáceres, Edson Norberto Song, Siang Wun |
author_role |
author |
author2 |
Cáceres, Edson Norberto Song, Siang Wun |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Alves, Carlos Eduardo Rodrigues Cáceres, Edson Norberto Song, Siang Wun |
dc.subject.por.fl_str_mv |
Otimização Combinatória Combinatorial Optimization Arquiteturas e Programação Paralelas Parallel Architecture and Programming Algoritmos e Estruturas de Dados Algorithms and Data Structures Teoria da Computação Theory of Computation |
topic |
Otimização Combinatória Combinatorial Optimization Arquiteturas e Programação Paralelas Parallel Architecture and Programming Algoritmos e Estruturas de Dados Algorithms and Data Structures Teoria da Computação Theory of Computation |
description |
Given a sequence A of real numbers, we wish to find a list of all nonoverlapping contiguous subsequences of A that are maximal. A maximal subsequence M of A has the property that no proper subsequence of M has a greater sum of values. Furthermore, M may not be contained properly within any subsequence of A with this property. This problem has several applications in Computational Biology and can be solved sequentially in linear time. We present a BSP/CGM algorithm that solves this problem using p processors in O(|A|=p) time and O(|A|=p) space per processor. The algorithm uses a constant number of communication rounds of size at most O(|A|=p). Thus, the algorithm achieves linear speedup and is highly scalable. To our knowledge, there are no previous known parallel BSP/CGM algorithms to solve this problem. |
publishDate |
2013 |
dc.date.accessioned.fl_str_mv |
2013-08-06T17:56:17Z |
dc.date.issued.fl_str_mv |
2013-04 |
dc.date.available.fl_str_mv |
2021-09-30T19:57:56Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. Ieee Transactions On Parallel And Distributed Systems, v. 4, n. 24, p.724-733, abr. 2013. Disponível em: <http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149>. Acesso em: 06 ago. 2013. |
dc.identifier.uri.fl_str_mv |
https://repositorio.ufms.br/handle/123456789/1755 |
dc.identifier.issn.none.fl_str_mv |
1045-9219 |
dc.identifier.other.none.fl_str_mv |
http://dx.doi.org/10.1109/TPDS.2012.149 |
dc.identifier.doi.none.fl_str_mv |
http://dx.doi.org/10.1109/TPDS.2012.149 |
identifier_str_mv |
ALVES, Carlos Eduardo Rodrigues; CÁCERES, Edson Norberto; SONG, Siang Wun. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. Ieee Transactions On Parallel And Distributed Systems, v. 4, n. 24, p.724-733, abr. 2013. Disponível em: <http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149>. Acesso em: 06 ago. 2013. 1045-9219 |
url |
http://dx.doi.org/10.1109/TPDS.2012.149 https://repositorio.ufms.br/handle/123456789/1755 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |
publisher.none.fl_str_mv |
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFMS instname:Universidade Federal de Mato Grosso do Sul (UFMS) instacron:UFMS |
instname_str |
Universidade Federal de Mato Grosso do Sul (UFMS) |
instacron_str |
UFMS |
institution |
UFMS |
reponame_str |
Repositório Institucional da UFMS |
collection |
Repositório Institucional da UFMS |
bitstream.url.fl_str_mv |
https://repositorio.ufms.br/bitstream/123456789/1755/4/Resumo.pdf.jpg https://repositorio.ufms.br/bitstream/123456789/1755/1/Resumo.pdf https://repositorio.ufms.br/bitstream/123456789/1755/2/license.txt https://repositorio.ufms.br/bitstream/123456789/1755/3/Resumo.pdf.txt |
bitstream.checksum.fl_str_mv |
e64d5e0f6a920b0b91ba4d1c4cb941ec 1977e58aa3e29a5f0752e349faa0513d 8a4605be74aa9ea9d79846c1fba20a33 6d76b65e9b8eeb3f67426f8c204234a3 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFMS - Universidade Federal de Mato Grosso do Sul (UFMS) |
repository.mail.fl_str_mv |
ri.prograd@ufms.br |
_version_ |
1807552864296370176 |