Solving the maximum subsequence problem with a hardware agents-based system

Authors:
Octavian Creţ;Zsolt Mathe;Cristina Grama;Lucia Văcariu;Flaviu Roman;Adrian Dărăbant
Affiliations:
Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania;Computer Science Department, "Babeş-Bolyai" University of Cluj-Napoca, Cluj-Napoca, Romania
Venue:
ICC'06 Proceedings of the 10th WSEAS international conference on Circuits
Year:
2006

Citing 3
Cited 1

Programming pearls: perspective on performance

Communications of the ACM
Programming pearls: algorithm design techniques

Communications of the ACM
Bio-sequence analysis with cradle's 3SoC™ software scalable system on chip

Proceedings of the 2004 ACM symposium on Applied computing

Mobile devices and data synchronization assisting medical diagnosis

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum subsequence problem is widely encountered in various digital processing systems. Given a stream of both positive and negative integers, it consists of determining the subsequence of maximal sum inside the input stream. In its two-dimensional version, the input is an array of both positive and negative integers, and the problem consists of determining the sub-array of maximal sum inside the input array. These problems are solved by Kadane's algorithm, which has already been proved to be optimal. However, the hardware implementation presented in this paper is based on the hardware agents' paradigm and offers a significantly improved performance (in terms of speed) over the classical software implementations.