Skip to content
Register Sign in Wishlist
Look Inside Processor Networks and Aspects of the Mapping Problem

Processor Networks and Aspects of the Mapping Problem

Part of Cambridge International Series on Parallel Computation

  • Date Published: April 2012
  • availability: Available
  • format: Paperback
  • isbn: 9781107404175

Paperback

Add to wishlist

Other available formats:
Hardback


Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • In this 1991 book, Hilbers discusses the general case of how to use processors simultaneously in order to solve a single problem rather than any specific application, and develops a theory independent of particular architectures. He starts by introducing distributed computing with graph theory, and considers processor networks and their price/performance ratios. He goes on to look at obtaining homogeneous distributions of work over networks and considers examples. Finally he discusses message routing within a processor network. This is intended to be a fundamental treatment of the relevant subjects and is aimed at computer scientists and graduate students in computer science who have experience with parallel processing: it will also be useful to others interested in processor networks.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2012
    • format: Paperback
    • isbn: 9781107404175
    • length: 144 pages
    • dimensions: 244 x 170 x 8 mm
    • weight: 0.24kg
    • availability: Available
  • Table of Contents

    Preface
    1. Introduction
    2. Processor networks
    3. A new operation on graphs
    4. Homogenous mappings
    5. Mappings of binary tree computation graphs
    6. Mappings on torus-connected graphs
    7. Deadlock-free message routing in processor networks
    References
    Index.

  • Author

    Peter A. J. Hilbers

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×