Structural Outlooks for the OTIS-Arrangement Network

Structural Outlooks for the OTIS-Arrangement Network

Ahmad Awwad, Jehad Al-Sadi, Bassam Haddad, Ahmad Kayed
Copyright: © 2011 |Pages: 10
DOI: 10.4018/jghpc.2011040105
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Recent studies have revealed that the Optical Transpose Interconnection Systems (OTIS) are promising candidates for future high-performance parallel computers. This paper presents and evaluates a general method for algorithm development on the OTIS-Arrangement network (OTIS-AN) as an example of OTIS network. The proposed method can be used and customized for any other OTIS network. Furthermore, it allows efficient mapping of a wide class of algorithms into the OTIS-AN. This method is based on grids and pipelines as popular structures that support a vast body of parallel applications including linear algebra, divide-and-conquer types of algorithms, sorting, and FFT computation. This study confirms the viability of the OTIS-AN as an attractive alternative for large-scale parallel architectures.
Article Preview
Top

Introduction

The choice of network topology for parallel systems is a critical design decision that involves inherent trade-offs in terms of efficient algorithms support and network implementation cost. For instance, networks with large bisection width allow fast and reliable communication. However, such networks are difficult to implement using today’s electronic technologies that are two dimensional in nature (Wang & Sahni, 2002). In principle, free-space optical technologies offer several fronts to improve this trade-off. The improved transmission rates, dense interconnects, power consumption, and signal interference are few examples on these fronts (Agelis, 2005; Akers et al., 1977; Dally, 1988; Day & Tripathi, 1990; Hendrick et al., 1959; Wang & Sahni, 2001; Yayla et al., 1998).

In this paper, we focus on Optical Transpose Interconnection Systems Arrangement Networks-(OTIS-AN) which was proposed by Al-Sadi that can be easily implemented using free-space optoelectronic technologies (Agelis, 2005; Al-Sadi & Awwad, 2010). In this model, processors are partitioned into groups, where each group is realized on a separate chip with electronic inter-processor connects. Processors on separate chips are interconnected through free space interconnects. The philosophy behind this separation is to utilize the benefits of both the optical and the electronic technologies.

The advantage of using OTIS as optoelectronic architecture lies in its ability to maneuver the fact that free space optical communication is superior in terms of speed and power consumption when the connection distance is more than few millimeters (Dally, 1988). In the OTIS-AN, shorter (intra-chip) communication is realized by electronic interconnects while longer (inter-chip) communication is realized by free space interconnects.

Extensive modeling results for the OTIS have been reported in (Day & Tripathi, 2002). The achievable Terra bit throughput at a reasonable cost makes the OTIS-AN a strong competitive to the to its factor network (Dally, 1988; Krishnamoorthy et al., 1992; Marsden et al., 1993).

These encouraging findings prompt the need for further testing of the suitability of the OTIS-AN for real-life applications. A number of recent studies have been conducted in this direction (Al-Sadi, 2004; Awwad & Al-Ayyoub, 2001; Chatterjee & Pawlowski, 1999; Day & Al-Ayyoub, 2002). Awwad (2005) have presented and evaluated various algorithms on OTIS-networks such as basic data rearrangements, routing, selection and sorting. They have also developed algorithms for various matrix multiplication operations and image processing (Sahni & Wang, 1997; Wang & Sahni, 2000). Zane et al. (2000) have shown that the OTIS-mesh efficiently embeds four-dimensional meshes and hypercubes.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 2 Issues (2023)
Volume 14: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing