Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

PRAM implementation on fine-grained MIMD multicomputers

Tools
- Tools
+ Tools

Baude, Francoise (1992) PRAM implementation on fine-grained MIMD multicomputers. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

[img]
Preview
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-220.pdf - Other - Requires a PDF viewer.

Download (1376Kb) | Preview

Request Changes to record.

Abstract

The more user-friendly tools for expressing data-parallelism are encompassed by the PRAM language mechanisms (mainly, global addressing space, implicit processes synchronization). In this paper, we evaluate the cost for implementing such mechanisms on the only class of parallel architectures that should prove to be really scalable as well as versatile, i.e. MIMD fine-grained multicomputers. Being massively parallel, these architectures are constrained to not exceed a given wire density and also to have fine-grained processing nodes. For these reasons, recent algorithmic and hardware technics for hidding communication latency of PRAM emulations by parallel slackness do not apply. We consider an abstraction of these machines by reasoning in terms of the actor model of concurrent computation. Given the architectural constraints raised by the chosen class of architectures, the idea for implementing any PRAM program is to transform it into an actor program such that it can be efficiently implemented on the target machine via mapping technics such as for exemple graph embedding. This requires the underlying communication graph of the actor program to be predictable and sparse. This transformation is grounded on probabilistic theoretical simulations of PRAMs on parallel machines based on sparse communication networks.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Parallel processing (Electronic computers), MIMD computers
Series Name: Department of Computer Science research report
Publisher: University of Warwick. Department of Computer Science
Official Date: May 1992
Dates:
DateEvent
May 1992Completion
Number: Number 220
Number of Pages: 16
DOI: CS-RR-220
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Funder: European Strategic Programme of Research and Development in Information Technology (ESPRIT), Alcatel Alsthom Research, Institut national de recherche en informatique et en automatique (France) (INRIA)
Grant number: P440 (ESPRIT)
Related URLs:
  • Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us