  In this paper we investigate the parallelization of dual-primal isogeometric
tearing and interconnecting (IETI-DP) type methods for solving large-scale
continuous and discontinuous Galerkin systems of equations arising from
Isogeometric analysis of elliptic boundary value problems. These methods are
extensions of the finite element tearing and interconnecting methods to
isogeometric analysis. The algorithms are implemented by means of energy
minimizing primal subspaces. We discuss how these methods can efficiently be
parallelized in a distributed memory setting. Weak and strong scaling studies
presented for two and three dimensional problems show an excellent parallel
efficiency.
