| Presentation | 2003/10/20 On Optimal Merging Networks Kazuyuki AMANO, Akira MARUOKA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We prove that Batcher's odd-even (m, n)-merging networks are exactly optimal for (m, n)=(3,4k+2) and (4,4k+2) for k≧0 in terms of the number of comparators used. For other cases where m≦4, the optimality of Batcher's (m, n)-merging networks has been proved. So we can conclude that Batcher's odd-even merge yields optimal (m, n)-merging networks for every m≦4 and for every n. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | comparator networks / merging networks / Batcher's odd-even merge / lower bounds |
| Paper # | COMP2003-53 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2003/10/20(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On Optimal Merging Networks |
| Sub Title (in English) | |
| Keyword(1) | comparator networks |
| Keyword(2) | merging networks |
| Keyword(3) | Batcher's odd-even merge |
| Keyword(4) | lower bounds |
| 1st Author's Name | Kazuyuki AMANO |
| 1st Author's Affiliation | GSIS, Tohoku University() |
| 2nd Author's Name | Akira MARUOKA |
| 2nd Author's Affiliation | GSIS, Tohoku Univeristy |
| Date | 2003/10/20 |
| Paper # | COMP2003-53 |
| Volume (vol) | vol.103 |
| Number (no) | 394 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |