Sciweavers

130 search results - page 17 / 26
» Dynamically Scheduling VLIW Instructions
Sort
View
118
Voted
RTSS
1999
IEEE
15 years 7 months ago
Timing Anomalies in Dynamically Scheduled Microprocessors
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
Thomas Lundqvist, Per Stenström
132
Voted
MICRO
2005
IEEE
105views Hardware» more  MICRO 2005»
15 years 9 months ago
Incremental Commit Groups for Non-Atomic Trace Processing
We introduce techniques to support efficient non-atomic execution of very long traces on a new binary translation based, x86-64 compatible VLIW microprocessor. Incrementally comm...
Matt T. Yourst, Kanad Ghose
IEEEPACT
1999
IEEE
15 years 7 months ago
A Fully Asynchronous Superscalar Architecture
An asynchronous superscalar architecture is presented based on a novel architectural feature called instruction compounding. This enables efficient dynamic scheduling and forwardi...
D. K. Arvind, Robert D. Mullins
ISCAS
1999
IEEE
113views Hardware» more  ISCAS 1999»
15 years 7 months ago
Energy efficient software through dynamic voltage scheduling
The energy usage of computer systems is becoming important, especially for portablebattery-operated applications and embedded systems. A significant reduction in the energy consum...
Gangadhar Konduri, James Goodman, Anantha Chandrak...
ICCD
2004
IEEE
125views Hardware» more  ICCD 2004»
16 years 12 days ago
IPC Driven Dynamic Associative Cache Architecture for Low Energy
Existing schemes for cache energy optimization incorporate a limited degree of dynamic associativity: either direct mapped or full available associativity (say 4-way). In this pap...
Sriram Nadathur, Akhilesh Tyagi