Sciweavers

23 search results - page 3 / 5
» Coarse Grained Parallel Graph Planarity Testing
Sort
View
MICRO
2007
IEEE
164views Hardware» more  MICRO 2007»
14 years 1 days ago
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
The emergence of multicore processors has heightened the need for effective parallel programming practices. In addition to writing new parallel programs, the next generation of pr...
William Thies, Vikram Chandrasekhar, Saman P. Amar...
ERSA
2004
134views Hardware» more  ERSA 2004»
13 years 7 months ago
A High Performance Application Representation for Reconfigurable Systems
Modern reconfigurable computing systems feature powerful hybrid architectures with multiple microprocessor cores, large reconfigurable logic arrays and distributed memory hierarch...
Wenrui Gong, Gang Wang, Ryan Kastner
ICCS
2009
Springer
14 years 10 days ago
Hiding Communication Latency with Non-SPMD, Graph-Based Execution
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
Jacob Sorensen, Scott B. Baden
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
13 years 10 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...