An evolutionary approach to the parallel task scheduling problem

A parallel program, when running, can be conceived a set of parallel components (tasks) which can be executed according to sorne precedence relationship. In this case efficient scheduling of tasks permits to take full.advantage of the computational power provided by a multiprocessor or a multicompu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Esquivel, Susana Cecilia, Gatica, Claudia Ruth, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1999
Materias:
Ciencias Informáticas
evolutionary approach
scheduling problem
ARTIFICIAL INTELLIGENCE
Scheduling
Parallel
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22225
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22225
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
evolutionary approach
scheduling problem
ARTIFICIAL INTELLIGENCE
Scheduling
Parallel
spellingShingle Ciencias Informáticas
evolutionary approach
scheduling problem
ARTIFICIAL INTELLIGENCE
Scheduling
Parallel
Esquivel, Susana Cecilia
Gatica, Claudia Ruth
Gallard, Raúl Hector
An evolutionary approach to the parallel task scheduling problem
topic_facet Ciencias Informáticas
evolutionary approach
scheduling problem
ARTIFICIAL INTELLIGENCE
Scheduling
Parallel
description A parallel program, when running, can be conceived a set of parallel components (tasks) which can be executed according to sorne precedence relationship. In this case efficient scheduling of tasks permits to take full.advantage of the computational power provided by a multiprocessor or a multicomputer system. This involves the assignment of partially ordered tasks onto the system architecture processing components. Ihis work shows the problem of allocating a number of nonidentical tasks in a multiprocessor or multicomputer system. Ihe model assumes that the system consists of a number of identical processors and only one task may execute on a processor at a time. All schedules and tasks are nonpreeptive. Ihe well-known Grabam's [8] list scheduling algorithm (LSA) is contrasted with an evolutionary approach using the indirect-decode representation.
format Objeto de conferencia
Objeto de conferencia
author Esquivel, Susana Cecilia
Gatica, Claudia Ruth
Gallard, Raúl Hector
author_facet Esquivel, Susana Cecilia
Gatica, Claudia Ruth
Gallard, Raúl Hector
author_sort Esquivel, Susana Cecilia
title An evolutionary approach to the parallel task scheduling problem
title_short An evolutionary approach to the parallel task scheduling problem
title_full An evolutionary approach to the parallel task scheduling problem
title_fullStr An evolutionary approach to the parallel task scheduling problem
title_full_unstemmed An evolutionary approach to the parallel task scheduling problem
title_sort evolutionary approach to the parallel task scheduling problem
publishDate 1999
url http://sedici.unlp.edu.ar/handle/10915/22225
work_keys_str_mv AT esquivelsusanacecilia anevolutionaryapproachtotheparalleltaskschedulingproblem
AT gaticaclaudiaruth anevolutionaryapproachtotheparalleltaskschedulingproblem
AT gallardraulhector anevolutionaryapproachtotheparalleltaskschedulingproblem
AT esquivelsusanacecilia evolutionaryapproachtotheparalleltaskschedulingproblem
AT gaticaclaudiaruth evolutionaryapproachtotheparalleltaskschedulingproblem
AT gallardraulhector evolutionaryapproachtotheparalleltaskschedulingproblem
bdutipo_str Repositorios
_version_ 1764820465376821250

Ejemplares similares