Calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems

Akimasa Morihata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Parallel algorithms for the one-dimensional and the two-dimensional size-constrained maximum-sum segment problems are proposed. The problem, which is a variant of the classic maximum-sum segment problem, is to locate the segment of the maximum total sum among those whose sizes are in a certain range, say, between l and u. It has several applications including pattern recognition, data mining, and DNA analyses, and the size requirement enables us to exclude trivial or useless results. Our parallel algorithms solve it in time O(n / n/p + log p) for one-dimensional arrays of length n and in time O(n 2(u-l) / p + log p) for n × n two-dimensional arrays on EREW PRAM that consists of p processors. It is worth noting that they achieve asymptotically optimal parallel speedups compared with the best known sequential algorithms that take O(n) and O(n 3) times for the one- and the two-dimensional cases, respectively. Our algorithms are correct by their construction: they are systematically derived from their specifications based on the Bird-Meertens formalism.

Original languageEnglish
Title of host publicationFunctional and Logic Programming - 11th International Symposium, FLOPS 2012, Proceedings
Pages213-227
Number of pages15
DOIs
Publication statusPublished - 2012 Jun 6
Event11th International Symposium onFunctional and Logic Programming, FLOPS 2012 - Kobe, Japan
Duration: 2012 May 232012 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7294 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Symposium onFunctional and Logic Programming, FLOPS 2012
CountryJapan
CityKobe
Period12/5/2312/5/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems'. Together they form a unique fingerprint.

Cite this