In this paper, an effective static task scheduling algorithm for hypercube interconnected multicomputers is presented. In the design of this algorithm, two priority lists are built for tasks and processors. During the schedule, tasks are selected from the task priority list in sequence. For a selected task, the processor on which it can be executed the earliest is assigned. In the end, the schedule results of LU decomposition and randomly generated task graphs are given and analyzed.