Sciweavers

678 search results - page 30 / 136
» Lock-free parallel dynamic programming
Sort
View
TPDS
1998
98views more  TPDS 1998»
15 years 3 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
IPPS
2003
IEEE
15 years 8 months ago
A UNITY-Based Formalism for Dynamic Distributed Systems
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
Daniel M. Zimmerman
ICDCS
2002
IEEE
15 years 8 months ago
D-Stampede: Distributed Programming System for Ubiquitous Computing
We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environme...
Sameer Adhikari, Arnab Paul, Umakishore Ramachandr...
ICPP
2005
IEEE
15 years 9 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
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...
Wei Du, Gagan Agrawal
IPPS
2000
IEEE
15 years 7 months ago
Applying Interposition Techniques for Performance Analysis of OpenMP Parallel Applications
Tuning parallel applications requires the use of effective tools for detecting performance bottlenecks. Along a parallel program execution, many individual situations of performan...
Marc González, Albert Serra, Xavier Martore...