templexxx
Xiangxi Xu
Hangzhou, China

Self-driven. Learn math and programming by myself.

CodersRank Score

What is this?

This represents your current experience. It calculates by analyzing your connected repositories. By measuring your skills by your code, we are creating the ranking, so you can know how good are you comparing to another developers and what you have to improve to be better

Information on how to increase score and ranking details you can find in this blog post.

415.5
CodersRank Rank
Top 2%
Highest experience points: 0 points,

0 activities in the last year

List your work history, including any contracts or internships
BaishanCloud
Jan 2018 - Nov 2018 (10 months)
Beijing, China
Distributed Storage Engineer
Designed, planned and implemented Erasure Codes storage system (in Go) with my colleagues, saving 60% TCO (About 40PB):

1. Designed geographic fault tolerance architecture, high availability in n + 1 IDCs with only 1 / n overhead: Built on distributed database cluster, one of the IDCs kept XOR parity

2. Helped to accomplish multi-level metadata system, made a 50% reduction of the metadata database cost: First level was objects meta; second level was block location (Block is a range of sorted object IDs); the last level was in the storage node, slim trie was used to map objects to the file system

3. Initiated project layout and developed basic packages: http, log, io, config, version etc

4. Erasure Codes implementation were based on my open source codes

5. Directed a 4 people temporary team to complete service APIs' developing, testing, document within targeted due dates

6. Chaired the technical evangelism: organized discussion groups, wrote articles etc
Go assembly erasure codes
QingCloud
Jul 2017 - Jan 2018 (6 months)
Beijing, China
Distributed Storage Engineer
Mainly engaged in the research of Distributed Storage Systems with Tech VP for the next-generation Object Storage System
Add some compelling projects here to demonstrate your experience
Reed-Solomon Erasure Codes in Go
Reed-Solomon Erasure Code engine in Go, could more than 15GB/s per core
Go assembly linear algebra galois field
XRS
Fast and efficient data reconstruction Erasure code, saving about 30% I/O in reconstruction
go linear algebra

Jobs for you

Show all jobs
Feedback