Abstract
In the design of distributed embedded systems, designers face two problems: how to prevent deadlock and how to improve performance. An accurate model providing abstractions for functionality and performance is important to solve these problems. Self-timed system model that conducts communications based on handshaking protocols is suitable to model these distributed embedded systems. This paper studies the fundamental properties of self-timed systems and proposes solutions of the above two problems. First, we present the necessary and sufficient conditions for a self-timed system constructed from an application to incur deadlocks; then we propose approaches to prevent any deadlocks in constructing self-timed systems. Second, we observe that the different pace of data progressing on two paths, having common source/destination nodes, may cause blocking events (not deadlock) which dramatically degrade the system performance. We establish theorems to detect blocking events and design Mixed-Integer Linear Programming (MILP) formulas to eliminate these events. Experimental results show that most self-timed systems constructed by a straightforward approach incur possible deadlocks, while our proposed methods guarantee no deadlocks. Furthermore, our proposed techniques to eliminate blocking events achieve 48.23 % performance improvements on average, compared with the straightforward approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
There are two types of buffers: in-buffer and out-buffer. The in-buffer(out-buffer) indicates that the buffering unit is attached to the in-port(out-port) of an su.
References
Beerel, P.A., Lines, A., Davies, M., Kim, N.H.: Slack matching asynchronous designs. In: Proceedings of ASYNC, pp. 184–194 (2006)
Burns, S.M.: Performance analysis and optimization of asynchronous circuits (1991)
Chao, L.F., Sha, E.M.: Scheduling data-flow graphs via retiming and unfolding. IEEE Trans. Parallel Dist. Syst. 8(12), 1259–1267 (1997)
Chong, J., Satish, N., Catanzaro, B.C., Ravindran, K., Keutzer, K.: Efficient parallelization of H. 264 decoding with macro block level scheduling. In: Proceedings of ICME, pp. 1874–1877 (2007)
Dick, R.P., Rhodes, D.L., Wolf, W.: TGFF: task graphs for free. In: Proceedings of CODES, pp. 97–101 (1998)
Gill, G., Singh, M.: Automated microarchitectural exploration for achieving throughput targets in pipelined asynchronous systems. In: Proceedings of ASYNC, pp. 117–127. IEEE (2010)
Greenstreet, M.R.: Stari: A Technique for High-bandwidth Communication. Ph.D. thesis, Princeton, NJ, USA (1993), uMI Order No. GAX93-11221
Jiang, W., Zhuge, Q., Chen, X., Yang, L., Yi, J., Sha, E.M.: Properties of self-timed ring architectures for deadlock-free and consistent configuration reaching maximum throughput. J. Signal Process. Syst. pp. 1–15 (2015), http://dx.doi.org/10.1007/s11265-015-0984-6, doi:10.1007/s11265-015-0984-6
Jiang, W., Zhuge, Q., Yi, J., Yang, L., Sha, E.H.: On self-timed ring for consistent mapping and maximum throughput. In: Proceedings of RTCSA, pp. 1–9 (2014)
Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77–84 (1975)
Kroft, D.: All paths through a maze. Proc. IEEE 55(1), 88–90 (1967)
Parhi, K.K., Messerschmitt, D.G.: Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Trans. Comput. 40(2), 178–195 (1991)
Prakash, P., Martin, A.J.: Slack matching quasi delay-insensitive circuits. In: Proceedings of ASYNC, pp. 195–204. IEEE (2006)
Smirnov, A., Taubin, A.: Heuristic based throughput analysis and optimization of asynchronous pipelines. In: Proceedings of ASYNC, pp. 162–172. IEEE (2009)
Stuijk, S., Geilen, M., Basten, T.: SDF3: SDF for free. In: Proceedings of ACSD, vol. 6, pp. 276–278 (2006)
Van Berkel, C., Josephs, M.B., Nowick, S.M.: Applications of asynchronous circuits. Proc. IEEE 87(2), 223–233 (1999)
Williams, T.E.: Performance of iterative computation in self-timed rings. J. VLSI Signal Process. Syst. Signal, Image Video Technol. vol. 7(1–2), pp. 17–31 (1994)
Wolf, M.: High-Performance Embedded Computing: Applications in Cyber-Physical Systems and Mobile Computing. Morgan Kaufmann, Newnes (2014)
Zivojnovic, V., Velarde, J., Schlager, C., Meyr, H.: DSPstone: a DSP-oriented benchmarking methodology. In: Proceedings of ICSPAT (1994)
Acknowledgements
This work is partially supported by National 863 Program 2013AA013202, 2015AA015304, Chongqing High-Tech Research Program cstc2014yykfB40007, NSFC 61472052, NSFC 61173014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sha, E.H.M., Jiang, W., Zhuge, Q., Chen, X., Yang, L. (2015). Prevent Deadlock and Remove Blocking for Self-Timed Systems. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9528. Springer, Cham. https://doi.org/10.1007/978-3-319-27119-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-27119-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27118-7
Online ISBN: 978-3-319-27119-4
eBook Packages: Computer ScienceComputer Science (R0)