Skip Hash: A fast ordered map via software transactional memory (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Skip Hash: A fast ordered map via software transactional memory

First screen, captured 2 years ago.

Looks similar

Screenshot of arxiv.org: Flash-KMeans: Fast and Memory-Efficient Exact K-Means

Flash-KMeans: Fast and Memory-Efficient Exact K-Means (arxiv.org)

176 points by matt_d 7 months ago | 14 comments

Screenshot of arxiv.org: Banked Memories for Soft SIMT Processors

Banked Memories for Soft SIMT Processors (arxiv.org)

5 points by matt_d 1 year ago | 0 comments

Screenshot of arxiv.org: All-in-Memory Stochastic Computing Using ReRAM

All-in-Memory Stochastic Computing Using ReRAM (arxiv.org)

19 points by rbanffy 1 year ago | 0 comments

Screenshot of arxiv.org: A Photonic SRAM with Embedded XOR Logic for Ultra-Fast In-Memory Computing

A Photonic SRAM with Embedded XOR Logic for Ultra-Fast In-Memory Computing (arxiv.org)

49 points by PaulHoule 1 year ago | 13 comments

Screenshot of arxiv.org: Meticulous: An FPGA-Based Main Memory Emulator for System Software Studies

Meticulous: An FPGA-Based Main Memory Emulator for System Software Studies (arxiv.org)

43 points by PaulHoule 3 years ago | 1 comments

Screenshot of arxiv.org: Old Is Gold: Optimizing Single-Threaded Applications with Exgen-Malloc

Old Is Gold: Optimizing Single-Threaded Applications with Exgen-Malloc (arxiv.org)

7 points by todsacerdoti 1 year ago | 3 comments