Abstract
This paper presents a formal approach of designing software robust against communication latencies that typically occur in distributed embedded systems. In this approach, the software’s data-flow is retimed and scheduled in order to achieve the maximum robustness against possible communication latencies. This robustness is derived individually for a given software and its distribution on a platform’s communication topology. Robustness is interpreted as the guaranteed amount of time, up to which the system does not change its externally observable behavior due to communication latencies. The software’s data-flow is given as a data-flow graph with nodes representing tasks and edges representing communication channels. A linear problem approach is employed that transforms elements of data-flow into variables of linear expressions. An implementation of the approach in the tool Cadmos together with the application on a case example from the automotive software engineering domain shows its practicability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Harel, D., Pnueli, A.: On the development of reactive systems, pp. 477–498. Springer-Verlag New York, Inc., New York (1985)
Davis, A., Keller, R.: Data flow program graphs. Computer 15(2), 26–41 (1982)
Lee, E., Messerschmitt, D.: Synchronous data flow. Proceedings of the IEEE 75(9), 1235–1245 (1987)
Parhi, K.: Algorithm transformation techniques for concurrent processors. Proceedings of the IEEE 77(12), 1879–1895 (1989)
Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors: Scheduling and Synchronization, 1st edn. Marcel Dekker, Inc., New York (2000)
Brock, J., Ackerman, W.: Scenarios: A model of non-determinate computation. In: Díaz, J., Ramos, I. (eds.) Formalization of Programming Concepts. LNCS, vol. 107, pp. 252–259. Springer, Heidelberg (1981)
Leiserson, C., Rose, F., Saxe, J.: Optimizing synchronous circuitry by retiming. In: Third Caltech Conference on Very Large Scale Integration, pp. 87–116. Computer Science Press, Incorporated (1983)
Leiserson, C., Saxe, J.: Retiming synchronous circuitry. Algorithmica 6(1), 5–35 (1991)
Chao, L.F., Sha, E.H.M.: Scheduling data-flow graphs via retiming and unfolding. IEEE Trans. Parallel Distrib. Syst. 8, 1259–1267 (1997)
Broy, M.: Relating time and causality in interactive distributed systems. European Review 18(04), 507–563 (2010)
Schwitzer, W., Popa, V., Chessa, D., Weissenberger, F.: Cadmos - A concurrent architectures toolkit (2012), http://code.google.com/p/cadmos/ (accessed April 03, 2012)
LP_Solve Developers: LP_Solve Website (2012), http://lpsolve.sourceforge.net/ (accessed April 03, 2012)
Feilkas, M., Fleischmann, A., Hölzl, F., Pfaller, C., Scheidemann, K., Spichkova, M., Trachtenherz, D.: A Top-Down Methodology for the Development of Automotive Software. Technical report, Technische Universität München (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Popa, V., Schwitzer, W. (2012). Optimizing the Robustness of Software against Communication Latencies in Distributed Reactive Embedded Systems. In: Stoelinga, M., Pinger, R. (eds) Formal Methods for Industrial Critical Systems. FMICS 2012. Lecture Notes in Computer Science, vol 7437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32469-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-32469-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32468-0
Online ISBN: 978-3-642-32469-7
eBook Packages: Computer ScienceComputer Science (R0)