Sciweavers

456 search results - page 46 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
ESTIMEDIA
2005
Springer
15 years 3 months ago
Custom Processor Design Using NISC: A Case-Study on DCT algorithm
Designing Application-Specific Instruction-set Processors (ASIPs) usually requires designing a custom datapath, and modifying instruction-set, instruction decoder, and compiler. A...
Bita Gorjiara, Daniel D. Gajski
CODES
2004
IEEE
15 years 1 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
TSMC
2011
324views more  TSMC 2011»
14 years 4 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
CVPR
2009
IEEE
16 years 4 months ago
Convexity and Bayesian Constrained Local Models
The accurate localization of facial features plays a fundamental role in any face recognition pipeline. Constrained local models (CLM) provide an effective approach to localizati...
Ulrich Paquet (Imense Ltd)
LCTRTS
2007
Springer
15 years 3 months ago
Compiler-managed partitioned data caches for low power
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...
Rajiv A. Ravindran, Michael L. Chu, Scott A. Mahlk...