Distributed Programming Framework for Fast Iterative Optimization in Networked Cyber-Physical Systems

被引:3
作者
Balani, Rahul [1 ]
Wanner, Lucas F. [3 ]
Srivastava, Mani B. [2 ]
机构
[1] IBM Res Corp, New Delhi, India
[2] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90024 USA
[3] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90024 USA
基金
美国国家科学基金会;
关键词
Design; Algorithms; Performance; Wireless sensor/actuator networks; distributed optimization; distributed shared memory; synchronization; subgradient methods;
D O I
10.1145/2544375.2544386
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:26
相关论文
共 30 条
  • [1] [Anonymous], 2000, SIAM MONOG DISCR MAT
  • [2] Balani R., 2011, P ACM IEEE 2 INT C C
  • [3] Balani R., 2011, THESIS U CALIFORNIA
  • [4] Balani R., 2011, P SECON
  • [5] Balani R., 2009, HOTLINE APP PROGRAMM
  • [6] Costa P, 2007, LECT NOTES COMPUT SC, V4834, P429
  • [7] CSOnet: Ametropolitanscalewirelesssensor-actuatornetwork, 2008, P ACM IEEE IPSN
  • [8] FUNG WAIFU., 2002, SIGMOD 02, P621
  • [9] GENERATIVE COMMUNICATION IN LINDA
    GELERNTER, D
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (01): : 80 - 112
  • [10] Girod L., 2008, P INT C DAT ENG