de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Power and Limitations of Optical Reconfigurable Arrays

MPG-Autoren

Sibeyn,  Jop F.
Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3602-F
Zusammenfassung
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.