On synchrony in dynamic distributed systems

被引:1
作者
Munoz-Escoi, Francesc D. [1 ]
de Juan-Marin, Ruben [1 ]
机构
[1] Univ Politecn Valencia, Inst Univ Mixt Tecnol Informat, E-46022 Valencia, Spain
关键词
distributed system; dynamic system; system interconnection; synchrony; failure detector; participant detector;
D O I
10.1515/comp-2018-0014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many modern distributed services are deployed in dynamic systems. Cloud services are an example. They are expected to provide service to a potentially huge amount of users and may require a wide geographical deployment in multiple data centres. Their service processes vary in volume in accordance with workload variations, showing an adaptive behaviour in order to minimise economical costs. Dynamic distributed systems may be classified considering two axes: (a) the number of processes that compose the system, and (b) the diameter of the networking graph that interconnects those processes. Other important features of dynamic systems can be derived from these two characteristics, e.g., their attainable synchrony. We analyse the level of synchrony that may be achieved in each dynamic system class and revise the existing techniques for transforming an initially asynchronous large dynamic system into another one with a higher synchrony level. With this, a larger set of problems may be handled in dynamic distributed systems. This facilitates the implementation and provision of additional services in those systems.
引用
收藏
页码:154 / 164
页数:11
相关论文
共 36 条
[1]  
Aguilera M.K., 2004, DISTRIB COMPUT COLUM, V35, P36, DOI DOI 10.1145/992287.992298
[2]  
Aguilera M.K., 2003, P 22 ACM S PRINC DIS, P306
[3]  
Alchieri EAP, 2008, LECT NOTES COMPUT SC, V5401, P22, DOI 10.1007/978-3-540-92221-6_4
[4]   On the interconnection of message passing systems [J].
Alvarez, A. ;
Arvalo, S. ;
Cholvi, V. ;
Fernandez, A. ;
Jimenez, E. .
INFORMATION PROCESSING LETTERS, 2008, 105 (06) :249-254
[5]   A survey of peer-to-peer content distribution technologies [J].
Androutsellis-Theotokis, S ;
Spinellis, D .
ACM COMPUTING SURVEYS, 2004, 36 (04) :335-371
[6]   Limitations of fast consistency conditions for distributed shared memories [J].
Attiya, H ;
Friedman, R .
INFORMATION PROCESSING LETTERS, 1996, 57 (05) :243-248
[7]  
Baldoni R, 2007, LECT NOTES COMPUT SC, V4671, P1
[8]   The hierarchial daisy architecture for casual delivery [J].
Baldoni, R ;
Friedman, R ;
vanRenesse, R .
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1997, :570-577
[9]   The price of validity in dynamic networks [J].
Bawa, Mayank ;
Gionis, Aristides ;
Garcia-Molina, Hector ;
Motwani, Rajeev .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (03) :245-264
[10]  
Cavin D, 2004, LECT NOTES COMPUT SC, V3158, P135