用户:Hengfeng-Wei

来自Algorithm Wiki
Hengfeng-Wei（讨论 | 贡献）2021年1月13日 (三) 10:21的版本

(差异) ←上一版本 | 最后版本 (差异) | 下一版本→ (差异)
跳转至： 导航、 搜索



Profile

Whf-white-2016-12.jpg
                                               Please Move to MY NEW HOMEPAGE

Hengfeng Wei (魏恒峰)

  • Research Assistant (助理研究员)：From 2017-01 
 Software Institute                                      (软件学院)
 State Key Laboratory for Novel Software Technology      (软件新技术国家重点实验室)
 Nanjing University （Gulou Campus）                     (南京大学 鼓楼校区)
 Office: 926                                             (费彝民楼)

 Addr: 163 Xianlin Road, Qixia District, Nanjing, Jiangsu 210023, China     (江苏省南京市栖霞区仙林大道163号南京大学仙林校区 210023)

 Email: hfwei-nju-edu-cn

Research Interests

I am interested in Distributed Computing Theory and Formal Methods.

Publications

dblp: Hengfeng Wei

scholar: Hengfeng Wei

---

---

---

Achieving Probabilistic Atomicity with Well-Bounded Staleness and Low Read Latency in Distributed Datastores

 Lingzhi Ouyang, Yu Huang, Hengfeng Wei, Jian Lu
 IEEE Trans. on Parallel and Distributed Systems, accepted, Nov. 2020.

Jupiter Made Abstract, and Then Refined

 Hengfeng Wei, Ruize Tang, Yu Huang, Jian Lu. 
 “Jupiter Made Abstract, and then Refined”.
 Journal of Computer Science and Technology, accepted, Aug. 2020.

A Generic Specification Framework for Weakly Consistent Replicated Data Types

 Xue Jiang, Hengfeng Wei, Yu Huang.
 “A Generic Specification Framework for Weakly Consistent Replicated Data Types”.
 In Proceedings of the 39th International Symposium on Reliable Distributed Systems (SRDS 2020). Accepted. (To Appear).

Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers of Multi-writer Atomic Registers

 Kaile Huang, Yu Huang, and Hengfeng Wei. 
 “Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers of Multi-writer Atomic Registers”.
 In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2020), 2020.

PaxosStore中共识算法TPaxos的推导、规约与精化

 易星辰, 魏恒峰, 黄宇, 乔磊, 吕建. 
 PaxosStore中共识算法TPaxos的推导、规约与精化. 
 软件学报 2020. 2020年第8期.

CRDT协议的TLA+ 描述与验证

 易星辰, 魏恒峰, 黄宇, 吕建. 
 CRDT协议的TLA+ 描述与验证.
 软件学报 2020. 2020年第6期.

Specification and Implementation of Replicated List: The Jupiter Protocol Revisited

 Hengfeng Wei, Yu Huang, and Jian Lu.
 “Specification and Implementation of Replicated List: The Jupiter Protocol Revisited”. 
 In: 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17-19, 2018, Hong Kong, China.
 2018, 12:1–12:16. url: https://doi.org/10.4230/LIPIcs.OPODIS.2018.12

 Hengfeng Wei, Yu Huang, and Jian Lu.
 “Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited”.
 In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC ’18.
 Egham, United Kingdom: ACM, 2018, pp. 81–83. url: http://doi.acm.org/10.1145/3212734.3212

 Paper: Jupiter@PODC-BA'2018  Paper: Jupiter@OPODIS'2018  [Paper: Jupiter@arXiv (full version)]

This work is inspired by the work on "Specification and Complexity of Collaborative Text Editing" published in PODC'2016 by Hagit Attiya et al.

Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores

 Hengfeng Wei, Yu Huang, Jian Lu.
 Parameterized and Runtime-tunable Snapshot Isolation in Distributed Transactional Key-value Stores.
 In Proc. of the 36th International Symposium on Reliable Distributed Systems (SRDS), pp. 21--33, Hong Kong, China, Sep.2017.
 [Paper:RVSI@SRDS17]

The formal specification of RVSI (Relaxed Version Snapshot Isolation) in this work is partly inspired by the work on "Relaxed Currency Serializability for Middle-Tier Caching and Replication" published in SIGMOD'2006 by Philip A.Bernstein et al.

Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems

 Hengfeng Wei, Yu Huang, Jian Lu. 
 Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems. 
 In IEEE Trans. Comput. (IEEE Transactions on Computers), 66(3):502--514, doi:10.1109/TC.2016.2601322, March 2017.
 [abstract@IEEE]  [Paper: PA2AM@TC'2017] [Paper: PA2AM@arXiv (not up-to-date)]

Last night (2016-10-13), I reread the paper "On Interprocess Communication --- Part II: Algorithms" of Leslie Lamport, and found that in Proposition 5, Lamport has proved that in the single-writer model a regular register is atomic if two successive reads that overlap the same write cannot obtain the new then the old value. The phenomenon that "two successive reads that overlap the same write cannot obtain the new then the old value" is exactly the old-new inversion anomaly. Therefore, Lamport has shown that a regular register is atomic if it does not allow old-new inversion anomalies. This is very similar to Theorem 1 in our paper which essentially states that the PA2AM algorithm implements a 2-atomic register and the old-new inversion anomaly is the only cause of atomicity violation.

The major difference between Proposition 5 of Lamport and Theorem 1 in our paper is that Proposition 5 is at the specification level while Theorem 1 is at the implementation level.

Combining Proposition 5 and Theorem 1, we obtain

Conjecture 1
In the single-writer model, 2-atomicity is equivalent to regularity.
Conjecture 2
In the single-write model, PA2AM implements a regular register.

Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas

 Hengfeng Wei, Marzio De Biasi, Yu Huang, Jiannong Cao, and Jian Lu. 
 Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas.
 In IEEE Trans. Parallel Distrib. Syst., 27(5):1511--1523, May 2016, doi:10.1109/TPDS.2015.2453985
 [abstract@IEEE]  [Paper: VPC@TPDS'2016] [Paper: VPC@arXiv(not up-to-date)]
 SCI: DJ5HS

In the Conclusion section, we discussed the VCC (Verifying Causal Consistency) problem and wrote: "Because Pipelined-RAM is a weakening of causal consistency, our NP-complete result also applies to the general problem of verifying causal consistency".

I am sorry to say that it is not right for us to conclude that VCC, in general, (i.e., VCC-SD in our terms) is NP-complete just because Pipelined-RAM is a weakening of causal consistency.

However, I think that VCC-SD is NP-complete and that the basic idea of the polynomial reduction used in the NP-complete proof for VPC-SD will be useful in proving the NP-completeness of VCC-SD.

The NP-completeness proof for VPC-SD (along with VPC-MD) is mainly credited to Marzio De Biasi, the second author of this paper.

Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context

 Hengfeng Wei, Yu Huang, Jiannong Cao, Xiaoxing Ma, Jian Lu. 
 Formal Specification and Runtime Detection of Temporal Properties for Asynchronous Context. 
 In Proceedings of the 10th IEEE International Conference on Pervasive Computing and Communications 
 (IEEE PerCom '12), pages 30--38, 2012.
 [abstract@IEEE]  [Paper: CTL3@PerCom'2012]
 EI: 20122315082503

Projects

Links

取自“http://www.bigoh.net/wiki/index.php?title=用户:Hengfeng-Wei&oldid=1300”