{"id":2830,"date":"2021-08-17T19:31:23","date_gmt":"2021-08-17T19:31:23","guid":{"rendered":"https:\/\/www.systor.org\/wp\/2022\/?page_id=2830"},"modified":"2022-08-22T09:11:33","modified_gmt":"2022-08-22T09:11:33","slug":"program","status":"publish","type":"page","link":"https:\/\/www.systor.org\/2022\/program\/","title":{"rendered":"Program"},"content":{"rendered":"

[vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073880162{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column reduce_extra_padding=”991″ tm_responsive_css=”22114509|colbreak_no|||||||||colbreak_no|||||||||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073647852{padding-right: 100px !important;}”][vc_raw_html]JTNDYSUyMG5hbWUlM0QlMjJrZXlub3RlcyUyMiUyMHN0eWxlJTNEJTIycG9zaXRpb24lM0ElMjBhYnNvbHV0ZSUzQiUyMCUyMGxlZnQlM0ElMjAwcHglM0IlMjAlMjB0b3AlM0ElMjAtMTAwcHglM0IlMjIlM0UlM0MlMkZhJTNF[\/vc_raw_html]

Keynotes<\/h2>\n[\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” disable_element=”yes” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1639548807926{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column reduce_extra_padding=”991″ tm_responsive_css=”22114509|colbreak_no|||||||||colbreak_no|||||||||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073647852{padding-right: 100px !important;}”][vc_column_text]TBD[\/vc_column_text][\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” disable_element=”yes” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1630838392650{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column reduce_extra_padding=”991″ tm_responsive_css=”22114509|colbreak_no|||||||||colbreak_no|||||||||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073647852{padding-right: 100px !important;}”][\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1639489863294{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column width=”1\/2″ tm_responsive_css=”31574345|colbreak_no|||||||||colbreak_no|||||15px||||colbreak_no||||||||||colbreak_no|||||||||” el_class=”tm-reset-all-left-991″]

Keynote #01<\/h4>\n

Building Warehouse-Scale Computers<\/h2>\n<\/div>
<\/span><\/div><\/header>
\n

John Wilkes (Google)<\/em><\/strong><\/h3>\n

<\/div><\/div><\/div><\/div><\/section><\/div> [vc_single_image image=”3459″ style=”vc_box_circle_2″][\/vc_column][vc_column width=”1\/2″][vc_tta_accordion color=”grey” c_icon=”chevron” c_position=”right” active_section=”1″ collapsible_all=”true”][vc_tta_section title=”Abstract” tab_id=”1629234536160-db282339-36e7″][vc_column_text]Imagine some product team inside Google wants 100,000 CPU cores + RAM + flash + accelerators + disk in a couple of months. We need to decide where to put them, when; whether to deploy new machines, or re-purpose\/reconfigure old ones; ensure we have enough power, cooling, networking, physical racks, data centers and (over longer a time-frame) wind power; cope with variances in delivery times from supply logistics hiccups; do multi-year cost-optimal placement+decisions in the face of literally thousands of different machine configurations; keep track of parts; schedule repairs, upgrades, and installations; and generally make all this happen behind the scenes at minimum cost.<\/p>\n

And then after breakfast, we get to dynamically allocate resources (on the small-minutes timescale) to the product groups that need them most urgently, accurately reflecting the cost (opex\/capex) of all the machines and infrastructure we just deployed, and monitoring and controlling the datacenter power and cooling systems to achieve minimum overheads – even as we replace all of these on the fly.<\/p>\n

This talk will highlight some of the exciting problems we’re working on inside Google to ensure we can supply the needs of an organization that is experiencing (literally) exponential growth in\u00a0computing\u00a0capacity.[\/vc_column_text][\/vc_tta_section][vc_tta_section title=”Bio” tab_id=”1629234536247-1ed2440d-7944″][vc_column_text]John Wilkes<\/strong> has been at Google since 2008, where he is working on automation for building warehouse scale computers, with a current focus on delivering network capacity. Before this, he worked on cluster management for Google’s compute infrastructure (Borg, Omega, Kubernetes). He is interested in far too many aspects of distributed systems, but a recurring theme has been technologies that allow systems to manage themselves.<\/span><\/p>\n

He received a PhD in computer science from the University of Cambridge, joined HP Labs in 1982, and was elected an HP Fellow and an ACM Fellow in 2002 for his work on storage system design. Along the way, he\u2019s been program committee chair for SOSP, FAST, EuroSys and HotCloud, and has served on the steering committees for EuroSys, FAST, SoCC and HotCloud. He\u2019s listed as an inventor on 50+ US patents, and has an adjunct faculty appointment at Carnegie-Mellon University. In his spare time he continues, stubbornly, trying to learn how to blow glass.<\/span>[\/vc_column_text][\/vc_tta_section][\/vc_tta_accordion][\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1641928628140{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column width=”1\/2″ tm_responsive_css=”31574345|colbreak_no|||||||||colbreak_no|||||15px||||colbreak_no||||||||||colbreak_no|||||||||” el_class=”tm-reset-all-left-991″]

Keynote #02<\/h4>\n

Bring an order to the chaos: Preserving the order in the modern IO stack<\/h2>\n<\/div>
<\/span><\/div><\/header>
\n

Youjip Won (KAIST)<\/strong><\/em><\/h3>\n

<\/div><\/div><\/div><\/div><\/section><\/div> [vc_single_image image=”3399″ style=”vc_box_circle_2″][\/vc_column][vc_column width=”1\/2″][vc_tta_accordion color=”grey” c_icon=”chevron” c_position=”right” active_section=”1″ collapsible_all=”true”][vc_tta_section title=”Abstract” tab_id=”1629235035324-d13fd0d1-c9f1″][vc_column_text]In this talk, we discuss the storage\u00a0order guarantees<\/span> in modern IO stack design. <\/span>Preserving the storage order has long been the holy grail in storage system design. Most applications require that certain blocks are made durable in order. Journaling filesystems<\/span> require that the journal transactions are made durable in order. Soft-update requires that the metadata blocks are made durable in an <\/span>order satisfying certain ordering dependencies among the metadata blocks.<\/p>\n

Filesystems<\/span> have<\/span> been using the<\/span> highly <\/span>expensive transfer-and-flush paradigm\u00a0<\/span>to ensure the storage order among a set of blocks. One of the most critical issues in modern IO stack design is how to mitigate the overhead of the <\/span>transfer-and-flush based order preserving mechanism, whose importance cannot be emphasized enough<\/span>.<\/p>\n

For the <\/span>past few decades, a <\/span>fair amount of work has been proposed to mitigate or eliminate the overhead of storage order guarantee both in<\/span> hardware design as well as in <\/span>software design. The work<\/span> includes<\/span> using SuperC<\/span>ap based writeback caches<\/span> for<\/span> SSDs<\/span>, using the <\/span>NO_BARRIER filesystem option, including a <\/span>checksum in<\/span> the journal commit block, and more<\/span>. Recent proposals for a <\/span>multi-queue block device interface, e.g.,<\/span> NVMe and the Zoned Name S<\/span>pace are for addressing the transfer-and-flush overhead. We will briefly <\/span>examine each of these techniques and discuss their<\/span> pros and cons. Finally, we set forth a few research issues for mitigating the transfer-and-flush overhead in modern ULL (ultra low latency) storage devices<\/span>.[\/vc_column_text][\/vc_tta_section][vc_tta_section title=”Bio” tab_id=”1629235035427-a14098de-d58a”][vc_column_text]Prof. <\/b>Youjip Won <\/strong>is ICT Endowed Chair Professor at School of Electrical Engineering, KAIST. Prof. Youjip Won is known for his work on the Android IO stack optimization, filesystem and block layer design for SSD and NVRAM. His research interests include Operating System, Distributed System, Storage System and Software support for byte-addressable NVRAM.<\/p>\n

He was awarded \u201cOutstanding Researcher Award\u201d, Hanyang University(2016) and \u201cGaheon Outstanding Research Award\u201d from Korean Institute of Information Scientists and Engineers (KIISE)(2017). Funded by Samsung Electronics, he developed Namsan Filesystem. With Namsan Filesystem, he was awarded\u00a0\u00a0\u201cBest Academy-Industry Collaboration Practice in Samsung Electronics\u201d in 2006. Namsan Filesystem was deployed in the commercial TV products. His work on IO stack optimization in Android platform identified the root cause of the IO inefficiencies in the Android smartphones (USENIX ATC 2013, best paper award). His work on IO stack design on the Flash Storage proposes a new way of designing the filesystem, block layer and device firmware for the Flash storage (USENIX FAST 2018, best paper award). He is a director of Center for File and Storage Systems Research at KAIST.<\/div>\n

[\/vc_column_text][\/vc_tta_section][\/vc_tta_accordion][\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1646216025783{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column width=”1\/2″ tm_responsive_css=”31574345|colbreak_no|||||||||colbreak_no|||||15px||||colbreak_no||||||||||colbreak_no|||||||||” el_class=”tm-reset-all-left-991″]

Keynote #03<\/h4>\n

Can we make trustworthy systems a reality?<\/h2>\n<\/div>
<\/span><\/div><\/header>
\n

Gernot Heiser (UNSW)<\/strong><\/em><\/h3>\n

<\/div><\/div><\/div><\/div><\/section><\/div> [vc_single_image image=”3523″ style=”vc_box_circle_2″][\/vc_column][vc_column width=”1\/2″][vc_tta_accordion color=”grey” c_icon=”chevron” c_position=”right” active_section=”1″ collapsible_all=”true”][vc_tta_section title=”Abstract” tab_id=”1629274246379-90f8241e-bd50″][vc_column_text]13 years ago, seL4 became the first OS kernel with a proof of implementation correctness, followed by proofs extending the correctness to the binary code, as well as proofs of security enforcement. This triggered much research activity on the application of formal methods to systems code, including proofs of safety properties of file systems, communication protocols. Formal methods are now also heavily used used in industry.<\/p>\n

However, to the best of my knowledge, there still is no non-trivial system that is trustworthy in a strong sense, in that its complete trusted computing base (TCB) \u2013 at least the software part of it \u2013 is verified and proved to enforce a security policy. In the talk I will give an overview of seL4 and its verification story and look at some existing deployments in critical systems. I will then discuss our current activities for extending trustworthiness to the rest of the TCB. This covers verifiable OS designs, as well as research on reducing the verification effort of TCB components.[\/vc_column_text][\/vc_tta_section][vc_tta_section title=”Bio” tab_id=”1629274246546-678008ee-1cbf”][vc_column_text]<\/p>\n

Gernot Heiser<\/strong> is Scientia (distinguished) Professor and John Lions Chair of Operating Systems at UNSW Sydney. His research interest are in operating systems, real-time systems, security and safety. His research vision is to completely change the cybersecurity game from playing catch-up with attackers to systems that are provably secure. As leader the Trustworthy Systems group, he pioneered large-scale formal verification of systems\u00a0code, specifically the design, implementation and formal verification\u00a0 of the seL4 microkernel; seL4 is now being used in\u00a0real-world security- and safety-critical systems.<\/div>\n
<\/div>\n
Heiser’s former company Open Kernel Labs, acquired by General Dynamics in\u00a02012, marketed the OKL4 microkernel, which shipped on billions of mobile wireless chips and is deployed on the secure\u00a0enclave of all iOS devices. He presently serves as Chief Scientist, Software, of HENSOLDT Cyber, Chief Scientist of Neutrality, and Chairman of the seL4 Foundation. Gernot is a Fellow of the ACM, the IEEE\u00a0and the Australian Academy of Technology and Engineering (ATSE) and an ACM Distinguished Lecturer.<\/div>\n

[\/vc_column_text][\/vc_tta_section][\/vc_tta_accordion][\/vc_column][\/vc_row][vc_section][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073880162{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column reduce_extra_padding=”991″ tm_responsive_css=”22114509|colbreak_no|||||||||colbreak_no|||||||||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073647852{padding-right: 100px !important;}”][vc_raw_html]JTNDYSUyMG5hbWUlM0QlMjJmdWxsLXByb2dyYW0lMjIlMjBzdHlsZSUzRCUyMnBvc2l0aW9uJTNBJTIwYWJzb2x1dGUlM0IlMjAlMjBsZWZ0JTNBJTIwMHB4JTNCJTIwJTIwdG9wJTNBJTIwLTEwMHB4JTNCJTIyJTNFJTNDJTJGYSUzRQ==[\/vc_raw_html][vc_separator css=”.vc_custom_1629274213962{margin-top: -30px !important;margin-bottom: 20px !important;}”]

Full Program<\/h2>\n[\/vc_column][\/vc_row][vc_row tm_bgimagefixed=”” break_in_responsive=”991″ tm_zindex=”2″ full_width=”stretch_row” tm_responsive_css=”60233685|colbreak_no|||||||||colbreak_no|||||55px||25px||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1652169372450{padding-top: 111px !important;padding-bottom: 0px !important;}”][vc_column reduce_extra_padding=”991″ width=”1\/2″ tm_responsive_css=”22114509|colbreak_no|||||||||colbreak_no|||||||||colbreak_no||||||||||colbreak_no|||||||||” css=”.vc_custom_1626073647852{padding-right: 100px !important;}”][vc_column_text]<\/p>\n

Day 1: Monday, June 13<\/strong><\/h3>\n

09:00<\/b> Welcome and registration<\/span><\/p>\n

09:40<\/b> Opening session<\/b><\/p>\n

10:00<\/b> Keynote <\/b>#1: Building warehouse-scale computers,<\/em> Jo<\/strong>hn Wilkes, Principal Software Engineer, Google<\/b><\/p>\n

11:00<\/b> Break<\/span><\/p>\n

11:20<\/b> Session A: Performance<\/b><\/p>\n