University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Highly Energy Efficient Key-value Store for In-network Computing

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Highly Energy Efficient Key-value Store for In-network Computing

Download to your calendar using vCal

If you have a question about this talk, please contact Liang Wang .

Key-value store applications are very popular in datacenters. As the load in datacenters increases, power efficiency and low latency become important properties of key-value store applications, affecting next generation computing infrastructure in the datacenter. In this talk, we present netKV: low latency, power efficient key-value store design for datacenter applications. netKV is a modular design, combining multiple cores and cache layering, both in hardware and software. We achieve 13Mqps, the throughput of state of the art, while maintaining low latency and 204W/kqps, which is 4.3x better power efficiency, compared with existing one. Using the modularity of our design, we study trade-offs in using cache, SRAM and DRAM in accelerated designs and provide insights into future architectures.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

CHANGE OF VENUE AND DATE: Seminar Room 3 at the Institute for Manufacturing, 17 Charles Babbage Road MR2 (note venue and time change!) Open University Branch Royal Institute of Philosophy

Other talks

Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? Morning Tea and Coffee Online Causal Inference Seminar Rothschild Public Lecture: Forty years of causal inference: Report of a great-grandfather Afternoon Break Talk title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity