In this study, a multicast routing algorithm based on parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over the previous studies is that the routing from the source to the destination is achieved in minimal step without restriction to the number of faulty nodes. This means that the algorithm is running independent from the number of the faulty nodes. The algorithm is simulated with a hypercube routing simulator.