Accession Number : ADA323937
Title : The Dynamic Tree Expression Problem,
Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Mayr, Ernst W.
PDF Url : ADA323937
Report Date : 02 MAY 1987
Pagination or Media Count : 21
Abstract : We present a uniform method for obtaining efficient parallel algorithms for a rather large class of problems. The method is based on a logic programming model, and it derives its efficiency from fast parallel routines for the evaluation of expression trees.
Descriptors : *ALGORITHMS, *PARALLEL PROCESSING, COMPUTER LOGIC, INPUT OUTPUT PROCESSING, RANDOM ACCESS COMPUTER STORAGE, COMPILERS, EXECUTIVE ROUTINES, CONTROL SEQUENCES, STRUCTURED PROGRAMMING.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE