Chiang, Y B

Cape Town University OpenUCT

English

A Hypercubic Sorting Network with Nearly Logarithmic Depth.

A Minimum Area VLSI Network for O(log nl Time Sorting.

A Modulo Merge Sorting Network.

A new Routing Algorithm for a Class of Rearrangeable Net.works.

A Novel Deterministic Sampling Scheme with Applications t.o Broadcast-Efficient ~orting on the Reconfigurable Mesh.

A permutation Network.

A Two-Dimensional Buddy System for Dynamic Resource Allocat.ion in A Partitionable Mesh Connected System.

Access and Alignment of Data in a Array Processor.

Adaptive Bitonic Sorting: An Optimal Parallel Algorithm For Shared-Memory Machines.

Aggaewal

An Architecture for Bitonic Sorting with Optimal VLSI Performance.

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes.

An Inherently Fault Tolerant Sorting Algorithm.

An O(nlogn) sorting network.

An Opt.imal Sorting Algorithm on Reconfigurablp l\lesh .

An Optimally Efficient Selection Algorithm.

Bitonic Sort on a Mesh-Connected Parallel Computer.

Bitonic Sorting on Benes Networks.

Cellular Interconnection Arrays.

Classification Categories and Historical Development of Circuit. Switching Topologies.

Computational Aspects of VLSI. Rockville. Comput.er Science Press.

Decomposition of Permutation Networks.

Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks.

Fault Tolerant Sorting Networks.

Graph Theoretical Analysis and Design of Multistage Interconnection Networks.

Halvers and Expanders.

How to Sort N items Using a Sorting Network of Fixed I/O Size.

Hypercubie Sorting Networks.

Interconnection Networks Based on a Generalization of Cube-Connected Cycles.

Interconnection Networks for Multiprocessors and MultiComputers: Theory and Practice.

Interconnection Networks Using Shuffles.

Introduction to Algorithms. The MIT Press.

Introduction to Combinatorics.

Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan-Kaufmann,

Invariant Propert.ies of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network.

Limits on Interconnection Network Performance.

Lower Bounds for Sorting Ketworks.

Lower Bounds for Sorting on Mesh-Connected Architectures.

Merging and Sorting Networks with the Topology of the Omega Network.

Multicomparator Sorting Networks with Better Packaging. In preparation.

Multiway Merging in Parallel.

Notes on Shuffle/Exchange-Type Switching Networks.

Olariu (l998),Work-Time Optimal k-merge Algortihmson the PRAM.

On a class of Multistage Interconnection Networks.

On a Class of Rearrangeable Networks.

On t.he Rearrangeability of 2(log2 N) - 1 Stage Permutation Networks.

On the Permutation Capability of Multist.age Interconnection Networks.

Optimal Emulations by Butterfly-Like Networks.

Optimal Rearrangeable Multistage Connecting N et.works.

Optimal VLSI Circuits for Sorting.

Orthogonal Graphs for The Construction of a Class of Interconnection Networks.

Parallel Merge Sort.

Parallel Sorting in Two-Dimensional VLSI Models of Comput.ation.

Parceling the butterfty and the Batcher sorting Network.

Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems.

Permutation Groups, Complexes and Rearrangeable Connecting Networks.

Perormance of Processor-Memory Interconnections for Multiprocessors.

Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups.

Proving the Rearrangeability of Connecting Networks by group Calculations.

Rearrangeability of Shuffle-Exchange Networks.

Reddy (198i). Augmented ShufHe-Excahnge Multistage Interconnection Networks.

Robust Shearsort on Incomplete Bypass Meshes.

Rondomized Multipacket Routing and Sorting on Meshes.

Sorting n Numbers on n x n Reconfigurable Meshes with Buses.

Sorting n Objects With a k-Sorter.

Sorting Networks and their application.

Sorting on a Mesh-Connected Parallel Computer.

Square Meshes are not always Optimal.

Systolic Sorting on a MeshConnected Network.

The Double Baseline is Rearrangeable. Research Report of

The Double Butterfly is Rearrangeable for N = 32.

The generalized class of g-chain periodic sorting networks.

The New Class of g-chain Periodic Sorters.

The Periodic Balanced Sort.ing Network,

The Universality of the Shuffle-Exchange Network.

The VLSI Complexity of Sorting.

Tight Bounds on the Complexit.y of Parallel Sorting.

Tripathi

Tsao-Wu

VLSI Sorting with Reduced Hardware.

Sorting networks using k-comparators

https://open.uct.ac.za/bitstream/11427/4871/1/thesis_sci_2001_chiang_y_b.pdf

Sorting networks using k-comparators

Abstract

Similar works

Full text

Available Versions

Cape Town University OpenUCT