A shared-memory multiprocessor scheduling algorithm

This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to the priority function synchronization associated with access to the shared memor...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Zuccar, Irene, Solar, Mauricio, Kri, Fernanda, Parada, Víctor
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24246
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24246
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
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
spellingShingle Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
Zuccar, Irene
Solar, Mauricio
Kri, Fernanda
Parada, Víctor
A shared-memory multiprocessor scheduling algorithm
topic_facet Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
description This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to the priority function synchronization associated with access to the shared memory. The assignment is carried out associating with each task a time window of the same size as its duration, which decreases with the Insertion Scheduling Heuristic (ISH). Analysis of the results established that ELT has better performance with fine granularity tasks (computing time comparable to synchronization time), and also, when the number of processors available to carry out the assignment increases
format Objeto de conferencia
Objeto de conferencia
author Zuccar, Irene
Solar, Mauricio
Kri, Fernanda
Parada, Víctor
author_facet Zuccar, Irene
Solar, Mauricio
Kri, Fernanda
Parada, Víctor
author_sort Zuccar, Irene
title A shared-memory multiprocessor scheduling algorithm
title_short A shared-memory multiprocessor scheduling algorithm
title_full A shared-memory multiprocessor scheduling algorithm
title_fullStr A shared-memory multiprocessor scheduling algorithm
title_full_unstemmed A shared-memory multiprocessor scheduling algorithm
title_sort shared-memory multiprocessor scheduling algorithm
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/24246
work_keys_str_mv AT zuccarirene asharedmemorymultiprocessorschedulingalgorithm
AT solarmauricio asharedmemorymultiprocessorschedulingalgorithm
AT krifernanda asharedmemorymultiprocessorschedulingalgorithm
AT paradavictor asharedmemorymultiprocessorschedulingalgorithm
AT zuccarirene sharedmemorymultiprocessorschedulingalgorithm
AT solarmauricio sharedmemorymultiprocessorschedulingalgorithm
AT krifernanda sharedmemorymultiprocessorschedulingalgorithm
AT paradavictor sharedmemorymultiprocessorschedulingalgorithm
bdutipo_str Repositorios
_version_ 1764820466820710400

Ejemplares similares