Dynamic programming approach on pipelined optical bus systems for finding the longest upsequence

Abstract

In this paper, dynamic programming approach is applied to a pipelined optical bus system for finding the longest upsequence, maximum increasing sequence in a given set of values V = (v 1 , v 2 , …, v n ). The pipelined optical bus system that we apply is based upon pipelined optical bus systems on which an array of processors is connected linearly. We show that the longest upsequence can be found by applying dynamic programming on the pipelined optical bus system of n processors that runs with the time complexity of O (m), where m is the length of the longest upsequence.