Browsing by Author "Tay S C"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
- ItemAn O(nlog}) Hybrid Sorting Algorithm on 2-D Grid(1993-01-01T00:00:00Z) Tay S C; Tan K P; Ong G HAbstract not available.
- ItemParallel Block Sort Using Grid Heap and Exclusive Splittings(1993-06-01T00:00:00Z) Tay S C; K P Tan; G H OngAbstract not available.
- ItemParallel Discrete-Event Simulation on Distributed-Memory Multicomputers(1994-03-01T00:00:00Z) Tay S C; Teo Yong MengAs computers become more powerful and their use expands, the need to simulate larger and more complex systems in reasonable computing times becomes more important. Parallel simulation can significantly speedup the process. Nevertheless, simulating complex systems on high-speed computers with multiprocessor capabilities is not a trivial task. This paper describes the parallel simulation of multi-station queueing networks on distributed-memory multicomputers. A deadlock-free conservative scheme for organizing parallel simulation is proposed, and implemented on a network of workstations running the PVM software. Preliminary results show that close-to-linear performance speedup can be achieved when the simulated system can be partitioned into processes of sufficiently large grain-size.
- ItemParallel Grid Sorting Algorithm Using Synchronous Approach(1992-05-01T00:00:00Z) Tay S C; Tan K P; Ong G HAbstract not available.
- ItemA Parallel Hybrid Sort on 2-D Grid(1993-03-01T00:00:00Z) Tay S C; Tan K P; Ong G HAbstract not available.