Back to Results
First PageMeta Content
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

Document Date: 2010-05-06 00:14:41


Open Document

File Size: 120,18 KB

Share Result on Facebook

Currency

pence / /

/

Facility

University of California / /

IndustryTerm

zero cycle detection algorithm / classical graph theory algorithms / software pipelining / polynomial-time algorithms / scientific applications / shares common solutions / parallel hardware / shortest path algorithm / polynomial time algorithm / naive algorithm / polynomial-time algorithm / breadth-first search / cycle detection algorithm / /

Organization

Computer Science Division / Department of Computer Science / University of California / Berkeley / Yale University / /

Person

Wei-Yu Chen / /

ProgrammingLanguage

Fortran / Java / /

ProvinceOrState

California / /

TVShow

Definition 5 / /

Technology

classical graph theory algorithms / cycle detection algorithm / one processor / polynomial time algorithm / Java / three polynomial-time algorithms / shortest path algorithm / Polynomial-time Algorithms / polynomial-time algorithm / zero cycle detection algorithm / Computing Delay Set Our algorithm / naive algorithm / modified algorithm / SPMD cycle detection algorithm / Sequential Consistency / shared memory / /

SocialTag