A job allocation algorithm for parallel processors

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 co...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Vakhania, Nodari
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1997
Materias:
Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23931
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23931
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
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
spellingShingle Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
Vakhania, Nodari
A job allocation algorithm for parallel processors
topic_facet Ciencias Informáticas
Scheduling
Algorithms
Parallel processing
Distributed
identical machines
readiness time
tail
computational complexity
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.
format Objeto de conferencia
Objeto de conferencia
author Vakhania, Nodari
author_facet Vakhania, Nodari
author_sort Vakhania, Nodari
title A job allocation algorithm for parallel processors
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 job allocation algorithm for parallel processors
publishDate 1997
url http://sedici.unlp.edu.ar/handle/10915/23931
work_keys_str_mv AT vakhanianodari ajoballocationalgorithmforparallelprocessors
AT vakhanianodari joballocationalgorithmforparallelprocessors
bdutipo_str Repositorios
_version_ 1764820466409668608

Ejemplares similares