This article presents an application of the inferior Smarandache f-part function to a particular parallel loop-scheduling problem. The product between an upper diagonal matrix and a vector is analysed from parallel computation point of view. An efficient solution for this problem is given by using the inferior Smarandache I-part function. Finally, the efficiency of our solution is proved experimentally by presenting some computational results.