Abstract
0(k log N) algorithms are obtained for permuting and sorting N data items on cube and perfect shuffle computers with N**1** plus **1**/**k processing elements, 1 less than equivalent to k less than equivalent to log N. These algorithms directly lead to a generalized-connection-network construction having 0(k log N) delay and 0(k N**1** plus **1**/**k log N) contact pairs. This network has the advantage that the switches can be set in 0(k log N) time by either a cube or perfect shuffle computer with N**1** plus **1**/**k processing elements.
| Original language | English (US) |
|---|---|
| Pages | 1-10 |
| Number of pages | 10 |
| State | Published - 1979 |
| Externally published | Yes |
| Event | Proc Annu Allerton Conf Commun Control Comput 17th - Monticello, IL, USA Duration: Oct 10 1979 → Oct 12 1979 |
Conference
| Conference | Proc Annu Allerton Conf Commun Control Comput 17th |
|---|---|
| City | Monticello, IL, USA |
| Period | 10/10/79 → 10/12/79 |
All Science Journal Classification (ASJC) codes
- General Engineering