TY - GEN
T1 - Faster processor allocation algorithms for mesh-connected CMPs
AU - Daoud, Luka B.
AU - Ragab, M. El Sayed
AU - Goulart Ferreira, Victor Mauro
PY - 2011/11/1
Y1 - 2011/11/1
N2 - Designing efficient processor allocation algorithms is one of the major issues to build large high performance Chip Multiprocessors (CMPs). The task of the processor allocator (PA) is to assign one or more processors for an incoming job. In this paper, we propose two new contiguous processor allocation algorithms, Better First Fit (BFF) and Improved Better First Fit (IBFF), for CMPs based on 2-D mesh networks. Our proposed algorithms outperform other existing allocation strategies based on busy array approach such as First Fit (FF) and Improved First Fit (IFF) using a faster scanning of the bit-map matrix. Evaluation of BFF and IBFF were done with different sets of jobs over different network sizes and job dispatching approaches. According to the job size, BFF is faster than IFF by up to 63.1% or 18.5% in average for all job sizes evaluated. IBFF, when set with best parameters, is 54.8% faster than IFF and 4% faster than BFF for a random mix of job sizes.
AB - Designing efficient processor allocation algorithms is one of the major issues to build large high performance Chip Multiprocessors (CMPs). The task of the processor allocator (PA) is to assign one or more processors for an incoming job. In this paper, we propose two new contiguous processor allocation algorithms, Better First Fit (BFF) and Improved Better First Fit (IBFF), for CMPs based on 2-D mesh networks. Our proposed algorithms outperform other existing allocation strategies based on busy array approach such as First Fit (FF) and Improved First Fit (IFF) using a faster scanning of the bit-map matrix. Evaluation of BFF and IBFF were done with different sets of jobs over different network sizes and job dispatching approaches. According to the job size, BFF is faster than IFF by up to 63.1% or 18.5% in average for all job sizes evaluated. IBFF, when set with best parameters, is 54.8% faster than IFF and 4% faster than BFF for a random mix of job sizes.
UR - http://www.scopus.com/inward/record.url?scp=80054976984&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054976984&partnerID=8YFLogxK
U2 - 10.1109/DSD.2011.107
DO - 10.1109/DSD.2011.107
M3 - Conference contribution
AN - SCOPUS:80054976984
SN - 9780769544946
T3 - Proceedings - 2011 14th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2011
SP - 805
EP - 808
BT - Proceedings - 2011 14th Euromicro Conference on Digital System Design
T2 - 2011 14th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2011
Y2 - 31 August 2011 through 2 September 2011
ER -