Loading...
Please wait, while we are loading the content...
Similar Documents
Algorithms on a Ring of Processors
| Content Provider | Scilit |
|---|---|
| Author | Casanova, Henri Legrand, Arnaud Robert, Yves |
| Copyright Year | 2008 |
| Description | When writing a parallel algorithm on a distributed-memory platform that consists of multiple processors (e.g., a cluster of workstations with some interconnect technology), it is convenient to abstract away the physical network topology of the platform and to design algorithms using a logical topology instead. This chapter presents several parallel algorithms that are designed for use with a logical ring topology. This topology is both simple, which makes it an ideal candidate for a first look at distributed-memory parallel algorithms, and popular. Indeed, a ring is a linear interconnection network: Each processor has a single predecessor and a single successor. We will see that linear networks make for a natural decomposition of regular data structures like arrays. Book Name: Parallel Algorithms |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2009-0-18633-6&isbn=9780429148484&doi=10.1201/9781584889465-8&format=pdf |
| Ending Page | 162 |
| Page Count | 42 |
| Starting Page | 121 |
| DOI | 10.1201/9781584889465-8 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2008-07-17 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Parallel Algorithms Hardware and Architecturee Parallel Algorithms Distributed Memory Processors Logical Single Predecessor |
| Content Type | Text |
| Resource Type | Chapter |
