A shared-memory multiprocessor scheduling algorithm

Autores
Zuccar, Irene; Solar, Mauricio; Kri, Fernanda; Parada, Víctor
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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
Applications in Artificial Intelligence - Applications
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/24246
Acceder
id SEDICI_480ef6e832a187d310b727345cb1f124
oai_identifier_str oai:sedici.unlp.edu.ar:10915/24246
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A shared-memory multiprocessor scheduling algorithmZuccar, IreneSolar, MauricioKri, FernandaParada, VíctorCiencias InformáticasSchedulingAlgorithmsExtended Latency Time (ELT)Multiple Data Stream Architectures (Multiprocessors)Latency Time (LT)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 increasesApplications in Artificial Intelligence - ApplicationsRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24246enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34655-4info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:34Zoai:sedici.unlp.edu.ar:10915/24246Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:34.808SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A shared-memory multiprocessor scheduling algorithm
title A shared-memory multiprocessor scheduling algorithm
spellingShingle A shared-memory multiprocessor scheduling algorithm
Zuccar, Irene
Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
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 A shared-memory multiprocessor scheduling algorithm
dc.creator.none.fl_str_mv Zuccar, Irene
Solar, Mauricio
Kri, Fernanda
Parada, Víctor
author Zuccar, Irene
author_facet Zuccar, Irene
Solar, Mauricio
Kri, Fernanda
Parada, Víctor
author_role author
author2 Solar, Mauricio
Kri, Fernanda
Parada, Víctor
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
topic Ciencias Informáticas
Scheduling
Algorithms
Extended Latency Time (ELT)
Multiple Data Stream Architectures (Multiprocessors)
Latency Time (LT)
dc.description.none.fl_txt_mv 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
Applications in Artificial Intelligence - Applications
Red de Universidades con Carreras en Informática (RedUNCI)
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
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/24246
url http://sedici.unlp.edu.ar/handle/10915/24246
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34655-4
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260124726460416
score 13.13397

Publicaciones similares