Power and Limitations of Optical Reconfigurable Arrays

Sibeyn, Jop F.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Power and Limitations of Optical Reconfigurable Arrays

MPS-Authors

Sibeyn, Jop F.
Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Sibeyn, J. F. (1999). Power and Limitations of Optical Reconfigurable Arrays. In C., Gavoille, J.-C., Bermond, & A., Raspaud (Eds.), Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6) (pp. 249-263). Waterloo, Canada: Carleton Scientific.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3602-F

要旨

The mesh with optical reconfigurable buses is one of the strongest interconnection networks one can think of. There is a constant-time randomized selection algorithm. In this paper, a deterministic selection algorithm is given that runs in $\go{(\log\log N)^2}$ time. It was known that $h$-relations can be routed randomizedly in $\go{h}$ time, here we show that the same can be achieved with a deterministic algorithm. The sorting problem is analyzed in detail, and a new faster algorithm is presented.