Sciweavers

1461 search results - page 63 / 293
» Comparing the Optimal Performance of Parallel Architectures
Sort
View
CGO
2005
IEEE
15 years 7 months ago
Superword-Level Parallelism in the Presence of Control Flow
In this paper, we describe how to extend the concept of superword-level parallelization (SLP), used for multimedia extension architectures, so that it can be applied in the presen...
Jaewook Shin, Mary W. Hall, Jacqueline Chame
RTI
2000
113views more  RTI 2000»
15 years 1 months ago
Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays
In this work we introduce and analyze algorithms for fractal image compression on massively parallel SIMD arrays. The di erent algorithms discussed di er signi cantly in terms of ...
Christian Hufnagl, Andreas Uhl
DSD
2006
IEEE
110views Hardware» more  DSD 2006»
15 years 8 months ago
A Graph Based Algorithm for Data Path Optimization in Custom Processors
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, ...
AMC
2004
115views more  AMC 2004»
15 years 1 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
HPDC
1997
IEEE
15 years 6 months ago
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a techn...
Roy Friedman, Robbert van Renesse