Sciweavers

6105 search results - page 335 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
WCRE
2002
IEEE
15 years 11 months ago
Estimating Potential Parallelism for Platform Retargeting
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent parallelism. Tomorrow’s processors will employ varying com...
Linda M. Wills, Tarek M. Taha, Lewis B. Baumstark ...
IIS
2003
15 years 8 months ago
Function Optimization with Coevolutionary Algorithms
Abstract. The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and co...
Franciszek Seredynski, Albert Y. Zomaya, Pascal Bo...
PODC
2003
ACM
15 years 12 months ago
Automatic discovery of mutual exclusion algorithms
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known ...
Yoah Bar-David, Gadi Taubenfeld
ICDCS
1995
IEEE
15 years 10 months ago
A Distributed K-Mutual Exclusion Algorithm
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
Shailaja Bulgannawar, Nitin H. Vaidya