A job allocation algorithm for parallel processors

Autores
Vakhania, Nodari
Año de publicación
1997
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time complexity O(n logn) was proposed earlier in [10]. This algorithm improves the running time of the previously known best algorithm [9] under the assumption that the tails of all jobs are bounded by some constant. In this paper we show that an algorithm based on the ideas of the algorithm from [10] can be constructed in which the above restriction is removed.
Eje: Procesamiento distribuido y paralelo. Tratamiento de señales
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
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/23931
Acceder
id SEDICI_b2a8642bf13b9ad17436a6ec3959f1b7
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23931
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A job allocation algorithm for parallel processorsVakhania, NodariCiencias InformáticasSchedulingAlgorithmsParallel processingDistributedidentical machinesreadiness timetailcomputational complexityWe are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time complexity O(n logn) was proposed earlier in [10]. This algorithm improves the running time of the previously known best algorithm [9] under the assumption that the tails of all jobs are bounded by some constant. In this paper we show that an algorithm based on the ideas of the algorithm from [10] can be constructed in which the above restriction is removed.Eje: Procesamiento distribuido y paralelo. Tratamiento de señalesRed de Universidades con Carreras en Informática (RedUNCI)1997info: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/23931enginfo: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-10-22T16:37:10Zoai:sedici.unlp.edu.ar:10915/23931Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:37:10.445SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A job allocation algorithm for parallel processors
title A job allocation algorithm for parallel processors
spellingShingle A job allocation algorithm for parallel processors
Vakhania, Nodari
Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
title_short A job allocation algorithm for parallel processors
title_full A job allocation algorithm for parallel processors
title_fullStr A job allocation algorithm for parallel processors
title_full_unstemmed A job allocation algorithm for parallel processors
title_sort A job allocation algorithm for parallel processors
dc.creator.none.fl_str_mv Vakhania, Nodari
author Vakhania, Nodari
author_facet Vakhania, Nodari
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
topic Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
dc.description.none.fl_txt_mv We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time complexity O(n logn) was proposed earlier in [10]. This algorithm improves the running time of the previously known best algorithm [9] under the assumption that the tails of all jobs are bounded by some constant. In this paper we show that an algorithm based on the ideas of the algorithm from [10] can be constructed in which the above restriction is removed.
Eje: Procesamiento distribuido y paralelo. Tratamiento de señales
Red de Universidades con Carreras en Informática (RedUNCI)
description We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time complexity O(n logn) was proposed earlier in [10]. This algorithm improves the running time of the previously known best algorithm [9] under the assumption that the tails of all jobs are bounded by some constant. In this paper we show that an algorithm based on the ideas of the algorithm from [10] can be constructed in which the above restriction is removed.
publishDate 1997
dc.date.none.fl_str_mv 1997
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/23931
url http://sedici.unlp.edu.ar/handle/10915/23931
dc.language.none.fl_str_mv eng
language eng
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_ 1846782832930717696
score 12.982451

Publicaciones similares