.png){kind=icon}
返回
Cell approximation method in quorum systems for minimizing access time
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-009-0097-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As part of a service oriented e-Science and Grid infrastructure, a quorum-consensus method is a valuable tool for managing replicated data and finding meaningful patterns of immense data sets. In general, a workflow is defined as set of atomic tasks that may have dependencies between each other. Tasks also may define a so-called quorum which denotes a number of precedence constraints to be fulfilled before execution may proceed. To solve the problem of designing a quorum that fits a scalable and dynamic environment where data are distributed sparsely or too far apart, we propose a cell approximation method to fit into some form (e.g., voting, grid) of logical structure in quorum-based protocols. In our method, adjacent nodes are configured by an Intra cell which can improve their data locality. Furthermore, Intra-cell relationships can be represented by an Inter cell for minimizing access time.
Keyword:
Cell approximation
Quorum system
Data grid
期刊
C
IF:
4.1
论文数:
5.1K
被引数:
7.5K
机构
引用论文
REPORT UPON THE AUTUMN INFLUENZA EPIDEMIC (1918) AS IT AFFECTED THE N.Z.E.F. IN THE UNITED KINGDOM..png)
The Lancet
OAAI
The LancetIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容