Parallel computation of arithmetic expressions involving unary functions

An algorithm is proposed for the restructuring of arithmetic expressions involving unary functions to a form convenient for parallel computation. Upper bounds are presented for the restructuring time on a serial processor, the parallel computing time, and the required number of processors.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 175, pp. 37–52, 1988.