IDRA (IDeal Resource Allocation): A tool for computing ideal speedups

Fernandez, M.J.; Carro Liñares, Manuel y Hermenegildo, Manuel V. (1994). IDRA (IDeal Resource Allocation): A tool for computing ideal speedups. En: "ICLP 1994, Workshop W6: Parallel and Data Parallel Execution of Logic Programs", June 1994, Uppsala, Sweden.

Descripción

Título: IDRA (IDeal Resource Allocation): A tool for computing ideal speedups
Autor/es:
  • Fernandez, M.J.
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: ICLP 1994, Workshop W6: Parallel and Data Parallel Execution of Logic Programs
Fechas del Evento: June 1994
Lugar del Evento: Uppsala, Sweden
Título del Libro: Proceedings of the Post-ICLP'94 Workshop W6
Fecha: 1994
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

Performance studies of actual parallel systems usually tend to concéntrate on the effectiveness of a given implementation. This is often done in the absolute, without quantitave reference to the potential parallelism contained in the programs from the point of view of the execution paradigm. We feel that studying the parallelism inherent to the programs is interesting, as it gives information about the best possible behavior of any implementation and thus allows contrasting the results obtained. We propose a method for obtaining ideal speedups for programs through a combination of sequential or parallel execution and simulation, and the algorithms that allow implementing the method. Our approach is novel and, we argüe, more accurate than previously proposed methods, in that a crucial part of the data - the execution times of tasks - is obtained from actual executions, while speedup is computed by simulation. This allows obtaining speedup (and other) data under controlled and ideal assumptions regarding issues such as number of processor, scheduling algorithm and overheads, etc. The results obtained can be used for example to evalúate the ideal parallelism that a program contains for a given model of execution and to compare such "perfect" parallelism to that obtained by a given implementation of that model. We also present a tool, IDRA, which implements the proposed method, and results obtained with IDRA for benchmark programs, which are then compared with those obtained in actual executions on real parallel systems.

Más información

ID de Registro: 14672
Identificador DC: http://oa.upm.es/14672/
Identificador OAI: oai:oa.upm.es:14672
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 21 Mar 2013 07:54
Ultima Modificación: 21 Abr 2016 14:26
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM