Decomposed software pipelining is a new approach for effective branch—free loop scheduling．By decoupling loop scheduling into two subproblems，branch—free loop scheduling problem is transformed into acyclic code scheduling problem，which can be re-solved by the classical polynomial algorithm of graph theory．In this paper，this method is extended to the case of loop with conditional jumps，called global decomposed software pipelining．This results in an effective and practical approach for general loop scheduling，combining time efficiency of software pipelining with practicability of usual global loop—free code scheduling algorithms．