A GRAPH MODEL FOR PARALLEL COMPUTATIONS

摘要: This report presents a computational model called program graphs which makes possible precise description of parallel computations arbitrary complexity on non-structured data. In the model, computation steps are represented by nodes directed graph whose links represent elements storage and transmission data and/or control information. The activation node depends only information residing in each incident into out node. At any given time number may be active, there no assumptions regarding either length required to perform or transmit from one another. Data dependent decisions incorporated novel way sharp distinction between local sequencing requirements arising form dependency global determined logical structure for algorithm.