3148 search results - page 102 / 630 » On the Dynamic Initialization of Parallel Computers |
158
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
138
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...
116
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
118
click to vote
HPCA
2007
IEEE
16 years 3 months ago
2007
IEEE
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
107
click to vote
CONCUR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....