Parallel Computing with ROOT and PROOF

		Tuesday 7 March
15:05 - 16:00	Lecture 5	Parallel computing with ROOT and PROOF	Marek Biskup Yushu Yao
		The lecture consists of two parts. In the first one Yushu Yao presents the ROOT framework as a platform for portable programming. In the second part Marek Biskup describes the PROOF subsystem, which allows parallel data analysis with ROOT. The lecture is intended for physicists interested in speeding up their analysis by spreading calculations on a cluster of computers. It will also be interesting for computer scientists willing to learn the internals of a parallel application. No knowledge of the ROOT framework is required but the vocabluary used in the first four lectures may be helpful for understanding all details.
		Introduction to ROOT - ROOT Concepts - ROOT Data Structures, Trees and Files A Step-by-Step Example for ROOT beginners - Create and Fill Trees - Histogram - Curve Fitting PROOF - Motivation - Architectures - Computations Parallel Analysis with Proof - Selectors - Selectors Example Other PROOF Modes - Sequential Mode - GRID Mode