ATC的容量大改是OSDI的1.5倍吧，有两个track两天的样子，ATC的工业界浓度更高一些，OSDI会选出那种新颖的方向，真的有点像奥斯卡的选奖逻辑。
OSDI/ATC22 attedency
5分钟看完上科大4年计算机
好奇的看完莫名的来自上科大的计算机入门课CS100，后就想退学了？
上海科技大学的计算机专业只适合一部分人。这种新型学校，风险大，收益也大。
我一直认为一个学校的好坏在于你是否可以真正利用起学校的资源来实现学校名声和自我提升的双赢。
作为一个刚入校就励志想打超算比赛的人，觉得平时的“拔苗助长”还不够大跃进，于是作死多做了很多，但是收益损益很大。但是我想清楚了我想要的东西，只关注我最擅长的部分，大学学的大部分东西随着时间推移一点用都没，所以在要求动作之外，需要不沉溺于浪费时间中。一下所有计算机项目都是单人项目，所以花了很多很多时间。
Me as a Trans 那些可控的不可控的变化
人性无常，无法决绝的认为世界的大部分人是有共情能力的，而由于经济学的规律，最优秀的思想也会因为缺钱而停止，而天时地利人和没到的情况，是无法激起下一个状态的变化。
性别认同是一个伴随一生的东西，但是我对小裙子的渴望似乎伴随了一生，社会会禁锢思想，规训一个人的性别，和性别的预期行为。可这种东西似乎对女性保护的更好一点，至少在倡导保护女性到了极点的上海。
如何以一个计算机学生进入HFT行业
中国家长都梦寐以求进入字节阿里腾讯这样的大厂。
但是，如果我告诉你这是有毒的呢？
其实在科技领域还有一个部门，和其他大厂做着一样的数据分析，只不过不是用户画像广告服务商，它叫做高频交易，对你没有听错。
ISCA 22 Attendancy
如Mingyu大大所说体系结构的人不那么重视绝对值和相对值，系统会会quesiton结果和设计。这次花了200🔪线上，可惜没能在这之前拿到签证现场去开会。不过还是能听听songshixin和ucsc教体系结构老师的作品，还有yanmengjia yyds。同时也见到了Mingyu Gao的新的domain specific的hw-sw codesign。不过大佬的talk倒真的没啥意思，都是鸡汤或者论文精炼和insight，像在上研究生课。
Continue reading "ISCA 22 Attendancy"2022广东湘西毕业旅行
我的人生很难再有这样一次在国内独自驾车游山玩水的经历的，我愿意称之为最后的毕业旅行，最重要的是去看了厉害的同学，同时对自己身上的变化有了更深刻的理解。
我不是一个善于记录的人，但自从mtf之后就只想着记录某些东西，大概是想到啥写啥吧。
PLDI22 Attendency
讲的东西比较散。
Continue reading "PLDI22 Attendency"First-generation Memory Disaggregation for Cloud Platforms @Arxiv
CXL disaggregation because:
- Memory inefficiency: s platform-level memory stranding
- Current cloud vendor try on memory disaggregation: require no modifications to
customer workloads or the guest OS./ the system
must be compatible with virtualization acceleration techniques/ the system must be available as
commodity hardware.
Continue reading "First-generation Memory Disaggregation for Cloud Platforms @Arxiv"
Execution Reconstruction: Harnessing Failure Reoccurrences for Failure Reproduction @PLDI'21
Debugging for Execution Reconstruction(ER), is literally a balance of static and dynamic analysis to reproduce failures. For the result of how to get the site for
Reference
Growing A Test Corpus with Bonsai Fuzzing @ICSE'21
For generating synthesization automatically based on the ChocoPy dialect which I'm in great need of, the author of ChocoPy published their tricky counterpart to C-smith/ Fuzzy Grammer Generator called Bonsal Fuzzing.
Problems and Pair Review
Instead of Fuzz-then-reduce method, the corpus bottom up generation is already concise. enough and can touch much of the corner test cases.
- Bounded Exhaustive Testing: input of bounded size are generated systematically but not enumerated exhaustively
- So enumerate the k-path with the grammar.
- JPF-SE explores the space of program paths, for bounding the size of a comprehensive test suite that covers a diverse set of program paths
- different kind of strategies of fuzzing: Coverage-Guided Fuzzing, Specialized Compiler Fuzing, Grammar-based, Semantic Fuzzing(Zest)
- Test-Case Reduction by Hieachical delta debugging
Implementation
- Bounded Grammar Fuzzers: Bound iteration by idens, items, depths number.
- Coverage-Guided Bounded Grammar Fuzzing
The lattice of coverage-guided size-bounded grammar-based fuzzers $F_{m,n,d}$, ordered by three size bounds on the syntax of the test cases they produce: number of unique identifiers m, maximum sequence length n, and maximum nesting depth d.
Test cases flow along directed edges: the inputs generated by each fuzzer are used as the seed inputs to its successors. The result of bonsai fuzzing is the corpus produced by the top-most element.
- Bonsai fuzzing with extended lattice
