Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$79.20
Used and New from Other Sellers
Used and New from Other Sellers
from $10.66
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Paperback)
  • All (7) from $10.66   
  • New (3) from $69.70   
  • Used (4) from $10.66   

Overview

Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wide open. The answer to this question must be regarded as mostimportant for the further development of parallel computing and especially for user acceptance.
The First Heinz Nixdorf Symposium brought together leading experts in the field of parallel computing and its applications to discuss the state of the art, promising directions of research, and future perspectives. It was the first in a series of Heinz Nixdorf Symposia,intended to cover varying subjects from the research spectrum of the
Heinz Nixdorf Institute of the University of Paderborn.
This volume presents the proceedings of the symposium, which was held in Paderborn in November 1992. The contributions are grouped into four parts: parallel computation models and simulations, existing parallel machines, communication and programming paradigms, and parallel algorithms.

Read More Show Less

Product Details

  • ISBN-13: 9783540567318
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 11/5/1993
  • Series: Lecture Notes in Computer Science Series , #678
  • Edition description: 1993
  • Edition number: 1
  • Pages: 236
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.52 (d)

Table of Contents

A combining mechanism for parallel computers.- A case for the PRAM as a standard programmer's model.- Hashing strategies for simulating shared memory on distributed memory machines.- Better parallel architectures via emulations.- Relations between models of parallel abstract machines.- Frontiers of parallel computing.- Cost effectiveness of data flow machines and vector processors.- The networks of the connection machine CM-5.- Massively parallel computing: Data distribution and communication.- A realizable efficient parallel architecture.- Hardware support for collective communication operations.- Programmable active memories: a performance assessment.- The role of randomness in the design of interconnection networks.- Chaos router: Finally, a practical adaptive router?.- An experimental study of wormhole routing in parallel computers.- Three non conventional paradigms of parallel computation.- Scalable parallel computers and scalable parallel codes: From theory to practice.- A framework for analyzing locality and portability issues in parallel computing.- Optimal implementation of general divide- and-conquer on the hypercube and related networks.- Parallel implementations of graph embeddings.- On sorting by prefix reversals and the diameter of pancake networks.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)