World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

SORTING AND ROUTING ON OTIS-MESH OF TREES

    OTIS (optical transpose interconnection system) is a popular model of optoelectronic parallel computers that has gained enormous attention in the recent years. Several parallel algorithms have been published for many fundamental problems on this architecture. In this paper, first we propose a parallel algorithm for sparse enumeration sort on OTIS-Mesh of Trees (OTIS-MOT). For N (= n2) data elements, our sorting algorithm requires 4 log N electronic moves + 3 OTIS moves. We next present a shortest path routing algorithm that runs also in logarithmic time.

    References