서브메뉴
검색
Network-Application Co-Design for Efficient Datacenters
Network-Application Co-Design for Efficient Datacenters
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152025
- ISBN
- 9798346532095
- DDC
- 004
- 저자명
- Zhou, Yang.
- 서명/저자
- Network-Application Co-Design for Efficient Datacenters
- 발행사항
- [Sl] : Harvard University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 189 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-05, Section: B.
- 주기사항
- Advisor: Yu, Minlan;Mickens, James.
- 학위논문주기
- Thesis (Ph.D.)--Harvard University, 2024.
- 초록/해제
- 요약Modern datacenters contain hundreds of thousands of servers and high-speed networks to run diverse applications. However, these datacenters suffer from low resource utilization and poor software performance that cannot be improved simply by relying on faster hardware. Because of these utilization and performance challenges, datacenters incur high operational costs, increased energy usage, and difficulty in handling growing application demands.In this thesis, I will focus on improving resource utilization and application performance through network-application co-design. I will first discuss how resource disaggregation, especially the far memory technique, is a promising way to improve memory utilization. However, prior research often lacks fault tolerance, a crucial requirement in datacenters. Subsequently, I will describe a fault-tolerant far memory system with network-efficient memory swapping and erasure coding, which requires far fewer network I/O operations than conventional wisdom, unlocking higher performance. I will then discuss how application-customized networking stacks can vastly improve the performance of network I/O-intensive distributed protocols such as consensus and transactions. The key insight is to safely offload protocol logic into kernel networking stacks to reduce kernel overhead. The resulting systems achieve the performance of kernel-bypass approaches but the security of kernel stacks.
- 일반주제명
- Computer science
- 일반주제명
- Systems science
- 일반주제명
- Information technology
- 키워드
- Networking
- 키워드
- System design
- 키워드
- Kernel stacks
- 기타저자
- Harvard University Engineering and Applied Sciences - Computer Science
- 기본자료저록
- Dissertations Abstracts International. 86-05B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017162548
■00520250211152025
■006m o d
■007cr#unu||||||||
■020 ▼a9798346532095
■035 ▼a(MiAaPQ)AAI31333024
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aZhou, Yang.▼0(orcid)0000-0002-3082-7872
■24510▼aNetwork-Application Co-Design for Efficient Datacenters
■260 ▼a[Sl]▼bHarvard University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a189 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-05, Section: B.
■500 ▼aAdvisor: Yu, Minlan;Mickens, James.
■5021 ▼aThesis (Ph.D.)--Harvard University, 2024.
■520 ▼aModern datacenters contain hundreds of thousands of servers and high-speed networks to run diverse applications. However, these datacenters suffer from low resource utilization and poor software performance that cannot be improved simply by relying on faster hardware. Because of these utilization and performance challenges, datacenters incur high operational costs, increased energy usage, and difficulty in handling growing application demands.In this thesis, I will focus on improving resource utilization and application performance through network-application co-design. I will first discuss how resource disaggregation, especially the far memory technique, is a promising way to improve memory utilization. However, prior research often lacks fault tolerance, a crucial requirement in datacenters. Subsequently, I will describe a fault-tolerant far memory system with network-efficient memory swapping and erasure coding, which requires far fewer network I/O operations than conventional wisdom, unlocking higher performance. I will then discuss how application-customized networking stacks can vastly improve the performance of network I/O-intensive distributed protocols such as consensus and transactions. The key insight is to safely offload protocol logic into kernel networking stacks to reduce kernel overhead. The resulting systems achieve the performance of kernel-bypass approaches but the security of kernel stacks.
■590 ▼aSchool code: 0084.
■650 4▼aComputer science
■650 4▼aSystems science
■650 4▼aInformation technology
■653 ▼aDistributed systems
■653 ▼aNetworking
■653 ▼aSystem design
■653 ▼aKernel stacks
■690 ▼a0984
■690 ▼a0489
■690 ▼a0790
■71020▼aHarvard University▼bEngineering and Applied Sciences - Computer Science.
■7730 ▼tDissertations Abstracts International▼g86-05B.
■790 ▼a0084
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17162548▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
