동현 유
척척석사
동현 유
전체 방문자
오늘
어제
  • 분류 전체보기 (181)
    • BlockChain (48)
      • [paper] Consensus (13)
      • [paper] Execution (19)
      • [paper] Storage (5)
      • [paper] ZKP (1)
      • [paper] Oracle (1)
      • Blockchains (9)
    • Java (19)
      • Java의 정석 (13)
      • Java 파헤치기 (5)
    • Python (20)
      • Python 뜯어보기 (6)
      • 데이터 분석 기초 (5)
      • Python 기초 강의 (6)
      • Python 기초 강의 부록 (3)
    • Golang (0)
    • MySQL (3)
      • programmers (2)
      • 기본 문법 (0)
    • 웹 프로젝트 (IBAS) (36)
      • Django 레거시 (14)
      • SpringBoot api 개편 (14)
      • Infra (3)
      • 서버 장애 기록 (4)
      • 신입팀원 교육 자료 (1)
    • CS (30)
      • Operating System (22)
      • Computer Security (3)
      • Network (4)
      • DBMS (1)
    • 책 (10)
      • 도메인 주도 설계 철저 입문 (9)
      • Real MySQL 8.0 (1)
    • BOJ 문제 풀이 (3)
    • 이러쿵저러쿵 (10)
    • 회고 (1)

인기 글

최근 댓글

최근 글

hELLO · Designed By 정상우.
동현 유

척척석사

[논문 세미나] NEZHA: Exploiting Concurrency for TransactionProcessing in DAG-based Blockchains
BlockChain/[paper] Execution

[논문 세미나] NEZHA: Exploiting Concurrency for TransactionProcessing in DAG-based Blockchains

2023. 10. 14. 15:16

Title: 

NEZHA: Exploiting Concurrency for Transaction Processing in DAG-based Blockchains 

 

Authors: 

J. Xiao, S. Zhang, Z. Zhang, B. Li, X. Dai and H. Jin

 

Journal/Conference:

ICDCS '22

 

Sources:

https://ieeexplore.ieee.org/document/9912285

 

Abstract:

A Directed Acyclic Graph (DAG)-based blockchain with its inherent parallel structure can potentially significantly improve the throughput performance over conventional blockchains. Such a performance improvement can be further enhanced through concurrent transaction processing. This, however, brings new challenges in concurrency control design in that there is an increased number of concurrent reads and writes to the same address in a DAG-based blockchain, which leads to a considerable rise of potential conflicts. Therefore, one critical problem is how to effectively and efficiently detect and order conflicting transactions. In this work, for the first time, we aim to improve system throughput and processing latency by exploring the address dependencies among different transactions. We propose NEZHA, an efficient concurrency control scheme for DAG-based blockchains. Specifically, NEZHA intelligently constructs an address-based conflict graph (ACG) while incorporating address dependencies as edges to capture all conflicting transactions. To generate a total order between transactions, we propose a hierarchical sorting (HS) algorithm to derive sorting ranks of addresses based on the ACG and sort transactions on each address. Extensive experiments demonstrate that, even under high data contention, NEZHA can increase the throughput over the conventional conflict graph scheme by up to 8 ×, while decreasing the transaction processing latency up to 10 ×.

 

Presentation material:

2023-10-12 NEZHA, Exploiting Concureency for Transaction Processing in DAG-based Blockchain.pdf
1.63MB


Introduction


Background


System Overview


Nezha


Evaluation

 


Conclusion

'BlockChain > [paper] Execution' 카테고리의 다른 글

[논문 세미나] QueCC: A Queue-oriented, Control-free Concurrency  (0) 2023.12.27
[논문 세미나] Caracal: Contention management with Deterministic Concurrency Control  (0) 2023.10.14
[논문 세미나] SChain: Scalable Concurrency over Flexible Permissioned Blockchain  (0) 2023.08.23
[논문 리뷰] When Private Blockchain Meets Deterministic Database  (0) 2023.06.21
[논문 리뷰] Block-STM : Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing  (1) 2023.02.05
    동현 유
    동현 유
    Fault Tolerant System Researcher for more Trustful World and Better Lives. (LinkedIn: https://www.linkedin.com/in/donghyeon-ryu-526b8a276/)

    티스토리툴바