article · 1996
Randomized Sorting on Optically Interconnected Parallel Computer
Bhattacharya Chrostowski
Cited by 0Abstract and details only
Abstract
In this paper we present an efficient randomized sorting algorithm for a multiprocessor computer which uses all-to-all broadcast freespace optical interconnects. This algorithm has a better time complexity compared to other sorting algorithms utilizing optical processing that have been proposed in the existing literature. The present algorithm has better performance compared to similar randomized sorting algorithms on electrically interconnected mutiprocessors, due to the higher bandwidths and parallelism of optical interconnections. 1 Introduction High bandwidth and low latency are the requirements for interconnection networks for high performance computers. As individual processor data rates and complexities grow, electrical interconnects impose a communications bottleneck since the bandwidth of each link and the physical distance these links can cover are limited by power dissipation and electrical crosstalk[11, 12, 5, 8, 9]. The result is a limitation in practical increases in t...
Cite this paper
Chrostowski, B. (1996). Randomized Sorting on Optically Interconnected Parallel Computer.
Chrostowski, Bhattacharya. “Randomized Sorting on Optically Interconnected Parallel Computer.” 1996.
Chrostowski, Bhattacharya. 1996. “Randomized Sorting on Optically Interconnected Parallel Computer.”
Chrostowski, B. (1996) ‘Randomized Sorting on Optically Interconnected Parallel Computer’.
@article{chrostowski1996randomized,
title = {{Randomized Sorting on Optically Interconnected Parallel Computer}},
author = {Chrostowski, Bhattacharya},
year = {1996}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.