Please use this identifier to cite or link to this item:
Title: Efficient algorithms for conservative parallel simulation of interconnection networks
Authors: Teo, Yong Meng 
Tay, Seng Chuan 
Issue Date: 1994
Citation: Teo, Yong Meng,Tay, Seng Chuan (1994). Efficient algorithms for conservative parallel simulation of interconnection networks : 286-293. ScholarBank@NUS Repository.
Abstract: This paper addresses the use of parallel simulation techniques to speedup the simulation of multistage interconnection networks. The conventional null-message approach to resolving deadlock problem in conservative simulation is based on a lookahead mechanism. For some application domains, unfortunately, the lookahead information is not available. Consequently, the simulation using null messages will be trapped in a livelock. We propose a deadlock/livelock free scheme using null messages, but without the guaranteed lookahead, to coordinate the simulation, and different partitioning techniques for mapping of the simulation program onto multicomputers. A flushing mechanism to address the combinatoric explosion of using null-message in conservative simulation is also discussed. Our analysis shows that the proposed flushing mechanism effectively reduces the number of null messages from exponential to linear.
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Nov 9, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.