Sciweavers

98 search results - page 1 / 20
» Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Sort
View
MICRO
2003
IEEE
101views Hardware» more  MICRO 2003»
13 years 10 months ago
Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Ensuring back-to-back execution of dependent instructions in a conventional out-of-order processor requires scheduling logic that wakes up and selects instructions at the same rat...
Ilhyun Kim, Mikko H. Lipasti
IJPP
1998
73views more  IJPP 1998»
13 years 4 months ago
Meld Scheduling: A Technique for Relaxing Scheduling Constraints
Santosh G. Abraham, Vinod Kathail, Brian L. Deitri...
ISCAS
2003
IEEE
76views Hardware» more  ISCAS 2003»
13 years 10 months ago
Loop scheduling for minimizing schedule length and switching activities
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
Zili Shao, Qingfeng Zhuge, Edwin Hsing-Mean Sha, C...
ECRTS
1999
IEEE
13 years 9 months ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...
EUROPAR
2006
Springer
13 years 8 months ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao