Polynomial-time Algorithms for Enforcing Sequential Consistency in SPMD Programs with Arrays Wei-Yu Chen1 , Arvind Krishnamurthy2 , and Katherine Yelick1 1 Computer Science Division, University of California, Berkeley

First Page		Document Content
Date: 2010-05-06 00:14:41 Parallel computing Cycle detection SPMD Compiler optimization Algorithm Shortest path problem Floyd–Warshall algorithm Graph Connected component Mathematics Graph theory Theoretical computer science		Polynomial-time Algorithms for Enforcing Sequential Consistency in SPMD Programs with Arrays Wei-Yu Chen1 , Arvind Krishnamurthy2 , and Katherine Yelick1 1 Computer Science Division, University of California, Berkeley Add to Reading List Source URL: upc.lbl.gov Download Document from Source Website File Size: 120,18 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document