https://ad-bean.github.io/categories/distributed/ Adbean's Blog Hugo 0.166.0 & FixIt v0.4.5 zh-CN adbeanx@outlook.com (Adbean) adbeanx@outlook.com (Adbean) Wed, 04 Dec 2024 11:25:04 -0500 https://ad-bean.github.io/posts/paper-skycomputing/ Wed, 04 Dec 2024 11:25:04 -0500adbeanx@outlook.com (Adbean) https://ad-bean.github.io/posts/paper-skycomputing/ Distributed <h2 class="heading-element" id="from-cloud-computing-to-sky-computing"><span>From Cloud Computing to Sky Computing</span> <a href="#from-cloud-computing-to-sky-computing" class="heading-mark"> <svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg> </a> </h2><p>21 年 UCB 提出了 Sky Computing 的概念，后续也有一篇 35 页的 <a href="https://arxiv.org/pdf/2205.07147" target="_blank" rel="external nofollow noopener noreferrer">The Sky Above The Clouds</a></p> https://ad-bean.github.io/posts/paper-servicerouter/ Mon, 02 Dec 2024 09:37:05 -0500adbeanx@outlook.com (Adbean) https://ad-bean.github.io/posts/paper-servicerouter/ Distributed <h2 class="heading-element" id="servicerouter-hyperscale-and-minimal-cost-service-mesh-at-meta"><span>ServiceRouter: Hyperscale and Minimal Cost Service Mesh at Meta</span> <a href="#servicerouter-hyperscale-and-minimal-cost-service-mesh-at-meta" class="heading-mark"> <svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg> </a> </h2><p>Meta 的全球服务网格 ServiceRouter（SR）</p> https://ad-bean.github.io/posts/paper-gg/ Wed, 20 Nov 2024 01:09:31 -0500adbeanx@outlook.com (Adbean) https://ad-bean.github.io/posts/paper-gg/ Distributed <h2 class="heading-element" id="from-laptop-to-lambda-outsourcing-everyday-jobs-to-thousands-of-transient-functional-containers"><span>From Laptop to Lambda: Outsourcing Everyday Jobs to Thousands of Transient Functional Containers</span> <a href="#from-laptop-to-lambda-outsourcing-everyday-jobs-to-thousands-of-transient-functional-containers" class="heading-mark"> <svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg> </a> </h2><p>同样是 standford DBOS 组关于 serverless 的论文，作者还有一篇 R2E2 很厉害，用 serverless 做 ray tracing 实现很高的加速，但 cost 估计控制不住</p> https://ad-bean.github.io/posts/paper-ownership/ Sun, 10 Nov 2024 16:27:22 -0500adbeanx@outlook.com (Adbean) https://ad-bean.github.io/posts/paper-ownership/ Distributed <h2 class="heading-element" id="ownership-a-distributed-futures-system-for-fine-grained-tasks"><span>Ownership: A Distributed Futures System for Fine-Grained Tasks</span> <a href="#ownership-a-distributed-futures-system-for-fine-grained-tasks" class="heading-mark"> <svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg> </a> </h2><p>分布式系统中的一些任务调度的论文，本来是要看 Ray 的，同样都是 UCB 的研究（分布式机器学习框架）</p> https://ad-bean.github.io/posts/scalability-cost/ Sun, 08 Sep 2024 20:25:59 -0400adbeanx@outlook.com (Adbean) https://ad-bean.github.io/posts/scalability-cost/ Distributed <h2 class="heading-element" id="scalability-but-at-what-cost"><span>Scalability! But at what COST?</span> <a href="#scalability-but-at-what-cost" class="heading-mark"> <svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg> </a> </h2><p>比较短的 paper，之前也略有看过，主要讲主流分布式框架在多机器上存在 COST(不是成本) 问题，并不一定能比单机更好。是很有意思的主题。</p>