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

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

Description

Title: IDRA (IDeal Resource Allocation): A tool for computing ideal speedups
Author/s:
  • Fernandez, M.J.
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: ICLP 1994, Workshop W6: Parallel and Data Parallel Execution of Logic Programs
Event Dates: June 1994
Event Location: Uppsala, Sweden
Title of Book: Proceedings of the Post-ICLP'94 Workshop W6
Date: 1994
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview

Abstract

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.

More information

Item ID: 14672
DC Identifier: http://oa.upm.es/14672/
OAI Identifier: oai:oa.upm.es:14672
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 21 Mar 2013 07:54
Last Modified: 21 Apr 2016 14:26
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM