Sanjiv K. Bhatia
- [1] G. H. Barnes, R. M. Brown, M. Kato, D. J. Kuck, D. L. Slotnik, and R. A. Stokes The Illiac-IV Computer IEEE Trans. Comput., vol. C-17, pp. 746-757, August 1968.Google Scholar
- 2. J. L. Bentley A Parallel Algorithm for Constructing Minimum Spanning Trees J. Algorithms, vol. 1, pp. 51-59, 1980.Google ScholarCross Ref
- [3] M. J. Carey and C. D. Thompson An Efficient Implementation of Search Trees on ¿lg N +1¿ Processors IEEE Trans. Comput., vol. C-33, pp. 1038-1041, November 1984.Google Scholar
- [4] A. L. P. Chen and V. O. K. Li Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems IEEE Trans. Comput., vol. C-33, pp. 959-967, November 1984.Google Scholar
- [5] H. C. Du On the Performance of Synchronous Multiprocessors IEEE Trans. Comput., vol. C-34, pp. 462-466, May 1985.Google Scholar
- [6] S. Even Graph Algorithms Computer Science Press, 1979. Google ScholarDigital Library
- [7] T. Feng A Survey of Interconnection Networks Computer, vol. 14, no. 12, pp. 12-27, December, 1981.Google Scholar
- [8] E. Horowitz and S. Sahni Fundamentals of Computer Algorithms Computer Science Press, 1978. Google ScholarDigital Library
- [9] K. Hwang, and A. Briggs Computer Architecture and Parallel Processing McGraw-Hill 1984. Google ScholarDigital Library
- [10] C. E. Leiserson Fat Trees: Universal Networks for Hardware Efficient Supercomputing IEEE Trans. Comput., vol. C-34, pp. 892-901, October 1985. Google ScholarDigital Library
- [11] B. E. Meserve Fundamental Concepts of Algebra Dover Publications, New York, 1982.Google Scholar
- [12] D. K. Pradhan Dynamically Restructurable Fault Tolerant Processor Network Architectures IEEE Trans. Comput., vol. C-34, pp. 434-447, May 1985.Google Scholar
- [13] R. Rettberg and R. Thomas Contention is No Obstacle to Shared Memory Multiprocessing Comm. ACM, vol. 29, pp. 1202-1212, December 1986. Google ScholarDigital Library
- [14] K. G. Shin, Y. H. Lee, and J. Sasidhar Design of HM2p - A Hierarchical Multimicroprocessor for General Purpose Applications IEEE Trans. Comput., vol. C-31, pp. 1045-1053, November 1982.Google Scholar
- [15] S. L. Stepoway, D. L. Wells, and G. R. Kane A Multiprocessor Architecture for Generating Fractal Surfaces IEEE Trans. Comput., vol. C-33, pp. 1041-1045, November 1984.Google Scholar
- [16] D. F. Wann and M. A. Franklin Asynchronous and Clocked Control Structures for VLSI Based Interconnection Networks IEEE Trans. Comput., vol. C-32, pp. 284-293, March 1983.Google Scholar
- [17] N. S. Woo and A. Agrawala A Symmetric Tree Structure Interconnection Network and its Message Traffic IEEE Trans. Comput., vol. C-34, pp. 765-769, August 1985. Google ScholarDigital Library
- [18] V. Zakharov Parallel and Array Processing IEEE Trans. Comput., vol. C-33, pp. 45-78, January 1984.Google Scholar
Index Terms
- Multilayered illiac network scheme
Recommendations
A hybrid ARQ/FEC scheme for noisy ATM network links
ATM is accepted to be the transport technique for B-ISDN. ATM networks suffer from cell loss due to buffer overflow and/or corruption of the cell header because of channel errors. Originally, ATM networks were designed to work over fiber links that have ...
Parallel sorting on ILLIAC array processor
ISTASC'07: Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7Nowadays, we need to speed up solving computer problems such as sorting. Because of limitations in processor's speed, using parallel algorithms is inevitable. In parallel algorithms, because of cost limitations and architecture complexity, it's not ...
A DAMQ shared buffer scheme for network-on-chip
CSS '07: Proceedings of the Fifth IASTED International Conference on Circuits, Signals and SystemsIn this paper we present a novel shared buffer scheme for network on chip applications. The proposed scheme is based on a dynamically allocated multi queue self-compacting buffer. Two physical channels share the same buffer space. This in turn provides ...
Comments