A FRAMEWORK FOR SOLVING SEQUENCE PROBLEM OF MULTIPLE INPUT STREAMS

Abstract

In this research, a framework is proposed for answering the question: whether a dominant sequence exists for the multiple self-contained input streams destined for a computation provider running the requested applications concurrently. The framework is extended to find an optimal semidominant sequence for multiple input streams. This paper also shows that an existent universal dominant sequence can be formed by permuting a set of dominant input streams. In this paper, the neighbor-connected graph is first proposed to model the sequence problem of multiple input streams. Then, an algorithm with time complexity O(nLn) is proposed to determine the existence of a dominant data-receiving sequence, where L is the maximal length of the input streams plus one and n is the number of input streams. Examples of applying the framework to solve the sequence problems for several computation-intensive applications are also given. Furthermore, the framework is extended to find an optimal semidominant sequence using an algorithm with time complexity O(nLnlogδ*), where δ* is the maximal degree that the sequence diverges from all the optimal subsequences. Finally, the property of a universal dominant sequence is studied and the performance of the sequence is compared with those of other sequences.