This is a Stars and Bars problem in disguise. For Stars and Bars theory, see
this article and
this article.
Reserve the factors of
$2!~$ as number of ways of permuting A,B.
$2!~$ as number of ways of permuting C,D.
$4!~$ as number of ways of permuting E,F,G,H.
With the above factors reserved, assume that A precedes B, C precedes D, and that E, F, G, H appear in that order. Now, consider the following tableau:
_ C _ A _ B _ D _
The above tableau indicates that $~5~$ islands are created between the letters C, A, B, and D. Reading these islands left to right, let $~x_1, \cdots, x_5,~$ denote the respective sizes of these islands.
Then, the final factor will be the number of solutions to
$x_1 + \cdots + x_5 = 4.$
$x_1, \cdots, x_5 \in \Bbb{Z_{\geq 0}}.$
By Stars and Bar theory, the final factor is $~\displaystyle \binom{8}{4} = 70.$
So, the final answer is
$$2! \times 2! \times 4! \times 70 = 6720.$$