Learn More
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus. Specifically, for any PN, our algorithm routes any permutation of N elements on a P-processor model optimally in O(N P) steps. This algorithm extends naturally to one for routing(More)
Recently, many models using reconngurable optically pipelined buses have been proposed in the literature. We present simulations for a number of these models and establish that they possess the same complexity, so that any of these models can simulate a step of one of the other models in constant time with a polynomial increase in size. Speciically, we(More)
Peer-to-peer (P2P) architectures for Massively Multiplayer Online Games (MMOG) provide better scalability than Client/Server (C/S); however, they increase the possibility of cheating. Recently proposed P2P protocols use trusted referees that simulate/validate the game to provide security equivalent to C/S. When selecting referees from un-trusted peers,(More)
Dedicated to my dear parents ii Acknowledgements I would like to thank my advisor Dr. Ahmed El. Amawy for the ideas that led to this work, for his timely comments, guidance, support and patience throughout the course of this work. I thank Dr. Jerry Trahan and Dr. Hsiao-Chun Wu for being on my defense committee. I thank all the members of the Optical(More)
division and shift instructions in parallel random access machines, Theoretical Computer Science 100 (1992) l-44. We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or on a PRAM with unit-cost shifts is equivalent to polynomial space on a Turing machine (PSPACE). This extends the result that(More)