A Biological Solution to a Fundamental Distributed Computing Problem

被引:100
作者
Afek, Yehuda [2 ,3 ]
Alon, Noga [2 ,3 ,4 ]
Barad, Omer [1 ]
Hornstein, Eran [1 ]
Barkai, Naama [1 ]
Bar-Joseph, Ziv [5 ]
机构
[1] Weizmann Inst Sci, Dept Mol Genet, IL-76100 Rehovot, Israel
[2] Tel Aviv Univ, Blavatnik Sch Comp Sci, IL-69978 Tel Aviv, Israel
[3] Tel Aviv Univ, Sackler Sch Math, IL-69978 Tel Aviv, Israel
[4] Inst Adv Study, Princeton, NJ 08544 USA
[5] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
基金
美国国家科学基金会; 以色列科学基金会; 欧洲研究理事会;
关键词
LATERAL INHIBITION; PARALLEL ALGORITHM; PATTERN-FORMATION; SET; PATHWAY;
D O I
10.1126/science.1193210
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Computational and biological systems are often distributed so that processors (cells) jointly solve a task, without any of them receiving all inputs or observing all outputs. Maximal independent set (MIS) selection is a fundamental distributed computing procedure that seeks to elect a set of local leaders in a network. A variant of this problem is solved during the development of the fly's nervous system, when sensory organ precursor (SOP) cells are chosen. By studying SOP selection, we derived a fast algorithm for MIS selection that combines two attractive features. First, processors do not need to know their degree; second, it has an optimal message complexity while only using one-bit messages. Our findings suggest that simple and efficient algorithms can be developed on the basis of biologically derived insights.
引用
收藏
页码:183 / 185
页数:3
相关论文
共 23 条
[21]  
Valiant L. G., 1982, P 7 IBM S MATH FDN C
[22]   Distributed construction of connected dominating set in wireless ad hoc networks [J].
Wan, PJ ;
Alzoubi, KM ;
Frieder, O .
MOBILE NETWORKS & APPLICATIONS, 2004, 9 (02) :141-149
[23]  
Yves Metivier, 2009, Structural Information and Communication Complexity. 16th International Colloquium, SIROCCO 2009. Revised Selected Papers, P323