نتایج جستجو برای: مدل OTIS-P

تعداد نتایج: 1384279  

2003
Yaokun Wu Aiping Deng

The Optical Transpose Interconnection System (OTIS) was proposed by Marsden et al. [Opt. Lett 18 (1993) 1083–1085] to implement very dense one-to-one interconnection between processors in a free space of optical interconnections. The system which allows one-to-one optical communications from p groups of q transmitters to q groups of p receivers, using electronic intragroup communications for ea...

2003
Yaokun Wu Aiping Deng

The Optical Transpose Interconnection System (OTIS) was proposed by Marsden et al. [Opt. Lett 18 (1993) 1083–1085] to implement very dense one-to-one interconnection between processors in a free space of optical interconnections. The system which allows one-to-one optical communications from p groups of q transmitters to q groups of p receivers, using electronic intragroup communications for ea...

Journal: :CoRR 2013
Rajib K. Das

In this paper we have classified the nodes of OTIS-cube based on their eccentricities. OTIS (optical transpose interconnection system) is a large scale optoelectronic computer architecture, proposed in [1], that benefit from both optical and electronic technologies. We show that radius and diameter of OTIS-Qn is n + 1 and 2n + 1 respectively. We also show that average eccentricity of OTIS-cube ...

Journal: :Hydrology and Earth System Sciences 2022

Abstract. The transport of solutes in river networks is controlled by the interplay processes such as in-stream solute and exchange water between stream channel dead zones, sediments, adjacent groundwater bodies. Transient storage models (TSMs) are a powerful tool for testing hypotheses related to streams. However, model parameters often do not show univocal increase performances certain parame...

Journal: :IJGHPC 2011
Ahmad Awwad Jehad Al-Sadi Bassam Haddad Ahmad Kayed

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,...

2011
AHMAD M. AWWAD

A number of recent studies have revealed that Optical Transpose Interconnection Systems (OTIS) are promising candidates as future high-performance parallel computers. In this paper we have proposed an efficient routing algorithm for Optical transpose Interconnection System. Some topological properties for the OTIS-Networks are derived including size, degree, diameter, and number of links. The p...

این تحقیق برای آزمون نحوه تبادل جرم مابین مجرای اصلی و مناطق راکد جریان در آبراهه‌های روباز انجام گرفت. معادلات دیفرانسیلی ذخیره-موقت به‌عنوان معادلات اساسی حاکم بر انتقال و پراکندگی آلودگی انتخاب شده و آزمایش‌های این پژوهش در یک فلوم آزمایشگاهی به طول، عرض و ارتفاع (12، 2/1 و 8/0) متر و بر روی یک بستر سنگریزه­ای انجام شد. شیب­های 001/0، 004/0 و 007/0 و دبی­های 5/7، 5/11 و 5/15 لیتربرثانیه برای...

2002
Andre Osterloh

Efficient data transport in parallel computers build on sparse interconnection networks is crucial for their performance. A basic transport problem in such a computer is the k-k routing problem. In this thesis, aspects of the k-k routing problem on r-dimensional meshes and OTIS-G networks are discussed. The first oblivious routing algorithms for these networks are presented that solve the k-k r...

2008

This paper proposes a new network called OTIS-Arrangement Network which is constructed from the cross product of the factor Arrangement network. In this paper, we utilize the features of OTIS networks which use both of electronic and optical networks where many recent studies have showed that OTIS is one of the most promising candidates' networks as future high-speed parallel computers. A gener...

Journal: :CoRR 2011
Esha Ghosh Subhas Kumar Ghosh C. Pandu Rangan

Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید