Sciweavers

207 search results - page 17 / 42
» Using Clustering Technique to Restructure Programs
Sort
View
IEEEPACT
2006
IEEE
14 years 3 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
BMCBI
2004
150views more  BMCBI 2004»
13 years 9 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
APPT
2007
Springer
13 years 11 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
ISLPED
2005
ACM
86views Hardware» more  ISLPED 2005»
14 years 3 months ago
An evaluation of code and data optimizations in the context of disk power reduction
Disk power management is becoming increasingly important in high-end server and cluster type of environments that execute dataintensive applications. While hardware-only approache...
Mahmut T. Kandemir, Seung Woo Son, Guangyu Chen
HPCA
1999
IEEE
14 years 2 months ago
Limits to the Performance of Software Shared Memory: A Layered Approach
Much research has been done in fast communication on clusters and in protocols for supporting software shared memory across them. However, the end performance of applications that...
Angelos Bilas, Dongming Jiang, Yuanyuan Zhou, Jasw...