In this talk we explore the main techniques and approaches presented in the literature and aimed at enabling the use of parallelism in Answer Set Programming solvers. This survey explores the approaches along two dimensions: (1) one dimension is the underlying language, ranging from Datalog to full ASP; (2) the second dimension is the granularity of parallelism, from fine-grained GPU-based parallelism to very large grained parallelism on distributed platforms.