skip to main content
research-article

Distributed programming framework for fast iterative optimization in networked cyber-physical systems

Published:27 January 2014Publication History
Skip Abstract Section

Abstract

Large-scale coordination and control problems in cyber-physical systems are often expressed within the networked optimization model. While significant advances have taken place in optimization techniques, their widespread adoption in practical implementations has been impeded by the complexity of internode coordination and lack of programming support for the same. Currently, application developers build their own elaborate coordination mechanisms for synchronized execution and coherent access to shared resources via distributed and concurrent controller processes. However, they typically tend to be error prone and inefficient due to tight constraints on application development time and cost. This is unacceptable in many CPS applications, as it can result in expensive and often irreversible side-effects in the environment due to inaccurate or delayed reaction of the control system.

This article explores the design of a distributed shared memory (DSM) architecture that abstracts the details of internode coordination. It simplifies application design by transparently managing routing, messaging, and discovery of nodes for coherent access to shared resources. Our key contribution is the design of provably correct locality-sensitive synchronization mechanisms that exploit the spatial locality inherent in actuation to drive faster and scalable application execution through opportunistic data parallel operation. As a result, applications encoded in the proposed Hotline Application Programming Framework are error free, and in many scenarios, exhibit faster reactions to environmental events over conventional implementations.

Relative to our prior work, this article extends Hotline with a new locality-sensitive coordination mechanism for improved reaction times and two tunable iteration control schemes for lower message costs. Our extensive evaluation demonstrates that realistic performance and cost of applications are highly sensitive to the prevalent deployment, network, and environmental characteristics. This highlights the importance of Hotline, which provides user-configurable options to trivially tune these metrics and thus affords time to the developers for implementing, evaluating, and comparing multiple algorithms.

References

  1. R. Balani. 2009. Hotline App. Programming Framework. http://nesl.ee.ucla.edu/projects/hotline.Google ScholarGoogle Scholar
  2. R. Balani. 2011. Distributed programming framework for fast iterative optimization in networked cyber-physical systems. Ph.D. dissertation. University of california at Los Angeles. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Balani, N. H. Chehade, S. Chakraborty, and M. B. Srivastava. 2011a. Distributed coordination for fast iterative optimization in wireless sensor/actuator networks. In Proceedings of the SECON.Google ScholarGoogle Scholar
  4. R. Balani, K. Lin, L. Wanner, J. Friedman, R. K. Gupta, and M. B. Srivastava. 2011b. Programming support for distributed optimization and control in cyber-physical systems. In Proceedings of the ACM/IEEE 2nd International Conference on Cyber-physical Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Costa, L. Mottola, A. Murphy, and G. Picco. 2007. Programming wireless sensor networks with the teenylime middleware. Middleware'07. Lecture Notes in Computer Science, vol. 4834, Springer, Berlin, 429--449. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. W. F. Fung, D. Sun, and J. Gehrke. 2002. Cougar: The network is the database. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 621. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Gelernter. 1985. Generative communication in Linda. ACM Trans. Program. Lang. Syst. 7, 1, 80--112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Girod, Y. Mei, R. Newton, S. Rost, A. Thiagarajan, H. Balakrishnan, and S. Madden. 2008. XStream: A signal-oriented data stream management system. In Proceedings of the International Conference on Data Engineering. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. W. Hnat, T. I. Sookoor, P. Hooimeijer, W. Weimer, and K. Whitehouse. 2008. MacroLab: A vector-based macroprogramming framework for cyber-physical systems. In Proceedings of the Sensys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Johansson, T. Keviczky, M. Johansson, and K. H. Johansson. 2008. Subgradient methods and consensus algorithms for solving convex optimization problems. In Proceedings of the IEEE Conference on Decision and Control.Google ScholarGoogle Scholar
  11. M. Jovanovic and V. Milutinovic. 1999. An overview of reflective memory systems. IEEE Concu. 7, 2, 56--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Kansal, W. Kaiser, G. Pottie, M. Srivastava, and G. Sukhatme. 2006. Virtual high resolution for sensor networks. In Proceedings of the Sensys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Keleher, A. L. Cox, and W. Zwaenepoel. 1992. Lazy release consistency for software distributed shared memory. In Proceedings of the 19th International Symposium on Computer Architecture (ISCA). ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. N. Kothari, R. Gummadi, T. Millstein, and R. Govindan. 2007. Reliable and efficient programming abstractions for wireless sensor networks. In Proceedings of the ACM SIGPLAN PLDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Time, clocks and ordering of events in a distributed system. Comm. ACM, 21, 7, 558--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Levis, N. Lee, M. Welsh, and D. Culler. 2003. TOSSIM: Accurate and scalable simulation of entire TinyOS applications. In Proceedings of the Sensys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Kaisen Lin and Philip Levis. 2008. Data discovery and dissemination with DIP. In Proceedings of the IPSN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. 2003. The design of an acquisitional query processor for sensor networks. In Proceedings of the ACM SIGMOD. 491--502. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Maekawa. 1985. An algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. L. Montestruque, M. Lemmon, and LLC EmNet. 2008. CSOnet: A metropolitan scale wireless sensor-actuator network. In Proceedings of the International Workshop on Mobile Device and Urban Sensing (MODUS).Google ScholarGoogle Scholar
  21. A. Nedic and D. P. Bertsekas. 2001. Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. Newton, G. Morrisett, and M. Welsh. 2007. The regiment macroprogramming system. In Proceedings of the ACM/IEEE IPSN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. K. K. Parhi and D. G. Messerschmitt. 1991. Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Trans. Comput. 40, 2 (1991), 178--195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Y. Park, J. S. Shamma, and T. C. Harmon. 2009. A receding horizon control algorithm for adaptive management of soil moisture and chemical levels during irrigation. Env. Model Softw. 24, 9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. D. Peleg. 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial Mathematics. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. Rabbat and R. Nowak. 2004. Distributed optimization in sensor networks. In Proceedings of the IPSN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. G. Ricart and A. K. Agrawala. 1981. An optimal algorithm for mutual exclusion in computer networks. Comm. ACM 24, 1, 9--17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. V. Singhvi, A. Krause, C. Guestrin, J. H. Garrett Jr., and H. S. Matthews. 2005. Intelligent light control using sensor networks. In Proceedings of the ACM Sensys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. Welsh and G. Mainland. 2004. Programming sensor networks using abstract regions. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. K. Whitehouse, C. Sharp, E. Brewer, and D. Culler. 2004. Hood: A neighborhood abstraction for sensor networks. In Proceedings of the MobiSys. 99--110. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Distributed programming framework for fast iterative optimization in networked cyber-physical systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!