2703 search results - page 441 / 541 » Optimizing memory transactions |
133
Voted
ACMMSP
2006
ACM
15 years 7 months ago
2006
ACM
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
114
click to vote
CASES
2006
ACM
15 years 7 months ago
2006
ACM
A Java bytecode-to-C ahead-of-time compiler (AOTC) can improve the performance of a Java virtual machine (JVM) by translating bytecode into C code, which is then compiled into mac...
109
Voted
CODES
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
107
Voted
CODES
2005
IEEE
15 years 6 months ago
2005
IEEE
Even after carefully tuning the memory characteristics to the application properties and the processor speed, during the execution of real applications there are times when the pr...
113
click to vote
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
- This paper presents a new control method to drive an array of wet Shape Memory Alloy actuators utilizing a Matrix Manifold and Valve system (MMV). The MMV architecture allows a v...