We present work in progress about concurrent monads, an extension of monads designed to model parallel composition of programs. We take an algebraic perspective on concurrent monads via abstract clones, introducing a notion of concurrent clone and showing its correspondence to concurrent monads. We show preliminary results characterizing free concurrent clones using labelled partial orders (pomsets), and conclude with a discussion of promising research directions.