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

$51.00 (C)

Part of Cambridge International Series on Parallel Computation

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

$ 51.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Processor networks consisting of a thousand and more processing nodes that interact by sending messages over a communications network are feasible today. They can only meet the market's demand for high-speed, low-cost computing when adequate facilities for the implementation of distributed programs--programs consisting of a collection of processes that communicate and synchronize via the exchange of messages--are offered. This book investigates some of these facilities by viewing both the processor network and the distributed program as a graph. Dr. Hilbers begins 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. The author closes by discussing message routing within a processor network.

    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

    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

  • Author

    Peter A. J. Hilbers

Sign In

Please sign in to access your account


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

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 Please see the permission section of the 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.


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.