Sciweavers

3398 search results - page 182 / 680
» Implementations of Grid-Based Distributed Parallel Computing
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
PARELEC
2002
IEEE
14 years 3 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
MIDDLEWARE
2004
Springer
14 years 3 months ago
Scooby: middleware for service composition in pervasive computing
In this paper we argue for middleware languages that aid in service composition. We outline where such languages could be useful through the description of our current architectur...
Jon Robinson, Ian Wakeman, Tim Owen
IPPS
1996
IEEE
14 years 2 months ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...
IEEEPACT
2002
IEEE
14 years 3 months ago
An Evaluation of Data-Parallel Compiler Support for Line-Sweep Applications
Data parallel compilers have long aimed to equal the performance of carefully hand-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has b...
Daniel G. Chavarría-Miranda, John M. Mellor...