Searching for "Periodic comparator networks." – sorted by Relevance.
-
Fast and Feasible Periodic Sorting Networks of Constant Depth
- ,wankag@(email omitted); Abstract A periodic comparator network has depth (or period) k, if for every t ? k, the compare
- Cited by 11 (5 self) – Add To MetaCart
-
On the Minimal Period of Fast Periodic Sorting Networks
- ). Applied to Batcher's algorithms, we get practical period 5 comparator networks that sort in time O(log 3
- Cited by 1 (1 self) – Add To MetaCart
-
Periodification Scheme: Constructing Sorting Networks With Constant Period
- in comparator networks of a constant period, due to their potential applications in hardware design. Previously
- Cited by 3 (0 self) – Add To MetaCart
-
Constructing Sorting Networks With Constant Period
- are interested in using comparator networks with constant period, since they are very easy to implement by VLSI
- Cited by 1 (1 self) – Add To MetaCart
-
Periodic Merging Networks
- comparator network algorithm is periodic with period k if for every moment t of the computation, the parallel
- Cited by 1 (0 self) – Add To MetaCart
-
Periodic Merging Networks
- say that a comparator network algorithm is periodic with period k if for every moment
- Add To MetaCart
-
Traffic Backlog and Impact on Network Dimensioning for Survivability for Wide-Area VP-based ATM
- switched network is the transient or nonstationary congestion period triggered by the backlog of packets
- Cited by 7 (1 self) – Add To MetaCart

