92 search results - page 11 / 19 » Optimal versus Heuristic Global Code Scheduling |
130
click to vote
LCTRTS
2001
Springer
15 years 2 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
75
Voted
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
56
Voted
CC
2010
Springer
15 years 4 months ago
2010
Springer
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
64
Voted
COR
2010
14 years 9 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...