<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1911.08356/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1911.08356/feed.xml" rel="self" type="application/rss+xml" /><item><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores — mentioned by jauntywundrkind</title><link>https://news.ycombinator.com/item?id=47470913</link><guid isPermaLink="false">urn:hackerpapers:mention:1911.08356:47470913</guid><pubDate>Sat, 21 Mar 2026 20:24:59 GMT</pubDate><description>&lt;p&gt;Really glad to get this write-up, adds a very nice broad picture &amp;amp; does a good job introducing the queue too. I&amp;#x27;m an unranked unwashed neophyte at hardware design, but I did spend some time looking at BIO. One particular thing that caught my eye a while ago was Streaming Semantic Registers, which is an instruction set extension for risc-v where load and store are implicit, with data pointers that automatically walk on each instruction. This greatly increases code density, allowing for DSP like capabilities on risc-v. https://arxiv.org/abs/1911.08356 I forget how exactly I was convinced, but…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1911.08356/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AR</category></item><item><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores — mentioned by jauntywundrkind</title><link>https://news.ycombinator.com/item?id=41925789</link><guid isPermaLink="false">urn:hackerpapers:mention:1911.08356:41925789</guid><pubDate>Wed, 23 Oct 2024 15:05:53 GMT</pubDate><description>&lt;p&gt;But these aren&amp;#x27;t Instruction Set Architecture (IS details. As mentioned in article, Berkeley&amp;#x27;s SonicBOOM is out of order. And you could certainly enhance the memory architecture with multi-level caches easily; the ISA is blind to this (consider how little x86 ISA has improved to tackle ever improving cache/memory strategies since i386). RISC-V is also extensible. So you can keep improving things! The incredibly awesome efficiency-foxused PULP group is working on a massive many-core research chip Occamy. It has huge vector processing units, many many many of them. Ok, so, promising.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1911.08356/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AR</category></item><item><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores — mentioned by jauntywundrkind</title><link>https://news.ycombinator.com/item?id=41775670</link><guid isPermaLink="false">urn:hackerpapers:mention:1911.08356:41775670</guid><pubDate>Tue, 08 Oct 2024 10:19:14 GMT</pubDate><description>&lt;p&gt;Talking about the ISA needing to spend so much time addressing memory, I&amp;#x27;m reminded of the really interesting Streaming Semantic Registers (SSRs) in Occamy, the excellent PULP group&amp;#x27;s 4096-core RISC-V research multichip design. https://arxiv.org/abs/1911.08356 Just like the instruction pointer which implicitly increments as code executes, there are some dedicated data-pointer registers. There&amp;#x27;s a dedicated ALU for advancing/incrementing, so you can have interesting access patterns for your data. Rather than loops needing to load data, compute, store data, and loop, you can just compute and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1911.08356/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AR</category></item><item><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores — mentioned by rektide</title><link>https://news.ycombinator.com/item?id=35880122</link><guid isPermaLink="false">urn:hackerpapers:mention:1911.08356:35880122</guid><pubDate>Tue, 09 May 2023 20:42:34 GMT</pubDate><description>&lt;p&gt;This is amazing. So fun to read. A &amp;quot;Snitch&amp;quot; cluster is 8+1 single-stage small integer cpus +1 DMA core. Cores each have their own &amp;quot;decoupled heavily pipelined&amp;quot; FPU. The cluster shares a L1 I-cache, has 32 banks of 4kB scratchpads, and has a 64bit config / peripheral AXI bus, and a 512bit &amp;quot;wide&amp;quot; AXI bus the +1 DMA core can talk to, and it&amp;#x27;s own connection to all the scratchpads. Clusters are grouped together. On this &amp;quot;Occamy&amp;quot; chip, there are 4 Snitch clusters in a group. These groups share the 64bit/512bit AXI group bus, which connects up to top bus. Groups also share a L2 consts cache. Then 6…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1911.08356/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AR</category></item><item><title>Stream Semantic Registers: A Lightweight RISC-V ISA Extension Achieving Full Compute Utilization in Single-Issue Cores — HN submission</title><link>https://news.ycombinator.com/item?id=21744875</link><guid isPermaLink="false">urn:hackerpapers:submission:1911.08356:21744875</guid><pubDate>Mon, 09 Dec 2019 18:11:55 GMT</pubDate><description>&lt;p&gt;Stream Semantic Registers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1911.08356/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AR</category></item></channel></rss>
