Abstract
This article surveys parallel generation algorithms for listing all combinatorial objects of certain type. The algorithms are designed for a very simple model, linear array of processors. The methods are divided into three groups: division of instances into groups, shared instances and combined methods.