Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-22T20:34:53.010Z Has data issue: false hasContentIssue false

4 - Introduction to Parallel Routing

Published online by Cambridge University Press:  03 October 2009

Yuh-Dauh Lyuu
Affiliation:
NEC Research Institute, New Jersey
Get access

Summary

[E]very time that I went out for a walk

I used to be afraid that the house would

catch fire and the manuscript [of

Principia Mathematica] get burnt up

—Bertrand Russell

This chapter serves two purposes: review of previous work and preview of our new results on the parallel routing problem. Our general approach to the problem is also outlined. The routing schemes and their analysis will appear in the next chapter.

Introduction

Perhaps the most important issue in parallel computers is interprocessor communication. Since processors are linked together by a relatively sparse network due to cost considerations, packets have to traverse many links and even be delayed by other packets due to conflicts or full buffers before reaching their destinations. Communication time, therefore, can easily dominate the total execution time, making designing fast communication schemes a primary concern. It is also preferable that the buffer size be a constant independent of the size of the network for the sake of scalability. Finally, as more components mean more faults [326], other things being equal, the issue of fault tolerance without loss of efficiency should be dealt with together.

We review previous work and preview our approach and results in this chapter. In the next chapter, it will be shown how the above-mentioned problems can be tackled simultaneously using information dispersal.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Introduction to Parallel Routing
  • Yuh-Dauh Lyuu, NEC Research Institute, New Jersey
  • Book: Information Dispersal and Parallel Computation
  • Online publication: 03 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511574955.006
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Introduction to Parallel Routing
  • Yuh-Dauh Lyuu, NEC Research Institute, New Jersey
  • Book: Information Dispersal and Parallel Computation
  • Online publication: 03 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511574955.006
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Introduction to Parallel Routing
  • Yuh-Dauh Lyuu, NEC Research Institute, New Jersey
  • Book: Information Dispersal and Parallel Computation
  • Online publication: 03 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511574955.006
Available formats
×