Sciweavers

2703 search results - page 293 / 541
» Optimizing memory transactions
Sort
View
CASES
2007
ACM
15 years 8 months ago
A simplified java bytecode compilation system for resource-constrained embedded processors
Embedded platforms are resource-constrained systems in which performance and memory requirements of executed code are of critical importance. However, standard techniques such as ...
Carmen Badea, Alexandru Nicolau, Alexander V. Veid...
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 7 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
CGO
2008
IEEE
15 years 10 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
15 years 8 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
ICS
2000
Tsinghua U.
15 years 7 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy