It is an open problem to determine whether a complete equipartite graph Km * K̄n (having m parts of size n) admits a decomposition into cycles of arbitrary fixed length k whenever m, n, and k satisfy the obvious necessary conditions for the existence of such a decomposition. Recently, Manikandan and Paulraja  have shown the necessary conditions are indeed sufficient for a decomposition into cycles of length p where p > 5 is a prime. The case p = 3 was settled by Hanani  and the case p = 5 was settled by Billington et al. . Here, we extend this result and show that the necessary conditions for the decomposition of Km * K̄n into cycles of length 2p (where p ≥ 3 is a prime) are also sufficient.