223 search results - page 15 / 45 » A Compiler Scheme for Reusing Intermediate Computation Resul... |
IPPS
2002
IEEE
14 years 25 days ago
2002
IEEE
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular a...
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Cray X1 Fortran and C/C++ compilers provide a number of loop transformations, notably vectorization and multistreaming, in order to exploit the multistreaming processor (MSP) hard...
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...