Task Merging and Replication Using Graph Rewriting

Several approaches for handling the multi-processor scheduling problem have been presented over the last decades, such as scheduling techniques, clustering techniques and task merging techniques. However, the increasing gap between processor speed and communication speed demand more accurate models of parallel computation and efficient algorithms to work under the restrictions of these models