.png){kind=icon}
返回
Optimal deployment of eventually-serializable data services
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-010-0684-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing. To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. However, replication induces significant communication costs to maintain replica consistency. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. This paper reconsiders the deployment phase of ESDS, in which a particular implementation of communicating software components must be mapped onto a physical architecture. This deployment aims at minimizing the overall communication costs, while satisfying the constraints imposed by the protocol. Both MIP (Mixed Integer Programming) and CP (Constraint Programming) models are presented and applied to realistic ESDS instances. The experimental results indicate that both models can find optimal solutions and prove optimality. The CP model, however, provides orders of magnitude improvements in efficiency. The limitations of the MIP model and the critical aspects of the CP model are discussed. Symmetry breaking and parallel computing are also shown to bring significant benefits.
Keyword:
DOCK ASSIGNMENT PROBLEM
CONSTRAINT
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Concentrations and origin of polycyclic aromatic hydrocarbons in sediments of the Middle Adriatic Sea亚得里亚海中部沉积物中多环芳烃的浓度和来源
OAAI
OAAI分享收藏Overfitting in protein name recognition on biomedical literature and method of preventing it through use of transductive SVM生物医学文献中蛋白质名称识别任务中的过拟合现象及其通过转导支持向量机（transductive SVM）进行预防的方法
PREAI
分享收藏
查看更多内容