An efficient tool for vectorizing a computer system

This paper presents an efficient method that improves some procedures developed for solving the problem of scheduling vectorial loop instructions. First it describes the problem to be solved. Then the paper shows how to transform it into a more general partition problem. Finally a method is presented based on branch-and-bound techniques. The computational results show that the method which was developed is very fast for sizes of the data greater than those required for a CRAY-2. Thus the method can be implemented in a computer system even if initially the problem seemed not to be polynomial.