@article {19268,
	title = {Multithreaded Simulation for Synchronous Dataflow Graphs},
	journal = {ACM Trans. Des. Autom. Electron. Syst.},
	volume = {16},
	year = {2011},
	month = {2011},
	pages = {25:1 - 25:23},
	abstract = {For system simulation, Synchronous DataFlow (SDF) has been widely used as a core model of computation in design tools for digital communication and signal processing systems. The traditional approach for simulating SDF graphs is to compute and execute static schedules in single-processor desktop environments. Nowadays, however, multicore processors are increasingly popular desktop platforms for their potential performance improvements through thread-level parallelism. Without novel scheduling and simulation techniques that explicitly explore thread-level parallelism for executing SDF graphs, current design tools gain only minimal performance improvements on multicore platforms. In this article, we present a new multithreaded simulation scheduler, called MSS, to provide simulation runtime speedup for executing SDF graphs on multicore processors. MSS strategically integrates graph clustering, intracluster scheduling, actor vectorization, and intercluster buffering techniques to construct InterThread Communication (ITC) graphs at compile-time. MSS then applies efficient synchronization and dynamic scheduling techniques at runtime for executing ITC graphs in multithreaded environments. We have implemented MSS in the Advanced Design System (ADS) from Agilent Technologies. On an Intel dual-core, hyper-threading (4 processing units) processor, our results from this implementation demonstrate up to 3.5 times speedup in simulating modern wireless communication systems (e.g., WCDMA3G, CDMA 2000, WiMax, EDGE, and Digital TV).},
	keywords = {multithreaded simulation, scheduling, Synchronous dataflow},
	isbn = {1084-4309},
	url = {http://doi.acm.org/10.1145/1970353.1970358},
	author = {Chia-Jui Hsu and Pino, Jos{\'e} Luis and Bhattacharyya, Shuvra S.}
}
