Abstract. In this paper we discuss the concept of space-time diagrams as a representation of the execution of an application, and then give a method, based on critical path analysis, for calculating nontrivial upper bounds on the potential parallelism, known as the average parallelism, a complement to the speedup and efficiency. 							
						
							
					 															
					Benno J. Overeinder, Peter M. A. Sloot