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

On the power of parallel machines with high-arity instruction sets

Tools
- Tools
+ Tools

Parberry, Ian (1983) On the power of parallel machines with high-arity instruction sets. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

[img]
Preview
PDF
WRAP_cs-rr-058.pdf - Other - Requires a PDF viewer.

Download (4Mb) | Preview

Request Changes to record.

Abstract

We consider various models of parallel computers based on communication networks of sequential processors. The degree of a parallel machine is the number of communication lines connected Lo each processor; the arity is the number of these lines which a processor can actively manipulate at any given time. The emphasis of current research has been placed on constant-arity machines; however, machines with higher arity have occasionally made an appearance.

Our aim is to investigate the relative computing power of these high-arity parallel computers. .We present a high-arity model and show that machines with arity and degree A(n) are more powerful than those of arity o(A(n)). Despite this, we are able to show that P(n) processor parallel computers with arity and degree O(1og P(n)) are not much more powerful than those of constant degree, in the sense that they can be efficiently simulated by a practical universal parallel machine.

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 computers
Series Name: Department of Computer Science Research Report
Publisher: University of Warwick. Department of Computer Science
Place of Publication: Coventry, UK
Official Date: November 1983
Dates:
DateEvent
November 1983Completion
Number: Number 58
Number of Pages: 23
DOI: CS-RR-058
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
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