Amazon cover image
Image from Amazon.com

Parallel complexity theory

By: Material type: TextTextSeries: Research Notes in Theoretical Computer SciencePublication details: London Pitman 1987Description: 200 pISBN:
  • 0273087835
  • 0470209313
Subject(s): DDC classification:
  • 004.35 P2P2
Summary: The author presents a theory of parallel computation based on a network model. The network paradigm is fundamental to the understanding of parallel computation, and this assertion is backed up by new theoretical results. Chapters cover the basic model, comparison of the network model to others, programming techniques simulations of the general network model (including a universal feasible network), extension of the network model, the definition of arity, and universal networks, including discussion of their lower bounds and the conditions under which they hold.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Collection Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 02A (0 Floor, West Wing) Non-fiction General Stacks 004.35 P2P2 (Browse shelf(Opens below)) Available 185627

The author presents a theory of parallel computation based on a network model. The network paradigm is fundamental to the understanding of parallel computation, and this assertion is backed up by new theoretical results. Chapters cover the basic model, comparison of the network model to others, programming techniques simulations of the general network model (including a universal feasible network), extension of the network model, the definition of arity, and universal networks, including discussion of their lower bounds and the conditions under which they hold.

There are no comments on this title.

to post a comment.