Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scheduling Algorithms for Unpredictably Heterogeneous CMP Architectures
 

Summary: Scheduling Algorithms for Unpredictably Heterogeneous
CMP Architectures
Jonathan A. Winter and David H. Albonesi
Computer Systems Laboratory, Cornell University
{winter, albonesi}@csl.cornell.edu
Abstract
In future large-scale multi-core microprocessors,
hard errors and process variations will create dynamic
heterogeneity, causing performance and power
characteristics to differ among the cores in an
unanticipated manner. Under this scenario, na´ve
assignments of applications to cores degraded by
various faults and variations may result in large
performance losses and power inefficiencies. We
propose scheduling algorithms based on the
Hungarian Algorithm and artificial intelligence (AI)
search techniques that account for this future
uncertainty in core characteristics. These thread
assignment policies effectively match the capabilities
of each degraded core with the requirements of the

  

Source: Albonesi, David H. - Computer Systems Laboratory, Cornell University

 

Collections: Computer Technologies and Information Sciences