A shared-memory multiprocessor scheduling algorithm

Irene Zuccar, Mauricio Solar, Fernanda Kri, Víctor Parada

Resultado de la investigación: Contribución a los tipos de informe/libroContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

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 the 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 for every time unit that goes by. The proposed algorithm is compared 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.

Idioma originalInglés
Título de la publicación alojadaProfessional Practice in Artificial Intelligence - IFIP 19th World Computer Congress, TC 12
Subtítulo de la publicación alojadaProfessional Practice Stream
EditoresJohn Debenham
EditorialSpringer New York LLC
Páginas313-321
Número de páginas9
ISBN (versión impresa)9780387346557
DOI
EstadoPublicada - 2006
Publicado de forma externa
Evento2nd Symposium on Professional Practice in Artificial Intelligence, 2006 - Santiago, Chile
Duración: 21 ago 200624 ago 2006

Serie de la publicación

NombreIFIP Advances in Information and Communication Technology
Volumen218
ISSN (versión impresa)1868-4238

Conferencia

Conferencia2nd Symposium on Professional Practice in Artificial Intelligence, 2006
País/TerritorioChile
CiudadSantiago
Período21/08/0624/08/06

Áreas temáticas de ASJC Scopus

  • Sistemas de información
  • Redes de ordenadores y comunicaciones
  • Gestión y sistemas de información

Huella

Profundice en los temas de investigación de 'A shared-memory multiprocessor scheduling algorithm'. En conjunto forman una huella única.

Citar esto