View Document Preview and Link Document Date: 2014-09-26 08:28:48 Open Document File Size: 205,30 KB Share Result on Facebook
City New York / / Company COUNTING NETWORKS / / Country United States / / Facility Carnegie Mellon University / / IndustryTerm oblivious comparison-exchange algorithm / depth sorting network / e.g. peer-to-peer networks / oblivious comparison-exchange network / hardware solution / batcher sorting network / comparison networks / distributed sorting algorithm / isomorphic network / comparison network / load balancing infrastructure / systolic hardware / odd/even sort algorithm / synchronous algorithm / batcher sorting networks / distributed computing / computing / merger network / grid network / bitonic sorting network / orthodox singleprocessor sorting algorithm / simpler algorithm / example sorting network / sequential sorting algorithms / bitonic counting network / hypercubic networks / / Organization US Federal Reserve / Carnegie Mellon University / / Person James Aspnes / Parallel / Endre Szemer´edi / Claus Peter Schnorr / Isaac D. Scherson / Miklos Ajtai / Janos Koml´os / Sandeep Sen / Kazuhiro Sado / Selmer M. Johnson / Costas Busch / Hsiang Tsung Kung / David Thompson / Yoshihide Igarashi / Donald E. Knuth / Lester R. Ford / Nico Habermann / Maurice Herlihy / Adi Shamir / Nir Shavit / / Position engineer / / ProvinceOrState New York / / PublishedMedium The American Mathematical Monthly / / Technology orthodox singleprocessor sorting algorithm / central processor / load balancing / sorting algorithm / synchronous algorithm / odd/even sort algorithm / distributed sorting algorithm / requesting processor / sequential sorting algorithms / 33 Algorithm / oblivious comparison-exchange algorithm / simpler algorithm / Parallel Processing / / SocialTag 
32 CHAPTER 4. DISTRIBUTED SORTING Algorithm 16 Odd/Even Sort 1: Given an array of n nodes (v1 , . . . , vn ), each storing a value (not sorted).