ditsing · HackerTrans

  Location: Seattle
  Remote: Yes!
  Willing to relocate: No
  Technologies: Rust, C++, Java, concurrent programming, large scale migrations
  Résumé/CV: https://www.ditsing.com/content/files/2024/10/resume-JingYang-Oct-2024.pdf
  Email: ditsing at gmail.com

I specialize at moving data and traffic around at scale, while keeping everything running. A big portion of my 11 years was spent on that. I'm good with mentoring. In the past two years I grew (with) a rather junior team and delivered an organization-scale project.

Solving puzzles and pushing limits are my favorite. I implemented the Raft consensus algorithm in my free time using Rust. It can handle 20,000 QPS under ideal conditions.

Looking for interesting projects and team funding opportunities.

ditsing

4 anni fadiscuss

  Location: Seattle
  Remote: Yes!
  Willing to relocate: Maybe
  Technologies: Rust, C++, Java, concurrent programming, basic kubernetes & docker.
  Résumé/CV: https://www.ditsing.com/content/files/2022/09/resume.pdf
  Email: ditsing at gmail.com

I enjoy writing correct code and I know how to make it scalable. I have 9 year of experience in the industry. Never been a team leader but led my own projects since year one. I understand how teams work. Had rich experience mentoring and working with junior team members (3 in the past year). I implemented the Raft consensus algorithm in my free time using Rust. Looking for interesting projects and team funding opportunities.

ditsing

5 anni fadiscuss

In my implementation, in each AppendEntries request, the leader includes X commits starting from nextIndex. The follower either accepts all X commits, or reject all of them. If the follower accepted all commits, the leader moves nextIndex to (X + nextIndex when the request was sent). See code here (matchIndex = nextIndex + X - 1): https://github.com/ditsing/ruaft/blob/master/src/sync_log_en....

comments