상세정보
학술지
Cell Approximation Method in Quorum Systems for Minimizing Access Time
- 발행일
- 200912
- 출처
- Cluster Computing, v.12 no.4, pp.387-398
- ISSN
- 1386-7857
- 출판사
- Springer
- 협약과제
- 09MS2400, 저비용 대규모 글로벌 인터넷 서비스 솔루션 개발, 남궁한
- 초록
- 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. © 2009 Springer Science+Business Media, LLC.
- KSP 제안 키워드
- Access Time, Approximation methods, Consensus method, Data locality, Data sets, Dynamic Environment, Grid infrastructure, Logical structure, Precedence constraints, Quorum systems, e-science