Nearest neighbor affinity scheduling in heterogeneous multi-core architectures

Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple thread cores of various power envelo...

Descripción completa

Detalles Bibliográficos
Autor principal: Sibai, Fadi N.
Formato: Articulo
Lenguaje:Inglés
Publicado: 2008
Materias:
Ciencias Informáticas
asymmetric multiprocessors
multi-core architectures
thread scheduling
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9638
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct08-3.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9638
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
asymmetric multiprocessors
multi-core architectures
thread scheduling
spellingShingle Ciencias Informáticas
asymmetric multiprocessors
multi-core architectures
thread scheduling
Sibai, Fadi N.
Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
topic_facet Ciencias Informáticas
asymmetric multiprocessors
multi-core architectures
thread scheduling
description Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple thread cores of various power envelopes. A priority-based thread scheduling algorithm is also proposed for this AMC architecture. Fairness of this scheduling algorithm vis-a-vis lower priority thread starvation, and hardware and software requirements needed to implement this algorithm are addressed. We illustrate how this algorithm operates by a thread scheduling example. The produced schedule maximizes throughput (but is priority-based) and the core utilization given the available resources, the states and contents of the starting queues, and the threads' core requirement constraints. A simulation model simulates 6 scheduling algorithms which vary in their support of core affinity and thread migration. The simulation results that both core affinity and thread migration positively effect the completion time and that the nearest neighbor scheduling algorithm outperforms or is competitive with the other algorithms in all considered scenarios
format Articulo
Articulo
author Sibai, Fadi N.
author_facet Sibai, Fadi N.
author_sort Sibai, Fadi N.
title Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
title_short Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
title_full Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
title_fullStr Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
title_full_unstemmed Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
title_sort nearest neighbor affinity scheduling in heterogeneous multi-core architectures
publishDate 2008
url http://sedici.unlp.edu.ar/handle/10915/9638
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct08-3.pdf
work_keys_str_mv AT sibaifadin nearestneighboraffinityschedulinginheterogeneousmulticorearchitectures
bdutipo_str Repositorios
_version_ 1764820492072517637

Ejemplares similares