Sciweavers

663 search results - page 109 / 133
» Reducing Compilation Time Overhead in Compiled Simulators
Sort
View
WSC
1997
15 years 1 months ago
Multiplexed State Saving for Bounded Rollback
Optimistic parallel discrete event simulation (PDES) uses a state history trail to support rollback. State saving strategies range from making a complete copy of a model’s state...
Fabian Gomes, Brian Unger, John G. Cleary, Steve F...
CASES
2003
ACM
15 years 5 months ago
Extending STI for demanding hard-real-time systems
Software thread integration (STI) is a compilation technique which enables the efficient use of an application’s fine-grain idle time on generic processors without special hardw...
Benjamin J. Welch, Shobhit O. Kanaujia, Adarsh See...
LCTRTS
2009
Springer
15 years 6 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 5 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
MAM
2007
90views more  MAM 2007»
14 years 11 months ago
Clustered indexing for branch predictors
ct 8 As a result of resource limitations, state in branch predictors is frequently shared between uncorrelated branches. This interference 9 can significantly limit prediction acc...
Veerle Desmet, Hans Vandierendonck, Koen De Bossch...