6105 search results - page 413 / 1221 » A Parallel Algorithm for Bound-Smoothing |
204
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
178
click to vote
TPDS
1998
15 years 6 months ago
1998
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
180
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
202
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
210
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...