Sciweavers

258 search results - page 24 / 52
» Compiler Optimization-Space Exploration
Sort
View
DAC
2002
ACM
14 years 10 months ago
Timed compiled-code simulation of embedded software for performance analysis of SOC design
In this paper, a new timing generation method is proposed for the performance analysis of embedded software. The time stamp generation of I/O accesses is crucial to performance es...
Jong-Yeol Lee, In-Cheol Park
POPL
2007
ACM
14 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
SIGMOD
2009
ACM
117views Database» more  SIGMOD 2009»
14 years 10 months ago
FERRY: database-supported program execution
We demonstrate the language Ferry and its editing, compilation, and execution environment FerryDeck. Ferry's type system and operations match those of scripting or programmin...
Torsten Grust, Manuel Mayr, Jan Rittinger, Tom Sch...
ICCD
2000
IEEE
93views Hardware» more  ICCD 2000»
14 years 6 months ago
Cheap Out-of-Order Execution Using Delayed Issue
In superscalar architectures, out-of-order issue mechanisms increase performance by dynamically rescheduling instructions that cannot be statically reordered by the compiler. Whil...
J. P. Grossman
ISPASS
2010
IEEE
14 years 4 months ago
Runahead execution vs. conventional data prefetching in the IBM POWER6 microprocessor
After many years of prefetching research, most commercially available systems support only two types of prefetching: software-directed prefetching and hardware-based prefetchers u...
Harold W. Cain, Priya Nagpurkar