1 # Variable-width Variable-packed SIMD / Simple-V / Parallelism Extension Proposal
3 * TODO 23may2018: CSR-CAM-ify regfile tables
4 * TODO 23may2018: zero-mark predication CSR
5 * TODO 28may2018: sort out VSETVL: CSR length to be removed?
6 * TODO 09jun2018: Chennai Presentation more up-to-date
7 * TODO 09jun2019: elwidth only 4 values (dflt, dflt/2, 8, 16)
8 * TODO 09jun2019: extra register banks (future option)
9 * TODO 09jun2019: new Reg CSR table (incl. packed=Y/N)
12 Key insight: Simple-V is intended as an abstraction layer to provide
13 a consistent "API" to parallelisation of existing *and future* operations.
14 *Actual* internal hardware-level parallelism is *not* required, such
15 that Simple-V may be viewed as providing a "compact" or "consolidated"
16 means of issuing multiple near-identical arithmetic instructions to an
17 instruction queue (FIFO), pending execution.
19 *Actual* parallelism, if added independently of Simple-V in the form
20 of Out-of-order restructuring (including parallel ALU lanes) or VLIW
21 implementations, or SIMD, or anything else, would then benefit *if*
22 Simple-V was added on top.
28 This proposal exists so as to be able to satisfy several disparate
29 requirements: power-conscious, area-conscious, and performance-conscious
30 designs all pull an ISA and its implementation in different conflicting
31 directions, as do the specific intended uses for any given implementation.
33 The existing P (SIMD) proposal and the V (Vector) proposals,
34 whilst each extremely powerful in their own right and clearly desirable,
37 * Clearly independent in their origins (Cray and AndesStar v3 respectively)
38 so need work to adapt to the RISC-V ethos and paradigm
39 * Are sufficiently large so as to make adoption (and exploration for
40 analysis and review purposes) prohibitively expensive
41 * Both contain partial duplication of pre-existing RISC-V instructions
42 (an undesirable characteristic)
43 * Both have independent, incompatible and disparate methods for introducing
44 parallelism at the instruction level
45 * Both require that their respective parallelism paradigm be implemented
46 along-side and integral to their respective functionality *or not at all*.
47 * Both independently have methods for introducing parallelism that
48 could, if separated, benefit
49 *other areas of RISC-V not just DSP or Floating-point respectively*.
51 There are also key differences between Vectorisation and SIMD (full
52 details outlined in the Appendix), the key points being:
54 * SIMD has an extremely seductively compelling ease of implementation argument:
55 each operation is passed to the ALU, which is where the parallelism
56 lies. There is *negligeable* (if any) impact on the rest of the core
57 (with life instead being made hell for compiler writers and applications
58 writers due to extreme ISA proliferation).
59 * By contrast, Vectorisation has quite some complexity (for considerable
60 flexibility, reduction in opcode proliferation and much more).
61 * Vectorisation typically includes much more comprehensive memory load
62 and store schemes (unit stride, constant-stride and indexed), which
63 in turn have ramifications: virtual memory misses (TLB cache misses)
64 and even multiple page-faults... all caused by a *single instruction*,
65 yet with a clear benefit that the regularisation of LOAD/STOREs can
66 be optimised for minimal impact on caches and maximised throughput.
67 * By contrast, SIMD can use "standard" memory load/stores (32-bit aligned
68 to pages), and these load/stores have absolutely nothing to do with the
69 SIMD / ALU engine, no matter how wide the operand. Simplicity but with
70 more impact on instruction and data caches.
72 Overall it makes a huge amount of sense to have a means and method
73 of introducing instruction parallelism in a flexible way that provides
74 implementors with the option to choose exactly where they wish to offer
75 performance improvements and where they wish to optimise for power
76 and/or area (and if that can be offered even on a per-operation basis that
77 would provide even more flexibility).
79 Additionally it makes sense to *split out* the parallelism inherent within
80 each of P and V, and to see if each of P and V then, in *combination* with
81 a "best-of-both" parallelism extension, could be added on *on top* of
82 this proposal, to topologically provide the exact same functionality of
83 each of P and V. Each of P and V then can focus on providing the best
84 operations possible for their respective target areas, without being
85 hugely concerned about the actual parallelism.
87 Furthermore, an additional goal of this proposal is to reduce the number
88 of opcodes utilised by each of P and V as they currently stand, leveraging
89 existing RISC-V opcodes where possible, and also potentially allowing
90 P and V to make use of Compressed Instructions as a result.
92 # Analysis and discussion of Vector vs SIMD
94 There are six combined areas between the two proposals that help with
95 parallelism (increased performance, reduced power / area) without
96 over-burdening the ISA with a huge proliferation of
99 * Fixed vs variable parallelism (fixed or variable "M" in SIMD)
100 * Implicit vs fixed instruction bit-width (integral to instruction or not)
101 * Implicit vs explicit type-conversion (compounded on bit-width)
102 * Implicit vs explicit inner loops.
103 * Single-instruction LOAD/STORE.
104 * Masks / tagging (selecting/preventing certain indexed elements from execution)
106 The pros and cons of each are discussed and analysed below.
108 ## Fixed vs variable parallelism length
110 In David Patterson and Andrew Waterman's analysis of SIMD and Vector
111 ISAs, the analysis comes out clearly in favour of (effectively) variable
112 length SIMD. As SIMD is a fixed width, typically 4, 8 or in extreme cases
113 16 or 32 simultaneous operations, the setup, teardown and corner-cases of SIMD
114 are extremely burdensome except for applications whose requirements
115 *specifically* match the *precise and exact* depth of the SIMD engine.
117 Thus, SIMD, no matter what width is chosen, is never going to be acceptable
118 for general-purpose computation, and in the context of developing a
119 general-purpose ISA, is never going to satisfy 100 percent of implementors.
121 To explain this further: for increased workloads over time, as the
122 performance requirements increase for new target markets, implementors
123 choose to extend the SIMD width (so as to again avoid mixing parallelism
124 into the instruction issue phases: the primary "simplicity" benefit of
125 SIMD in the first place), with the result that the entire opcode space
126 effectively doubles with each new SIMD width that's added to the ISA.
128 That basically leaves "variable-length vector" as the clear *general-purpose*
129 winner, at least in terms of greatly simplifying the instruction set,
130 reducing the number of instructions required for any given task, and thus
131 reducing power consumption for the same.
133 ## Implicit vs fixed instruction bit-width
135 SIMD again has a severe disadvantage here, over Vector: huge proliferation
136 of specialist instructions that target 8-bit, 16-bit, 32-bit, 64-bit, and
137 have to then have operations *for each and between each*. It gets very
138 messy, very quickly: *six* separate dimensions giving an O(N^6) instruction
139 proliferation profile.
141 The V-Extension on the other hand proposes to set the bit-width of
142 future instructions on a per-register basis, such that subsequent instructions
143 involving that register are *implicitly* of that particular bit-width until
144 otherwise changed or reset.
146 This has some extremely useful properties, without being particularly
147 burdensome to implementations, given that instruction decode already has
148 to direct the operation to a correctly-sized width ALU engine, anyway.
150 Not least: in places where an ISA was previously constrained (due for
151 whatever reason, including limitations of the available operand space),
152 implicit bit-width allows the meaning of certain operations to be
153 type-overloaded *without* pollution or alteration of frozen and immutable
154 instructions, in a fully backwards-compatible fashion.
156 ## Implicit and explicit type-conversion
158 The Draft 2.3 V-extension proposal has (deprecated) polymorphism to help
159 deal with over-population of instructions, such that type-casting from
160 integer (and floating point) of various sizes is automatically inferred
161 due to "type tagging" that is set with a special instruction. A register
162 will be *specifically* marked as "16-bit Floating-Point" and, if added
163 to an operand that is specifically tagged as "32-bit Integer" an implicit
164 type-conversion will take place *without* requiring that type-conversion
165 to be explicitly done with its own separate instruction.
167 However, implicit type-conversion is not only quite burdensome to
168 implement (explosion of inferred type-to-type conversion) but also is
169 never really going to be complete. It gets even worse when bit-widths
170 also have to be taken into consideration. Each new type results in
171 an increased O(N^2) conversion space that, as anyone who has examined
172 python's source code (which has built-in polymorphic type-conversion),
173 knows that the task is more complex than it first seems.
175 Overall, type-conversion is generally best to leave to explicit
176 type-conversion instructions, or in definite specific use-cases left to
177 be part of an actual instruction (DSP or FP)
179 ## Zero-overhead loops vs explicit loops
181 The initial Draft P-SIMD Proposal by Chuanhua Chang of Andes Technology
182 contains an extremely interesting feature: zero-overhead loops. This
183 proposal would basically allow an inner loop of instructions to be
184 repeated indefinitely, a fixed number of times.
186 Its specific advantage over explicit loops is that the pipeline in a DSP
187 can potentially be kept completely full *even in an in-order single-issue
188 implementation*. Normally, it requires a superscalar architecture and
189 out-of-order execution capabilities to "pre-process" instructions in
190 order to keep ALU pipelines 100% occupied.
192 By bringing that capability in, this proposal could offer a way to increase
193 pipeline activity even in simpler implementations in the one key area
194 which really matters: the inner loop.
196 However when looking at much more comprehensive schemes
197 "A portable specification of zero-overhead loop control hardware
198 applied to embedded processors" (ZOLC), optimising only the single
199 inner loop seems inadequate, tending to suggest that ZOLC may be
200 better off being proposed as an entirely separate Extension.
202 ## Single-instruction LOAD/STORE
204 In traditional Vector Architectures there are instructions which
205 result in multiple register-memory transfer operations resulting
206 from a single instruction. They're complicated to implement in hardware,
207 yet the benefits are a huge consistent regularisation of memory accesses
208 that can be highly optimised with respect to both actual memory and any
209 L1, L2 or other caches. In Hwacha EECS-2015-263 it is explicitly made
210 clear the consequences of getting this architecturally wrong:
211 L2 cache-thrashing at the very least.
213 Complications arise when Virtual Memory is involved: TLB cache misses
214 need to be dealt with, as do page faults. Some of the tradeoffs are
215 discussed in <http://people.eecs.berkeley.edu/~krste/thesis.pdf>, Section
216 4.6, and an article by Jeff Bush when faced with some of these issues
217 is particularly enlightening
218 <https://jbush001.github.io/2015/11/03/lost-in-translation.html>
220 Interestingly, none of this complexity is faced in SIMD architectures...
221 but then they do not get the opportunity to optimise for highly-streamlined
222 memory accesses either.
224 With the "bang-per-buck" ratio being so high and the indirect improvement
225 in L1 Instruction Cache usage (reduced instruction count), as well as
226 the opportunity to optimise L1 and L2 cache usage, the case for including
227 Vector LOAD/STORE is compelling.
229 ## Mask and Tagging (Predication)
231 Tagging (aka Masks aka Predication) is a pseudo-method of implementing
232 simplistic branching in a parallel fashion, by allowing execution on
233 elements of a vector to be switched on or off depending on the results
234 of prior operations in the same array position.
236 The reason for considering this is simple: by *definition* it
237 is not possible to perform individual parallel branches in a SIMD
238 (Single-Instruction, **Multiple**-Data) context. Branches (modifying
239 of the Program Counter) will result in *all* parallel data having
240 a different instruction executed on it: that's just the definition of
241 SIMD, and it is simply unavoidable.
243 So these are the ways in which conditional execution may be implemented:
245 * explicit compare and branch: BNE x, y -> offs would jump offs
246 instructions if x was not equal to y
247 * explicit store of tag condition: CMP x, y -> tagbit
248 * implicit (condition-code) such as ADD results in a carry, carry bit
249 implicitly (or sometimes explicitly) goes into a "tag" (mask) register
251 The first of these is a "normal" branch method, which is flat-out impossible
252 to parallelise without look-ahead and effectively rewriting instructions.
253 This would defeat the purpose of RISC.
255 The latter two are where parallelism becomes easy to do without complexity:
256 every operation is modified to be "conditionally executed" (in an explicit
257 way directly in the instruction format *or* implicitly).
259 RVV (Vector-Extension) proposes to have *explicit* storing of the compare
260 in a tag/mask register, and to *explicitly* have every vector operation
261 *require* that its operation be "predicated" on the bits within an
262 explicitly-named tag/mask register.
264 SIMD (P-Extension) has not yet published precise documentation on what its
265 schema is to be: there is however verbal indication at the time of writing
268 > The "compare" instructions in the DSP/SIMD ISA proposed by Andes will
269 > be executed using the same compare ALU logic for the base ISA with some
270 > minor modifications to handle smaller data types. The function will not
273 This is an *implicit* form of predication as the base RV ISA does not have
274 condition-codes or predication. By adding a CSR it becomes possible
275 to also tag certain registers as "predicated if referenced as a destination".
278 // in future operations from now on, if r0 is the destination use r5 as
279 // the PREDICATION register
280 SET_IMPLICIT_CSRPREDICATE r0, r5
281 // store the compares in r5 as the PREDICATION register
283 // r0 is used here. ah ha! that means it's predicated using r5!
286 With enough registers (and in RISC-V there are enough registers) some fairly
287 complex predication can be set up and yet still execute without significant
288 stalling, even in a simple non-superscalar architecture.
290 (For details on how Branch Instructions would be retro-fitted to indirectly
291 predicated equivalents, see Appendix)
295 In the above sections the five different ways where parallel instruction
296 execution has closely and loosely inter-related implications for the ISA and
297 for implementors, were outlined. The pluses and minuses came out as
300 * Fixed vs variable parallelism: <b>variable</b>
301 * Implicit (indirect) vs fixed (integral) instruction bit-width: <b>indirect</b>
302 * Implicit vs explicit type-conversion: <b>explicit</b>
303 * Implicit vs explicit inner loops: <b>implicit but best done separately</b>
304 * Single-instruction Vector LOAD/STORE: <b>Complex but highly beneficial</b>
305 * Tag or no-tag: <b>Complex but highly beneficial</b>
309 * variable-length vectors came out on top because of the high setup, teardown
310 and corner-cases associated with the fixed width of SIMD.
311 * Implicit bit-width helps to extend the ISA to escape from
312 former limitations and restrictions (in a backwards-compatible fashion),
313 whilst also leaving implementors free to simmplify implementations
314 by using actual explicit internal parallelism.
315 * Implicit (zero-overhead) loops provide a means to keep pipelines
316 potentially 100% occupied in a single-issue in-order implementation
317 i.e. *without* requiring a super-scalar or out-of-order architecture,
318 but doing a proper, full job (ZOLC) is an entirely different matter.
320 Constructing a SIMD/Simple-Vector proposal based around four of these six
321 requirements would therefore seem to be a logical thing to do.
323 # Note on implementation of parallelism
325 One extremely important aspect of this proposal is to respect and support
326 implementors desire to focus on power, area or performance. In that regard,
327 it is proposed that implementors be free to choose whether to implement
328 the Vector (or variable-width SIMD) parallelism as sequential operations
329 with a single ALU, fully parallel (if practical) with multiple ALUs, or
330 a hybrid combination of both.
332 In Broadcom's Videocore-IV, they chose hybrid, and called it "Virtual
333 Parallelism". They achieve a 16-way SIMD at an **instruction** level
334 by providing a combination of a 4-way parallel ALU *and* an externally
335 transparent loop that feeds 4 sequential sets of data into each of the
338 Also in the same core, it is worth noting that particularly uncommon
339 but essential operations (Reciprocal-Square-Root for example) are
340 *not* part of the 4-way parallel ALU but instead have a *single* ALU.
341 Under the proposed Vector (varible-width SIMD) implementors would
342 be free to do precisely that: i.e. free to choose *on a per operation
343 basis* whether and how much "Virtual Parallelism" to deploy.
345 It is absolutely critical to note that it is proposed that such choices MUST
346 be **entirely transparent** to the end-user and the compiler. Whilst
347 a Vector (varible-width SIMD) may not precisely match the width of the
348 parallelism within the implementation, the end-user **should not care**
349 and in this way the performance benefits are gained but the ISA remains
350 straightforward. All that happens at the end of an instruction run is: some
351 parallel units (if there are any) would remain offline, completely
352 transparently to the ISA, the program, and the compiler.
354 To make that clear: should an implementor choose a particularly wide
355 SIMD-style ALU, each parallel unit *must* have predication so that
356 the parallel SIMD ALU may emulate variable-length parallel operations.
357 Thus the "SIMD considered harmful" trap of having huge complexity and extra
358 instructions to deal with corner-cases is thus avoided, and implementors
359 get to choose precisely where to focus and target the benefits of their
360 implementation efforts, without "extra baggage".
362 In addition, implementors will be free to choose whether to provide an
363 absolute bare minimum level of compliance with the "API" (software-traps
364 when vectorisation is detected), all the way up to full supercomputing
365 level all-hardware parallelism. Options are covered in the Appendix.
367 # CSRs <a name="csrs"></a>
369 There are two CSR tables needed to create lookup tables which are used at
370 the register decode phase.
372 * Integer Register N is Vector
373 * Integer Register N is of implicit bitwidth M (M=default,8,16,32,64)
374 * Floating-point Register N is Vector of length M: r(N) -> r(N..N+M-1)
375 * Floating-point Register N is of implicit bitwidth M (M=default,8,16,32,64)
376 * Integer Register N is a Predication Register (note: a key-value store)
378 Also (see Appendix, "Context Switch Example") it may turn out to be important
379 to have a separate (smaller) set of CSRs for M-Mode (and S-Mode) so that
380 Vectorised LOAD / STORE may be used to load and store multiple registers:
381 something that is missing from the Base RV ISA.
385 * for the purposes of LOAD / STORE, Integer Registers which are
386 marked as a Vector will result in a Vector LOAD / STORE.
387 * Vector Lengths are *not* the same as vsetl but are an integral part
389 * Actual vector length is *multipled* by how many blocks of length
390 "bitwidth" may fit into an XLEN-sized register file.
391 * Predication is a key-value store due to the implicit referencing,
392 as opposed to having the predicate register explicitly in the instruction.
393 * Whilst the predication CSR is a key-value store it *generates* easier-to-use
395 * TODO: assess whether the same technique could be applied to the other
396 Vector CSRs, particularly as pointed out in Section 17.8 (Draft RV 0.4,
397 V2.3-Draft ISA Reference) it becomes possible to greatly reduce state
398 needed for context-switches (empty slots need never be stored).
400 ## Predication CSR <a name="predication_csr_table"></a>
402 The Predication CSR is a key-value store indicating whether, if a given
403 destination register (integer or floating-point) is referred to in an
404 instruction, it is to be predicated. However it is important to note
405 that the *actual* register is *different* from the one that ends up
406 being used, due to the level of indirection through the lookup table.
407 This includes (in the future) redirecting to a *second* bank of
408 integer registers (as a future option)
410 * regidx is the actual register that in combination with the
411 i/f flag, if that integer or floating-point register is referred to,
412 results in the lookup table being referenced to find the predication
413 mask to use on the operation in which that (regidx) register has
415 * predidx (in combination with the bank bit in the future) is the
416 *actual* register to be used for the predication mask. Note:
417 in effect predidx is actually a 6-bit register address, as the bank
418 bit is the MSB (and is nominally set to zero for now).
419 * inv indicates that the predication mask bits are to be inverted
420 prior to use *without* actually modifying the contents of the
422 * zeroing is either 1 or 0, and if set to 1, the operation must
423 place zeros in any element position where the predication mask is
424 set to zero. If zeroing is set to 1, unpredicated elements *must*
425 be left alone. Some microarchitectures may choose to interpret
426 this as skipping the operation entirely. Others which wish to
427 stick more closely to a SIMD architecture may choose instead to
428 interpret unpredicated elements as an internal "copy element"
429 operation (which would be necessary in SIMD microarchitectures
430 that perform register-renaming)
432 | PrCSR | 13 | 12 | 11 | 10 | (9..5) | (4..0) |
433 | ----- | - | - | - | - | ------- | ------- |
434 | 0 | bank0 | zero0 | inv0 | i/f | regidx | predidx |
435 | 1 | bank1 | zero1 | inv1 | i/f | regidx | predidx |
436 | .. | bank.. | zero.. | inv.. | i/f | regidx | predidx |
437 | 15 | bank15 | zero15 | inv15 | i/f | regidx | predidx |
439 The Predication CSR Table is a key-value store, so implementation-wise
440 it will be faster to turn the table around (maintain topologically
446 bool bank; // 0 for now, 1=rsvd
448 int predidx; // redirection: actual int register to use
451 struct pred fp_pred_reg[32]; // 64 in future (bank=1)
452 struct pred int_pred_reg[32]; // 64 in future (bank=1)
454 for (i = 0; i < 16; i++)
455 tb = int_pred_reg if CSRpred[i].type == 0 else fp_pred_reg;
456 idx = CSRpred[i].regidx
457 tb[idx].zero = CSRpred[i].zero
458 tb[idx].inv = CSRpred[i].inv
459 tb[idx].bank = CSRpred[i].bank
460 tb[idx].predidx = CSRpred[i].predidx
461 tb[idx].enabled = true
463 So when an operation is to be predicated, it is the internal state that
464 is used. In Section 6.4.2 of Hwacha's Manual (EECS-2015-262) the following
465 pseudo-code for operations is given, where p is the explicit (direct)
466 reference to the predication register to be used:
468 for (int i=0; i<vl; ++i)
470 (d ? vreg[rd][i] : sreg[rd]) =
471 iop(s1 ? vreg[rs1][i] : sreg[rs1],
472 s2 ? vreg[rs2][i] : sreg[rs2]); // for insts with 2 inputs
474 This instead becomes an *indirect* reference using the *internal* state
475 table generated from the Predication CSR key-value store, which iwws used
479 preg = int_pred_reg[rd]
481 preg = fp_pred_reg[rd]
483 for (int i=0; i<vl; ++i)
484 predidx = preg[rd].predidx; // the indirection takes place HERE
485 if (!preg[rd].enabled)
486 predicate = ~0x0; // all parallel ops enabled
488 predicate = intregfile[predidx]; // get actual reg contents HERE
489 if (preg[rd].inv) // invert if requested
490 predicate = ~predicate;
491 if (predicate && (1<<i))
492 (d ? regfile[rd+i] : regfile[rd]) =
493 iop(s1 ? regfile[rs1+i] : regfile[rs1],
494 s2 ? regfile[rs2+i] : regfile[rs2]); // for insts with 2 inputs
495 else if (preg[rd].zero)
496 // TODO: place zero in dest reg
500 * d, s1 and s2 are booleans indicating whether destination,
501 source1 and source2 are vector or scalar
502 * key-value CSR-redirection of rd, rs1 and rs2 have NOT been included
503 above, for clarity. rd, rs1 and rs2 all also must ALSO go through
504 register-level redirection (from the Register CSR table) if they are
507 If written as a function, obtaining the predication mask (but not whether
508 zeroing takes place) may be done as follows:
510 def get_pred_val(bool is_fp_op, int reg):
511 tb = int_pred if is_fp_op else fp_pred
512 if (!tb[reg].enabled):
513 return ~0x0 // all ops enabled
514 predidx = tb[reg].predidx // redirection occurs HERE
515 predicate = intreg[predidx] // actual predicate HERE
517 predicate = ~predicate // invert ALL bits
522 MAXVECTORLENGTH is the same concept as MVL in RVV. However in Simple-V,
523 given that its primary (base, unextended) purpose is for 3D, Video and
524 other purposes (not requiring supercomputing capability), it makes sense
525 to limit MAXVECTORDEPTH to the regfile bitwidth (32 for RV32, 64 for RV64
528 The reason for setting this limit is so that predication registers, when
529 marked as such, may fit into a single register as opposed to fanning out
530 over several registers. This keeps the implementation a little simpler.
531 Note also (as also described in the VSETVL section) that the *minimum*
532 for MAXVECTORDEPTH must be the total number of registers (15 for RV32E
533 and 31 for RV32 or RV64).
535 Note that RVV on top of Simple-V may choose to over-ride this decision.
537 ## Register CSR key-value table
539 Element bitwidths may be specified with a per-register CSR, and indicate
540 how a register (integer or floating-point) is to be subdivided.
549 vew may be one of the following (giving a table "bytestable", used below):
558 Extending this table (with extra bits) is covered in the section
559 "Implementing RVV on top of Simple-V".
561 Note that when using the "vsetl rs1, rs2" instruction, taking bitwidth
562 into account, it becomes:
564 vew = CSRbitwidth[rs1]
566 bytesperreg = (XLEN/8) # or FLEN as appropriate
568 bytesperreg = bytestable[vew] # 1 2 4 8 16
569 simdmult = (XLEN/8) / bytesperreg # or FLEN as appropriate
570 vlen = CSRvectorlen[rs1] * simdmult
571 CSRvlength = MIN(MIN(vlen, MAXVECTORDEPTH), rs2)
573 The reason for multiplying the vector length by the number of SIMD elements
574 (in each individual register) is so that each SIMD element may optionally be
577 An example of how to subdivide the register file when bitwidth != default
578 is given in the section "Bitwidth Virtual Register Reordering".
582 By being a topological remap of RVV concepts, the following RVV instructions
583 remain exactly the same: VMPOP, VMFIRST, VEXTRACT, VINSERT, VMERGE, VSELECT,
584 VSLIDE, VCLASS and VPOPC. Two instructions, VCLIP and VCLIPI, do not
585 have RV Standard equivalents, so are left out of Simple-V.
586 All other instructions from RVV are topologically re-mapped and retain
587 their complete functionality, intact.
589 ## Instruction Format
591 The instruction format for Simple-V does not actually have *any* explicit
592 compare operations, *any* arithmetic, floating point or *any*
594 Instead it *overloads* pre-existing branch operations into predicated
595 variants, and implicitly overloads arithmetic operations and LOAD/STORE
596 depending on CSR configurations for vector length, bitwidth and
597 predication. *This includes Compressed instructions* as well as any
598 future instructions and Custom Extensions.
600 * For analysis of RVV see [[v_comparative_analysis]] which begins to
601 outline topologically-equivalent mappings of instructions
602 * Also see Appendix "Retro-fitting Predication into branch-explicit ISA"
603 for format of Branch opcodes.
605 **TODO**: *analyse and decide whether the implicit nature of predication
606 as proposed is or is not a lot of hassle, and if explicit prefixes are
607 a better idea instead. Parallelism therefore effectively may end up
608 as always being 64-bit opcodes (32 for the prefix, 32 for the instruction)
609 with some opportunities for to use Compressed bringing it down to 48.
610 Also to consider is whether one or both of the last two remaining Compressed
611 instruction codes in Quadrant 1 could be used as a parallelism prefix,
612 bringing parallelised opcodes down to 32-bit (when combined with C)
613 and having the benefit of being explicit.*
617 NOTE TODO: 28may2018: VSETVL may need to be *really* different from RVV,
618 with the instruction format remaining the same.
620 VSETVL is slightly different from RVV in that the minimum vector length
621 is required to be at least the number of registers in the register file,
622 and no more than XLEN. This allows vector LOAD/STORE to be used to switch
623 the entire bank of registers using a single instruction (see Appendix,
624 "Context Switch Example"). The reason for limiting VSETVL to XLEN is
625 down to the fact that predication bits fit into a single register of length
628 The second minor change is that when VSETVL is requested to be stored
629 into x0, it is *ignored* silently.
631 Unlike RVV, implementors *must* provide pseudo-parallelism (using sequential
632 loops in hardware) if actual hardware-parallelism in the ALUs is not deployed.
633 A hybrid is also permitted (as used in Broadcom's VideoCore-IV) however this
634 must be *entirely* transparent to the ISA.
636 ### Under review / discussion: remove CSR vector length, use VSETVL <a name="vsetvl"></a>
638 So the issue is as follows:
640 * CSRs are used to set the "span" of a vector (how many of the standard
641 register file to contiguously use)
642 * VSETVL in RVV works as follows: it sets the vector length (copy of which
643 is placed in a dest register), and if the "required" length is longer
644 than the *available* length, the dest reg is set to the MIN of those
646 * **HOWEVER**... in SV, *EVERY* vector register has its own separate
647 length and thus there is no way (at the time that VSETVL is called) to
648 know what to set the vector length *to*.
649 * At first glance it seems that it would be perfectly fine to just limit
650 the vector operation to the length specified in the destination
651 register's CSR, at the time that each instruction is issued...
652 except that that cannot possibly be guaranteed to match
653 with the value *already loaded into the target register from VSETVL*.
655 Therefore a different approach is needed.
657 Possible options include:
659 * Removing the CSR "Vector Length" and always using the value from
660 VSETVL. "VSETVL destreg, counterreg, #lenimmed" will set VL *and*
661 destreg equal to MIN(counterreg, lenimmed), with register-based
662 variant "VSETVL destreg, counterreg, lenreg" doing the same.
663 * Keeping the CSR "Vector Length" and having the lenreg version have
664 a "twist": "if lengreg is vectorised, read the length from the CSR"
667 The first option (of the ones brainstormed so far) is a lot simpler.
668 It does however mean that the length set in VSETVL will apply across-the-board
669 to all src1, src2 and dest vectorised registers until it is otherwise changed
670 (by another VSETVL call). This is probably desirable behaviour.
672 ## Branch Instruction:
674 Branch operations use standard RV opcodes that are reinterpreted to be
675 "predicate variants" in the instance where either of the two src registers
676 have their corresponding CSRvectorlen[src] entry as non-zero. When this
677 reinterpretation is enabled the predicate target register rs3 is to be
678 treated as a bitfield (up to a maximum of XLEN bits corresponding to a
679 maximum of XLEN elements).
681 If either of src1 or src2 are scalars (CSRvectorlen[src] == 0) the comparison
682 goes ahead as vector-scalar or scalar-vector. Implementors should note that
683 this could require considerable multi-porting of the register file in order
684 to parallelise properly, so may have to involve the use of register cacheing
685 and transparent copying (see Multiple-Banked Register File Architectures
688 In instances where no vectorisation is detected on either src registers
689 the operation is treated as an absolutely standard scalar branch operation.
691 This is the overloaded table for Integer-base Branch operations. Opcode
692 (bits 6..0) is set in all cases to 1100011.
695 31 .. 25 |24 ... 20 | 19 15 | 14 12 | 11 .. 8 | 7 | 6 ... 0 |
696 imm[12,10:5]| rs2 | rs1 | funct3 | imm[4:1] | imm[11] | opcode |
697 7 | 5 | 5 | 3 | 4 | 1 | 7 |
698 reserved | src2 | src1 | BPR | predicate rs3 || BRANCH |
699 reserved | src2 | src1 | 000 | predicate rs3 || BEQ |
700 reserved | src2 | src1 | 001 | predicate rs3 || BNE |
701 reserved | src2 | src1 | 010 | predicate rs3 || rsvd |
702 reserved | src2 | src1 | 011 | predicate rs3 || rsvd |
703 reserved | src2 | src1 | 100 | predicate rs3 || BLE |
704 reserved | src2 | src1 | 101 | predicate rs3 || BGE |
705 reserved | src2 | src1 | 110 | predicate rs3 || BLTU |
706 reserved | src2 | src1 | 111 | predicate rs3 || BGEU |
709 Note that just as with the standard (scalar, non-predicated) branch
710 operations, BLT, BGT, BLEU and BTGU may be synthesised by inverting
713 Below is the overloaded table for Floating-point Predication operations.
714 Interestingly no change is needed to the instruction format because
715 FP Compare already stores a 1 or a zero in its "rd" integer register
716 target, i.e. it's not actually a Branch at all: it's a compare.
717 The target needs to simply change to be a predication bitfield (done
721 Standard RVF/D/Q, Opcode (bits 6..0) is set in all cases to 1010011.
722 Likewise Single-precision, fmt bits 26..25) is still set to 00.
723 Double-precision is still set to 01, whilst Quad-precision
724 appears not to have a definition in V2.3-Draft (but should be unaffected).
726 It is however noted that an entry "FNE" (the opposite of FEQ) is missing,
727 and whilst in ordinary branch code this is fine because the standard
728 RVF compare can always be followed up with an integer BEQ or a BNE (or
729 a compressed comparison to zero or non-zero), in predication terms that
730 becomes more of an impact as an explicit (scalar) instruction is needed
731 to invert the predicate bitmask. An additional encoding funct3=011 is
732 therefore proposed to cater for this.
735 31 .. 27| 26 .. 25 |24 ... 20 | 19 15 | 14 12 | 11 .. 7 | 6 ... 0 |
736 funct5 | fmt | rs2 | rs1 | funct3 | rd | opcode |
737 5 | 2 | 5 | 5 | 3 | 4 | 7 |
738 10100 | 00/01/11 | src2 | src1 | 010 | pred rs3 | FEQ |
739 10100 | 00/01/11 | src2 | src1 | **011**| pred rs3 | FNE |
740 10100 | 00/01/11 | src2 | src1 | 001 | pred rs3 | FLT |
741 10100 | 00/01/11 | src2 | src1 | 000 | pred rs3 | FLE |
744 Note (**TBD**): floating-point exceptions will need to be extended
745 to cater for multiple exceptions (and statuses of the same). The
746 usual approach is to have an array of status codes and bit-fields,
747 and one exception, rather than throw separate exceptions for each
750 In Hwacha EECS-2015-262 Section 6.7.2 the following pseudocode is given
751 for predicated compare operations of function "cmp":
753 for (int i=0; i<vl; ++i)
755 preg[pd][i] = cmp(s1 ? vreg[rs1][i] : sreg[rs1],
756 s2 ? vreg[rs2][i] : sreg[rs2]);
758 With associated predication, vector-length adjustments and so on,
759 and temporarily ignoring bitwidth (which makes the comparisons more
760 complex), this becomes:
762 if I/F == INT: # integer type cmp
763 pred_enabled = int_pred_enabled # TODO: exception if not set!
764 preg = int_pred_reg[rd]
767 pred_enabled = fp_pred_enabled # TODO: exception if not set!
768 preg = fp_pred_reg[rd]
771 s1 = CSRvectorlen[src1] > 1;
772 s2 = CSRvectorlen[src2] > 1;
773 for (int i=0; i<vl; ++i)
774 preg[rs3][i] = cmp(s1 ? reg[src1+i] : reg[src1],
775 s2 ? reg[src2+i] : reg[src2]);
779 * Predicated SIMD comparisons would break src1 and src2 further down
780 into bitwidth-sized chunks (see Appendix "Bitwidth Virtual Register
781 Reordering") setting Vector-Length times (number of SIMD elements) bits
782 in Predicate Register rs3 as opposed to just Vector-Length bits.
783 * Predicated Branches do not actually have an adjustment to the Program
784 Counter, so all of bits 25 through 30 in every case are not needed.
785 * There are plenty of reserved opcodes for which bits 25 through 30 could
786 be put to good use if there is a suitable use-case.
787 * FEQ and FNE (and BEQ and BNE) are included in order to save one
788 instruction having to invert the resultant predicate bitfield.
789 FLT and FLE may be inverted to FGT and FGE if needed by swapping
790 src1 and src2 (likewise the integer counterparts).
792 ## Compressed Branch Instruction:
795 15..13 | 12...10 | 9..7 | 6..5 | 4..2 | 1..0 | name |
796 funct3 | imm | rs10 | imm | | op | |
797 3 | 3 | 3 | 2 | 3 | 2 | |
798 C.BPR | pred rs3 | src1 | I/F B | src2 | C1 | |
799 110 | pred rs3 | src1 | I/F 0 | src2 | C1 | P.EQ |
800 111 | pred rs3 | src1 | I/F 0 | src2 | C1 | P.NE |
801 110 | pred rs3 | src1 | I/F 1 | src2 | C1 | P.LT |
802 111 | pred rs3 | src1 | I/F 1 | src2 | C1 | P.LE |
807 * Bits 5 13 14 and 15 make up the comparator type
808 * Bit 6 indicates whether to use integer or floating-point comparisons
809 * In both floating-point and integer cases there are four predication
810 comparators: EQ/NEQ/LT/LE (with GT and GE being synthesised by inverting
813 ## LOAD / STORE Instructions <a name="load_store"></a>
815 For full analysis of topological adaptation of RVV LOAD/STORE
816 see [[v_comparative_analysis]]. All three types (LD, LD.S and LD.X)
817 may be implicitly overloaded into the one base RV LOAD instruction,
818 and likewise for STORE.
823 31 | 30 | 29 25 | 24 20 | 19 15 | 14 12 | 11 7 | 6 0 |
824 imm[11:0] |||| rs1 | funct3 | rd | opcode |
825 1 | 1 | 5 | 5 | 5 | 3 | 5 | 7 |
826 ? | s | rs2 | imm[4:0] | base | width | dest | LOAD |
829 The exact same corresponding adaptation is also carried out on the single,
830 double and quad precision floating-point LOAD-FP and STORE-FP operations,
831 which fit the exact same instruction format. Thus all three types
832 (unit, stride and indexed) may be fitted into FLW, FLD and FLQ,
833 as well as FSW, FSD and FSQ.
837 * LOAD remains functionally (topologically) identical to RVV LOAD
838 (for both integer and floating-point variants).
839 * Predication CSR-marking register is not explicitly shown in instruction, it's
840 implicit based on the CSR predicate state for the rd (destination) register
841 * rs2, the source, may *also be marked as a vector*, which implicitly
842 is taken to indicate "Indexed Load" (LD.X)
843 * Bit 30 indicates "element stride" or "constant-stride" (LD or LD.S)
844 * Bit 31 is reserved (ideas under consideration: auto-increment)
845 * **TODO**: include CSR SIMD bitwidth in the pseudo-code below.
846 * **TODO**: clarify where width maps to elsize
848 Pseudo-code (excludes CSR SIMD bitwidth for simplicity):
850 if (unit-strided) stride = elsize;
851 else stride = areg[as2]; // constant-strided
853 pred_enabled = int_pred_enabled
854 preg = int_pred_reg[rd]
856 for (int i=0; i<vl; ++i)
857 if (preg_enabled[rd] && [!]preg[i])
858 for (int j=0; j<seglen+1; j++)
860 if CSRvectorised[rs2])
863 offs = i*(seglen+1)*stride;
864 vreg[rd+j][i] = mem[sreg[base] + offs + j*stride];
867 Taking CSR (SIMD) bitwidth into account involves using the vector
868 length and register encoding according to the "Bitwidth Virtual Register
869 Reordering" scheme shown in the Appendix (see function "regoffs").
871 A similar instruction exists for STORE, with identical topological
872 translation of all features. **TODO**
874 ## Compressed LOAD / STORE Instructions
876 Compressed LOAD and STORE are of the same format, where bits 2-4 are
877 a src register instead of dest:
880 15 13 | 12 10 | 9 7 | 6 5 | 4 2 | 1 0 |
881 funct3 | imm | rs10 | imm | rd0 | op |
882 3 | 3 | 3 | 2 | 3 | 2 |
883 C.LW | offset[5:3] | base | offset[2|6] | dest | C0 |
886 Unfortunately it is not possible to fit the full functionality
887 of vectorised LOAD / STORE into C.LD / C.ST: the "X" variants (Indexed)
888 require another operand (rs2) in addition to the operand width
889 (which is also missing), offset, base, and src/dest.
891 However a close approximation may be achieved by taking the top bit
892 of the offset in each of the five types of LD (and ST), reducing the
893 offset to 4 bits and utilising the 5th bit to indicate whether "stride"
894 is to be enabled. In this way it is at least possible to introduce
897 (**TODO**: *assess whether the loss of one bit from offset is worth having
898 "stride" capability.*)
900 We also assume (including for the "stride" variant) that the "width"
901 parameter, which is missing, is derived and implicit, just as it is
902 with the standard Compressed LOAD/STORE instructions. For C.LW, C.LD
903 and C.LQ, the width is implicitly 4, 8 and 16 respectively, whilst for
904 C.FLW and C.FLD the width is implicitly 4 and 8 respectively.
906 Interestingly we note that the Vectorised Simple-V variant of
907 LOAD/STORE (Compressed and otherwise), due to it effectively using the
908 standard register file(s), is the direct functional equivalent of
909 standard load-multiple and store-multiple instructions found in other
912 In Section 12.3 riscv-isa manual V2.3-draft it is noted the comments on
913 page 76, "For virtual memory systems some data accesses could be resident
914 in physical memory and some not". The interesting question then arises:
915 how does RVV deal with the exact same scenario?
916 Expired U.S. Patent 5895501 (Filing Date Sep 3 1996) describes a method
917 of detecting early page / segmentation faults and adjusting the TLB
918 in advance, accordingly: other strategies are explored in the Appendix
919 Section "Virtual Memory Page Faults".
923 > What does an ADD of two different-sized vectors do in simple-V?
925 * if the two source operands are not the same, throw an exception.
926 * if the destination operand is also a vector, and the source is longer
927 than the destination, throw an exception.
929 > And what about instructions like JALR?
930 > What does jumping to a vector do?
932 * Throw an exception. Whether that actually results in spawning threads
933 as part of the trap-handling remains to be seen.
935 # Impementing V on top of Simple-V
937 With Simple-V converting the original RVV draft concept-for-concept
938 from explicit opcodes to implicit overloading of existing RV Standard
939 Extensions, certain features were (deliberately) excluded that need
940 to be added back in for RVV to reach its full potential. This is
941 made slightly complicated by the fact that RVV itself has two
942 levels: Base and reserved future functionality.
944 * Representation Encoding is entirely left out of Simple-V in favour of
945 implicitly taking the exact (explicit) meaning from RV Standard Extensions.
946 * VCLIP and VCLIPI do not have corresponding RV Standard Extension
947 opcodes (and are the only such operations).
948 * Extended Element bitwidths (1 through to 24576 bits) were left out
949 of Simple-V as, again, there is no corresponding RV Standard Extension
950 that covers anything even below 32-bit operands.
951 * Polymorphism was entirely left out of Simple-V due to the inherent
952 complexity of automatic type-conversion.
953 * Vector Register files were specifically left out of Simple-V in favour
954 of fitting on top of the integer and floating-point files. An
955 "RVV re-retro-fit" needs to be able to mark (implicitly marked)
956 registers as being actually in a separate *vector* register file.
957 * Fortunately in RVV (Draft 0.4, V2.3-Draft), the "base" vector
958 register file size is 5 bits (32 registers), whilst the "Extended"
959 variant of RVV specifies 8 bits (256 registers) and has yet to
961 * One big difference: Sections 17.12 and 17.17, there are only two possible
962 predication registers in RVV "Base". Through the "indirect" method,
963 Simple-V provides a key-value CSR table that allows (arbitrarily)
964 up to 16 (TBD) of either the floating-point or integer registers to
965 be marked as "predicated" (key), and if so, which integer register to
966 use as the predication mask (value).
970 # Implementing P (renamed to DSP) on top of Simple-V
972 * Implementors indicate chosen bitwidth support in Vector-bitwidth CSR
973 (caveat: anything not specified drops through to software-emulation / traps)
978 ## V-Extension to Simple-V Comparative Analysis
980 This section has been moved to its own page [[v_comparative_analysis]]
984 This section has been moved to its own page [[p_comparative_analysis]]
986 ## Comparison of "Traditional" SIMD, Alt-RVP, Simple-V and RVV Proposals <a name="parallelism_comparisons"></a>
988 This section compares the various parallelism proposals as they stand,
989 including traditional SIMD, in terms of features, ease of implementation,
990 complexity, flexibility, and die area.
992 ### [[harmonised_rvv_rvp]]
994 This is an interesting proposal under development to retro-fit the AndesStar
999 Primary benefit of Alt-RVP is the simplicity with which parallelism
1000 may be introduced (effective multiplication of regfiles and associated ALUs).
1002 * plus: the simplicity of the lanes (combined with the regularity of
1003 allocating identical opcodes multiple independent registers) meaning
1004 that SRAM or 2R1W can be used for entire regfile (potentially).
1005 * minus: a more complex instruction set where the parallelism is much
1006 more explicitly directly specified in the instruction and
1007 * minus: if you *don't* have an explicit instruction (opcode) and you
1008 need one, the only place it can be added is... in the vector unit and
1009 * minus: opcode functions (and associated ALUs) duplicated in Alt-RVP are
1010 not useable or accessible in other Extensions.
1011 * plus-and-minus: Lanes may be utilised for high-speed context-switching
1012 but with the down-side that they're an all-or-nothing part of the Extension.
1013 No Alt-RVP: no fast register-bank switching.
1014 * plus: Lane-switching would mean that complex operations not suited to
1015 parallelisation can be carried out, followed by further parallel Lane-based
1016 work, without moving register contents down to memory (and back)
1017 * minus: Access to registers across multiple lanes is challenging. "Solution"
1018 is to drop data into memory and immediately back in again (like MMX).
1022 Primary benefit of Simple-V is the OO abstraction of parallel principles
1023 from actual (internal) parallel hardware. It's an API in effect that's
1024 designed to be slotted in to an existing implementation (just after
1025 instruction decode) with minimum disruption and effort.
1027 * minus: the complexity (if full parallelism is to be exploited)
1028 of having to use register renames, OoO, VLIW, register file cacheing,
1029 all of which has been done before but is a pain
1030 * plus: transparent re-use of existing opcodes as-is just indirectly
1031 saying "this register's now a vector" which
1032 * plus: means that future instructions also get to be inherently
1033 parallelised because there's no "separate vector opcodes"
1034 * plus: Compressed instructions may also be (indirectly) parallelised
1035 * minus: the indirect nature of Simple-V means that setup (setting
1036 a CSR register to indicate vector length, a separate one to indicate
1037 that it is a predicate register and so on) means a little more setup
1038 time than Alt-RVP or RVV's "direct and within the (longer) instruction"
1040 * plus: shared register file meaning that, like Alt-RVP, complex
1041 operations not suited to parallelisation may be carried out interleaved
1042 between parallelised instructions *without* requiring data to be dropped
1043 down to memory and back (into a separate vectorised register engine).
1044 * plus-and-maybe-minus: re-use of integer and floating-point 32-wide register
1045 files means that huge parallel workloads would use up considerable
1046 chunks of the register file. However in the case of RV64 and 32-bit
1047 operations, that effectively means 64 slots are available for parallel
1049 * plus: inherent parallelism (actual parallel ALUs) doesn't actually need to
1050 be added, yet the instruction opcodes remain unchanged (and still appear
1051 to be parallel). consistent "API" regardless of actual internal parallelism:
1052 even an in-order single-issue implementation with a single ALU would still
1053 appear to have parallel vectoristion.
1054 * hard-to-judge: if actual inherent underlying ALU parallelism is added it's
1055 hard to say if there would be pluses or minuses (on die area). At worse it
1056 would be "no worse" than existing register renaming, OoO, VLIW and register
1057 file cacheing schemes.
1059 ### RVV (as it stands, Draft 0.4 Section 17, RISC-V ISA V2.3-Draft)
1061 RVV is extremely well-designed and has some amazing features, including
1062 2D reorganisation of memory through LOAD/STORE "strides".
1064 * plus: regular predictable workload means that implementations may
1065 streamline effects on L1/L2 Cache.
1066 * plus: regular and clear parallel workload also means that lanes
1067 (similar to Alt-RVP) may be used as an implementation detail,
1068 using either SRAM or 2R1W registers.
1069 * plus: separate engine with no impact on the rest of an implementation
1070 * minus: separate *complex* engine with no RTL (ALUs, Pipeline stages) reuse
1072 * minus: no ISA abstraction or re-use either: additions to other Extensions
1073 do not gain parallelism, resulting in prolific duplication of functionality
1074 inside RVV *and out*.
1075 * minus: when operations require a different approach (scalar operations
1076 using the standard integer or FP regfile) an entire vector must be
1077 transferred out to memory, into standard regfiles, then back to memory,
1078 then back to the vector unit, this to occur potentially multiple times.
1079 * minus: will never fit into Compressed instruction space (as-is. May
1080 be able to do so if "indirect" features of Simple-V are partially adopted).
1081 * plus-and-slight-minus: extended variants may address up to 256
1082 vectorised registers (requires 48/64-bit opcodes to do it).
1083 * minus-and-partial-plus: separate engine plus complexity increases
1084 implementation time and die area, meaning that adoption is likely only
1085 to be in high-performance specialist supercomputing (where it will
1086 be absolutely superb).
1088 ### Traditional SIMD
1090 The only really good things about SIMD are how easy it is to implement and
1091 get good performance. Unfortunately that makes it quite seductive...
1093 * plus: really straightforward, ALU basically does several packed operations
1094 at once. Parallelism is inherent at the ALU, making the addition of
1095 SIMD-style parallelism an easy decision that has zero significant impact
1096 on the rest of any given architectural design and layout.
1097 * plus (continuation): SIMD in simple in-order single-issue designs can
1098 therefore result in superb throughput, easily achieved even with a very
1099 simple execution model.
1100 * minus: ridiculously complex setup and corner-cases that disproportionately
1101 increase instruction count on what would otherwise be a "simple loop",
1102 should the number of elements in an array not happen to exactly match
1103 the SIMD group width.
1104 * minus: getting data usefully out of registers (if separate regfiles
1105 are used) means outputting to memory and back.
1106 * minus: quite a lot of supplementary instructions for bit-level manipulation
1107 are needed in order to efficiently extract (or prepare) SIMD operands.
1108 * minus: MASSIVE proliferation of ISA both in terms of opcodes in one
1109 dimension and parallelism (width): an at least O(N^2) and quite probably
1110 O(N^3) ISA proliferation that often results in several thousand
1111 separate instructions. all requiring separate and distinct corner-case
1113 * minus: EVEN BIGGER proliferation of SIMD ISA if the functionality of
1114 8, 16, 32 or 64-bit reordering is built-in to the SIMD instruction.
1115 For example: add (high|low) 16-bits of r1 to (low|high) of r2 requires
1116 four separate and distinct instructions: one for (r1:low r2:high),
1117 one for (r1:high r2:low), one for (r1:high r2:high) and one for
1118 (r1:low r2:low) *per function*.
1119 * minus: EVEN BIGGER proliferation of SIMD ISA if there is a mismatch
1120 between operand and result bit-widths. In combination with high/low
1121 proliferation the situation is made even worse.
1122 * minor-saving-grace: some implementations *may* have predication masks
1123 that allow control over individual elements within the SIMD block.
1125 ## Comparison *to* Traditional SIMD: Alt-RVP, Simple-V and RVV Proposals <a name="simd_comparison"></a>
1127 This section compares the various parallelism proposals as they stand,
1128 *against* traditional SIMD as opposed to *alongside* SIMD. In other words,
1129 the question is asked "How can each of the proposals effectively implement
1130 (or replace) SIMD, and how effective would they be"?
1134 * Alt-RVP would not actually replace SIMD but would augment it: just as with
1135 a SIMD architecture where the ALU becomes responsible for the parallelism,
1136 Alt-RVP ALUs would likewise be so responsible... with *additional*
1137 (lane-based) parallelism on top.
1138 * Thus at least some of the downsides of SIMD ISA O(N^5) proliferation by
1139 at least one dimension are avoided (architectural upgrades introducing
1140 128-bit then 256-bit then 512-bit variants of the exact same 64-bit
1142 * Thus, unfortunately, Alt-RVP would suffer the same inherent proliferation
1143 of instructions as SIMD, albeit not quite as badly (due to Lanes).
1144 * In the same discussion for Alt-RVP, an additional proposal was made to
1145 be able to subdivide the bits of each register lane (columns) down into
1146 arbitrary bit-lengths (RGB 565 for example).
1147 * A recommendation was given instead to make the subdivisions down to 32-bit,
1148 16-bit or even 8-bit, effectively dividing the registerfile into
1149 Lane0(H), Lane0(L), Lane1(H) ... LaneN(L) or further. If inter-lane
1150 "swapping" instructions were then introduced, some of the disadvantages
1151 of SIMD could be mitigated.
1155 * RVV is designed to replace SIMD with a better paradigm: arbitrary-length
1157 * However whilst SIMD is usually designed for single-issue in-order simple
1158 DSPs with a focus on Multimedia (Audio, Video and Image processing),
1159 RVV's primary focus appears to be on Supercomputing: optimisation of
1160 mathematical operations that fit into the OpenCL space.
1161 * Adding functions (operations) that would normally fit (in parallel)
1162 into a SIMD instruction requires an equivalent to be added to the
1163 RVV Extension, if one does not exist. Given the specialist nature of
1164 some SIMD instructions (8-bit or 16-bit saturated or halving add),
1165 this possibility seems extremely unlikely to occur, even if the
1166 implementation overhead of RVV were acceptable (compared to
1167 normal SIMD/DSP-style single-issue in-order simplicity).
1171 * Simple-V borrows hugely from RVV as it is intended to be easy to
1172 topologically transplant every single instruction from RVV (as
1173 designed) into Simple-V equivalents, with *zero loss of functionality
1175 * With the "parallelism" abstracted out, a hypothetical SIMD-less "DSP"
1176 Extension which contained the basic primitives (non-parallelised
1177 8, 16 or 32-bit SIMD operations) inherently *become* parallel,
1179 * Additionally, standard operations (ADD, MUL) that would normally have
1180 to have special SIMD-parallel opcodes added need no longer have *any*
1181 of the length-dependent variants (2of 32-bit ADDs in a 64-bit register,
1182 4of 32-bit ADDs in a 128-bit register) because Simple-V takes the
1183 *standard* RV opcodes (present and future) and automatically parallelises
1185 * By inheriting the RVV feature of arbitrary vector-length, then just as
1186 with RVV the corner-cases and ISA proliferation of SIMD is avoided.
1187 * Whilst not entirely finalised, registers are expected to be
1188 capable of being subdivided down to an implementor-chosen bitwidth
1189 in the underlying hardware (r1 becomes r1[31..24] r1[23..16] r1[15..8]
1190 and r1[7..0], or just r1[31..16] r1[15..0]) where implementors can
1191 choose to have separate independent 8-bit ALUs or dual-SIMD 16-bit
1192 ALUs that perform twin 8-bit operations as they see fit, or anything
1193 else including no subdivisions at all.
1194 * Even though implementors have that choice even to have full 64-bit
1195 (with RV64) SIMD, they *must* provide predication that transparently
1196 switches off appropriate units on the last loop, thus neatly fitting
1197 underlying SIMD ALU implementations *into* the arbitrary vector-length
1198 RVV paradigm, keeping the uniform consistent API that is a key strategic
1199 feature of Simple-V.
1200 * With Simple-V fitting into the standard register files, certain classes
1201 of SIMD operations such as High/Low arithmetic (r1[31..16] + r2[15..0])
1202 can be done by applying *Parallelised* Bit-manipulation operations
1203 followed by parallelised *straight* versions of element-to-element
1204 arithmetic operations, even if the bit-manipulation operations require
1205 changing the bitwidth of the "vectors" to do so. Predication can
1206 be utilised to skip high words (or low words) in source or destination.
1207 * In essence, the key downside of SIMD - massive duplication of
1208 identical functions over time as an architecture evolves from 32-bit
1209 wide SIMD all the way up to 512-bit, is avoided with Simple-V, through
1210 vector-style parallelism being dropped on top of 8-bit or 16-bit
1211 operations, all the while keeping a consistent ISA-level "API" irrespective
1212 of implementor design choices (or indeed actual implementations).
1214 ### Example Instruction translation: <a name="example_translation"></a>
1216 Instructions "ADD r2 r4 r4" would result in three instructions being
1217 generated and placed into the FIFO:
1223 ## Example of vector / vector, vector / scalar, scalar / scalar => vector add
1225 register CSRvectorlen[XLEN][4]; # not quite decided yet about this one...
1226 register CSRpredicate[XLEN][4]; # 2^4 is max vector length
1227 register CSRreg_is_vectorised[XLEN]; # just for fun support scalars as well
1228 register x[32][XLEN];
1230 function op_add(rd, rs1, rs2, predr)
1232 /* note that this is ADD, not PADD */
1233 int i, id, irs1, irs2;
1234 # checks CSRvectorlen[rd] == CSRvectorlen[rs] etc. ignored
1235 # also destination makes no sense as a scalar but what the hell...
1236 for (i = 0, id=0, irs1=0, irs2=0; i<CSRvectorlen[rd]; i++)
1237 if (CSRpredicate[predr][i]) # i *think* this is right...
1238 x[rd+id] <= x[rs1+irs1] + x[rs2+irs2];
1239 # now increment the idxs
1240 if (CSRreg_is_vectorised[rd]) # bitfield check rd, scalar/vector?
1242 if (CSRreg_is_vectorised[rs1]) # bitfield check rs1, scalar/vector?
1244 if (CSRreg_is_vectorised[rs2]) # bitfield check rs2, scalar/vector?
1248 ## Retro-fitting Predication into branch-explicit ISA <a name="predication_retrofit"></a>
1250 One of the goals of this parallelism proposal is to avoid instruction
1251 duplication. However, with the base ISA having been designed explictly
1252 to *avoid* condition-codes entirely, shoe-horning predication into it
1253 bcomes quite challenging.
1255 However what if all branch instructions, if referencing a vectorised
1256 register, were instead given *completely new analogous meanings* that
1257 resulted in a parallel bit-wise predication register being set? This
1258 would have to be done for both C.BEQZ and C.BNEZ, as well as BEQ, BNE,
1261 We might imagine that FEQ, FLT and FLT would also need to be converted,
1262 however these are effectively *already* in the precise form needed and
1263 do not need to be converted *at all*! The difference is that FEQ, FLT
1264 and FLE *specifically* write a 1 to an integer register if the condition
1265 holds, and 0 if not. All that needs to be done here is to say, "if
1266 the integer register is tagged with a bit that says it is a predication
1267 register, the **bit** in the integer register is set based on the
1268 current vector index" instead.
1270 There is, in the standard Conditional Branch instruction, more than
1271 adequate space to interpret it in a similar fashion:
1274 31 |30 ..... 25 |24..20|19..15| 14...12| 11.....8 | 7 | 6....0 |
1275 imm[12] | imm[10:5] |rs2 | rs1 | funct3 | imm[4:1] | imm[11] | opcode |
1276 1 | 6 | 5 | 5 | 3 | 4 | 1 | 7 |
1277 offset[12,10:5] || src2 | src1 | BEQ | offset[11,4:1] || BRANCH |
1283 31 | 30 .. 25 |24 ... 20 | 19 15 | 14 12 | 11 .. 8 | 7 | 6 ... 0 |
1284 imm[12] | imm[10:5]| rs2 | rs1 | funct3 | imm[4:1] | imm[11] | opcode |
1285 1 | 6 | 5 | 5 | 3 | 4 | 1 | 7 |
1286 reserved || src2 | src1 | BEQ | predicate rs3 || BRANCH |
1289 Similarly the C.BEQZ and C.BNEZ instruction format may be retro-fitted,
1290 with the interesting side-effect that there is space within what is presently
1291 the "immediate offset" field to reinterpret that to add in not only a bit
1292 field to distinguish between floating-point compare and integer compare,
1293 not only to add in a second source register, but also use some of the bits as
1294 a predication target as well.
1297 15..13 | 12 ....... 10 | 9...7 | 6 ......... 2 | 1 .. 0 |
1298 funct3 | imm | rs10 | imm | op |
1300 C.BEQZ | offset[8,4:3] | src | offset[7:6,2:1,5] | C1 |
1303 Now uses the CS format:
1306 15..13 | 12 . 10 | 9 .. 7 | 6 .. 5 | 4..2 | 1 .. 0 |
1307 funct3 | imm | rs10 | imm | | op |
1308 3 | 3 | 3 | 2 | 3 | 2 |
1309 C.BEQZ | pred rs3 | src1 | I/F B | src2 | C1 |
1312 Bit 6 would be decoded as "operation refers to Integer or Float" including
1313 interpreting src1 and src2 accordingly as outlined in Table 12.2 of the
1314 "C" Standard, version 2.0,
1315 whilst Bit 5 would allow the operation to be extended, in combination with
1316 funct3 = 110 or 111: a combination of four distinct (predicated) comparison
1317 operators. In both floating-point and integer cases those could be
1318 EQ/NEQ/LT/LE (with GT and GE being synthesised by inverting src1 and src2).
1320 ## Register reordering <a name="register_reordering"></a>
1339 May not be an actual CSR: may be generated from Vector Length CSR:
1340 single-bit is less burdensome on instruction decode phase.
1342 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
1343 | - | - | - | - | - | - | - | - |
1344 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
1346 ### Vector Length CSR
1348 | Reg Num | (3..0) |
1359 ### Virtual Register Reordering
1361 This example assumes the above Vector Length CSR table
1363 | Reg Num | Bits (0) | Bits (1) | Bits (2) |
1364 | ------- | -------- | -------- | -------- |
1365 | r0 | (32..0) | (32..0) |
1368 | r4 | (32..0) | (32..0) | (32..0) |
1371 ### Bitwidth Virtual Register Reordering
1373 This example goes a little further and illustrates the effect that a
1374 bitwidth CSR has been set on a register. Preconditions:
1377 * CSRintbitwidth[2] = 010 # integer r2 is 16-bit
1378 * CSRintvlength[2] = 3 # integer r2 is a vector of length 3
1379 * vsetl rs1, 5 # set the vector length to 5
1381 This is interpreted as follows:
1383 * Given that the context is RV32, ELEN=32.
1384 * With ELEN=32 and bitwidth=16, the number of SIMD elements is 2
1385 * Therefore the actual vector length is up to *six* elements
1386 * However vsetl sets a length 5 therefore the last "element" is skipped
1388 So when using an operation that uses r2 as a source (or destination)
1389 the operation is carried out as follows:
1391 * 16-bit operation on r2(15..0) - vector element index 0
1392 * 16-bit operation on r2(31..16) - vector element index 1
1393 * 16-bit operation on r3(15..0) - vector element index 2
1394 * 16-bit operation on r3(31..16) - vector element index 3
1395 * 16-bit operation on r4(15..0) - vector element index 4
1396 * 16-bit operation on r4(31..16) **NOT** carried out due to length being 5
1398 Predication has been left out of the above example for simplicity, however
1399 predication is ANDed with the latter stages (vsetl not equal to maximum
1402 Note also that it is entirely an implementor's choice as to whether to have
1403 actual separate ALUs down to the minimum bitwidth, or whether to have something
1404 more akin to traditional SIMD (at any level of subdivision: 8-bit SIMD
1405 operations carried out 32-bits at a time is perfectly acceptable, as is
1406 8-bit SIMD operations carried out 16-bits at a time requiring two ALUs).
1407 Regardless of the internal parallelism choice, *predication must
1408 still be respected*, making Simple-V in effect the "consistent public API".
1410 vew may be one of the following (giving a table "bytestable", used below):
1412 | vew | bitwidth | bytestable |
1413 | --- | -------- | ---------- |
1414 | 000 | default | XLEN/8 |
1420 | 110 | rsvd | rsvd |
1421 | 111 | rsvd | rsvd |
1423 Pseudocode for vector length taking CSR SIMD-bitwidth into account:
1425 vew = CSRbitwidth[rs1]
1427 bytesperreg = (XLEN/8) # or FLEN as appropriate
1429 bytesperreg = bytestable[vew] # 1 2 4 8 16
1430 simdmult = (XLEN/8) / bytesperreg # or FLEN as appropriate
1431 vlen = CSRvectorlen[rs1] * simdmult
1433 To index an element in a register rnum where the vector element index is i:
1435 function regoffs(rnum, i):
1436 regidx = floor(i / simdmult) # integer-div rounded down
1437 byteidx = i % simdmult # integer-remainder
1438 return rnum + regidx, # actual real register
1440 byteidx * 8 + (vew-1), # high
1444 SIMD register file splitting still to consider. For RV64, benefits of doubling
1445 (quadrupling in the case of Half-Precision IEEE754 FP) the apparent
1446 size of the floating point register file to 64 (128 in the case of HP)
1447 seem pretty clear and worth the complexity.
1449 64 virtual 32-bit F.P. registers and given that 32-bit FP operations are
1450 done on 64-bit registers it's not so conceptually difficult. May even
1451 be achieved by *actually* splitting the regfile into 64 virtual 32-bit
1452 registers such that a 64-bit FP scalar operation is dropped into (r0.H
1453 r0.L) tuples. Implementation therefore hidden through register renaming.
1455 Implementations intending to introduce VLIW, OoO and parallelism
1456 (even without Simple-V) would then find that the instructions are
1457 generated quicker (or in a more compact fashion that is less heavy
1458 on caches). Interestingly we observe then that Simple-V is about
1459 "consolidation of instruction generation", where actual parallelism
1460 of underlying hardware is an implementor-choice that could just as
1461 equally be applied *without* Simple-V even being implemented.
1463 ## Analysis of CSR decoding on latency <a name="csr_decoding_analysis"></a>
1465 It could indeed have been logically deduced (or expected), that there
1466 would be additional decode latency in this proposal, because if
1467 overloading the opcodes to have different meanings, there is guaranteed
1468 to be some state, some-where, directly related to registers.
1470 There are several cases:
1472 * All operands vector-length=1 (scalars), all operands
1473 packed-bitwidth="default": instructions are passed through direct as if
1474 Simple-V did not exist. Simple-V is, in effect, completely disabled.
1475 * At least one operand vector-length > 1, all operands
1476 packed-bitwidth="default": any parallel vector ALUs placed on "alert",
1477 virtual parallelism looping may be activated.
1478 * All operands vector-length=1 (scalars), at least one
1479 operand packed-bitwidth != default: degenerate case of SIMD,
1480 implementation-specific complexity here (packed decode before ALUs or
1482 * At least one operand vector-length > 1, at least one operand
1483 packed-bitwidth != default: parallel vector ALUs (if any)
1484 placed on "alert", virtual parallelsim looping may be activated,
1485 implementation-specific SIMD complexity kicks in (packed decode before
1488 Bear in mind that the proposal includes that the decision whether
1489 to parallelise in hardware or whether to virtual-parallelise (to
1490 dramatically simplify compilers and also not to run into the SIMD
1491 instruction proliferation nightmare) *or* a transprent combination
1492 of both, be done on a *per-operand basis*, so that implementors can
1493 specifically choose to create an application-optimised implementation
1494 that they believe (or know) will sell extremely well, without having
1495 "Extra Standards-Mandated Baggage" that would otherwise blow their area
1496 or power budget completely out the window.
1498 Additionally, two possible CSR schemes have been proposed, in order to
1499 greatly reduce CSR space:
1501 * per-register CSRs (vector-length and packed-bitwidth)
1502 * a smaller number of CSRs with the same information but with an *INDEX*
1503 specifying WHICH register in one of three regfiles (vector, fp, int)
1504 the length and bitwidth applies to.
1506 (See "CSR vector-length and CSR SIMD packed-bitwidth" section for details)
1508 In addition, LOAD/STORE has its own associated proposed CSRs that
1509 mirror the STRIDE (but not yet STRIDE-SEGMENT?) functionality of
1512 Also bear in mind that, for reasons of simplicity for implementors,
1513 I was coming round to the idea of permitting implementors to choose
1514 exactly which bitwidths they would like to support in hardware and which
1515 to allow to fall through to software-trap emulation.
1517 So the question boils down to:
1519 * whether either (or both) of those two CSR schemes have significant
1520 latency that could even potentially require an extra pipeline decode stage
1521 * whether there are implementations that can be thought of which do *not*
1522 introduce significant latency
1523 * whether it is possible to explicitly (through quite simply
1524 disabling Simple-V-Ext) or implicitly (detect the case all-vlens=1,
1525 all-simd-bitwidths=default) switch OFF any decoding, perhaps even to
1526 the extreme of skipping an entire pipeline stage (if one is needed)
1527 * whether packed bitwidth and associated regfile splitting is so complex
1528 that it should definitely, definitely be made mandatory that implementors
1529 move regfile splitting into the ALU, and what are the implications of that
1530 * whether even if that *is* made mandatory, is software-trapped
1531 "unsupported bitwidths" still desirable, on the basis that SIMD is such
1532 a complete nightmare that *even* having a software implementation is
1533 better, making Simple-V have more in common with a software API than
1536 Whilst the above may seem to be severe minuses, there are some strong
1539 * Significant reduction of V's opcode space: over 95%.
1540 * Smaller reduction of P's opcode space: around 10%.
1541 * The potential to use Compressed instructions in both Vector and SIMD
1542 due to the overloading of register meaning (implicit vectorisation,
1544 * Not only present but also future extensions automatically gain parallelism.
1545 * Already mentioned but worth emphasising: the simplification to compiler
1546 writers and assembly-level writers of having the same consistent ISA
1547 regardless of whether the internal level of parallelism (number of
1548 parallel ALUs) is only equal to one ("virtual" parallelism), or is
1549 greater than one, should not be underestimated.
1551 ## Reducing Register Bank porting
1553 This looks quite reasonable.
1554 <https://www.princeton.edu/~rblee/ELE572Papers/MultiBankRegFile_ISCA2000.pdf>
1556 The main details are outlined on page 4. They propose a 2-level register
1557 cache hierarchy, note that registers are typically only read once, that
1558 you never write back from upper to lower cache level but always go in a
1559 cycle lower -> upper -> ALU -> lower, and at the top of page 5 propose
1560 a scheme where you look ahead by only 2 instructions to determine which
1561 registers to bring into the cache.
1563 The nice thing about a vector architecture is that you *know* that
1564 *even more* registers are going to be pulled in: Hwacha uses this fact
1565 to optimise L1/L2 cache-line usage (avoid thrashing), strangely enough
1566 by *introducing* deliberate latency into the execution phase.
1568 ## Overflow registers in combination with predication
1570 **TODO**: propose overflow registers be actually one of the integer regs
1571 (flowing to multiple regs).
1573 **TODO**: propose "mask" (predication) registers likewise. combination with
1574 standard RV instructions and overflow registers extremely powerful, see
1577 When integer overflow is stored in an easily-accessible bit (or another
1578 register), parallelisation turns this into a group of bits which can
1579 potentially be interacted with in predication, in interesting and powerful
1580 ways. For example, by taking the integer-overflow result as a predication
1581 field and shifting it by one, a predicated vectorised "add one" can emulate
1582 "carry" on arbitrary (unlimited) length addition.
1584 However despite RVV having made room for floating-point exceptions, neither
1585 RVV nor base RV have taken integer-overflow (carry) into account, which
1586 makes proposing it quite challenging given that the relevant (Base) RV
1587 sections are frozen. Consequently it makes sense to forgo this feature.
1589 ## Context Switch Example <a name="context_switch"></a>
1591 An unusual side-effect of Simple-V mapping onto the standard register files
1592 is that LOAD-multiple and STORE-multiple are accidentally available, as long
1593 as it is acceptable that the register(s) to be loaded/stored are contiguous
1594 (per instruction). An additional accidental benefit is that Compressed LD/ST
1597 To illustrate how this works, here is some example code from FreeRTOS
1598 (GPLv2 licensed, portasm.S):
1600 /* Macro for saving task context */
1601 .macro portSAVE_CONTEXT
1602 .global pxCurrentTCB
1603 /* make room in stack */
1604 addi sp, sp, -REGBYTES * 32
1608 STORE x2, 1 * REGBYTES(sp)
1609 STORE x3, 2 * REGBYTES(sp)
1612 STORE x30, 29 * REGBYTES(sp)
1613 STORE x31, 30 * REGBYTES(sp)
1615 /* Store current stackpointer in task control block (TCB) */
1616 LOAD t0, pxCurrentTCB //pointer
1620 /* Saves current error program counter (EPC) as task program counter */
1623 STORE t0, 31 * REGBYTES(sp)
1626 /* Saves current return adress (RA) as task program counter */
1628 STORE ra, 31 * REGBYTES(sp)
1631 /* Macro for restoring task context */
1632 .macro portRESTORE_CONTEXT
1634 .global pxCurrentTCB
1635 /* Load stack pointer from the current TCB */
1636 LOAD sp, pxCurrentTCB
1639 /* Load task program counter */
1640 LOAD t0, 31 * REGBYTES(sp)
1643 /* Run in machine mode */
1647 /* Restore registers,
1648 Skip global pointer because that does not change */
1650 LOAD x4, 3 * REGBYTES(sp)
1651 LOAD x5, 4 * REGBYTES(sp)
1654 LOAD x30, 29 * REGBYTES(sp)
1655 LOAD x31, 30 * REGBYTES(sp)
1657 addi sp, sp, REGBYTES * 32
1661 The important bits are the Load / Save context, which may be replaced
1662 with firstly setting up the Vectors and secondly using a *single* STORE
1663 (or LOAD) including using C.ST or C.LD, to indicate that the entire
1664 bank of registers is to be loaded/saved:
1666 /* a few things are assumed here: (a) that when switching to
1667 M-Mode an entirely different set of CSRs is used from that
1668 which is used in U-Mode and (b) that the M-Mode x1 and x4
1669 vectors are also not used anywhere else in M-Mode, consequently
1670 only need to be set up just the once.
1673 MVECTORCSRx1 = 31, defaultlen
1674 MVECTORCSRx4 = 28, defaultlen
1677 SETVL x0, x0, 31 /* x0 ignored silently */
1678 STORE x1, 0x0(sp) // x1 marked as 31-long vector of default bitwidth
1680 /* Restore registers,
1681 Skip global pointer because that does not change */
1683 SETVL x0, x0, 28 /* x0 ignored silently */
1684 LOAD x4, 3 * REGBYTES(sp) // x4 marked as 28-long default bitwidth
1686 Note that although it may just be a bug in portasm.S, x2 and x3 appear not
1687 to be being restored. If however this is a bug and they *do* need to be
1688 restored, then the SETVL call may be moved to *outside* the Save / Restore
1689 Context assembly code, into the macroVectorSetup, as long as vectors are
1690 never used anywhere else (i.e. VL is never altered by M-Mode).
1692 In effect the entire bank of repeated LOAD / STORE instructions is replaced
1693 by one single (compressed if it is available) instruction.
1695 ## Virtual Memory page-faults on LOAD/STORE
1698 ### Notes from conversations
1700 > I was going through the C.LOAD / C.STORE section 12.3 of V2.3-Draft
1701 > riscv-isa-manual in order to work out how to re-map RVV onto the standard
1702 > ISA, and came across an interesting comments at the bottom of pages 75
1705 > " A common mechanism used in other ISAs to further reduce save/restore
1706 > code size is load- multiple and store-multiple instructions. "
1708 > Fascinatingly, due to Simple-V proposing to use the *standard* register
1709 > file, both C.LOAD / C.STORE *and* LOAD / STORE would in effect be exactly
1710 > that: load-multiple and store-multiple instructions. Which brings us
1711 > on to this comment:
1713 > "For virtual memory systems, some data accesses could be resident in
1714 > physical memory and
1715 > some could not, which requires a new restart mechanism for partially
1716 > executed instructions."
1718 > Which then of course brings us to the interesting question: how does RVV
1719 > cope with the scenario when, particularly with LD.X (Indexed / indirect
1720 > loads), part-way through the loading a page fault occurs?
1722 > Has this been noted or discussed before?
1724 For applications-class platforms, the RVV exception model is
1725 element-precise (that is, if an exception occurs on element j of a
1726 vector instruction, elements 0..j-1 have completed execution and elements
1727 j+1..vl-1 have not executed).
1729 Certain classes of embedded platforms where exceptions are always fatal
1730 might choose to offer resumable/swappable interrupts but not precise
1734 > Is RVV designed in any way to be re-entrant?
1739 > What would the implications be for instructions that were in a FIFO at
1740 > the time, in out-of-order and VLIW implementations, where partial decode
1743 The usual bag of tricks for maintaining precise exceptions applies to
1744 vector machines as well. Register renaming makes the job easier, and
1745 it's relatively cheaper for vectors, since the control cost is amortized
1746 over longer registers.
1749 > Would it be reasonable at least to say *bypass* (and freeze) the
1750 > instruction FIFO (drop down to a single-issue execution model temporarily)
1751 > for the purposes of executing the instructions in the interrupt (whilst
1752 > setting up the VM page), then re-continue the instruction with all
1755 This approach has been done successfully, but it's desirable to be
1756 able to swap out the vector unit state to support context switches on
1757 exceptions that result in long-latency I/O.
1760 > Or would it be better to switch to an entirely separate secondary
1761 > hyperthread context?
1763 > Does anyone have any ideas or know if there is any academic literature
1764 > on solutions to this problem?
1766 The Vector VAX offered imprecise but restartable and swappable exceptions:
1767 http://mprc.pku.edu.cn/~liuxianhua/chn/corpus/Notes/articles/isca/1990/VAX%20vector%20architecture.pdf
1769 Sec. 4.6 of Krste's dissertation assesses some of
1770 the tradeoffs and references a bunch of related work:
1771 http://people.eecs.berkeley.edu/~krste/thesis.pdf
1776 Started reading section 4.6 of Krste's thesis, noted the "IEE85 F.P
1777 exceptions" and thought, "hmmm that could go into a CSR, must re-read
1778 the section on FP state CSRs in RVV 0.4-Draft again" then i suddenly
1779 thought, "ah ha! what if the memory exceptions were, instead of having
1780 an immediate exception thrown, were simply stored in a type of predication
1781 bit-field with a flag "error this element failed"?
1783 Then, *after* the vector load (or store, or even operation) was
1784 performed, you could *then* raise an exception, at which point it
1785 would be possible (yes in software... I know....) to go "hmmm, these
1786 indexed operations didn't work, let's get them into memory by triggering
1787 page-loads", then *re-run the entire instruction* but this time with a
1788 "memory-predication CSR" that stops the already-performed operations
1789 (whether they be loads, stores or an arithmetic / FP operation) from
1790 being carried out a second time.
1792 This theoretically could end up being done multiple times in an SMP
1793 environment, and also for LD.X there would be the remote outside annoying
1794 possibility that the indexed memory address could end up being modified.
1796 The advantage would be that the order of execution need not be
1797 sequential, which potentially could have some big advantages.
1798 Am still thinking through the implications as any dependent operations
1799 (particularly ones already decoded and moved into the execution FIFO)
1800 would still be there (and stalled). hmmm.
1804 > > # assume internal parallelism of 8 and MAXVECTORLEN of 8
1809 > > x3[1]: exception
1815 > > what happens to result elements 2-7? those may be *big* results
1817 > > or in the RVV-Extended may be arbitrary bit-widths far greater.
1823 discussion then led to the question of OoO architectures
1825 > The costs of the imprecise-exception model are greater than the benefit.
1826 > Software doesn't want to cope with it. It's hard to debug. You can't
1827 > migrate state between different microarchitectures--unless you force all
1828 > implementations to support the same imprecise-exception model, which would
1829 > greatly limit implementation flexibility. (Less important, but still
1830 > relevant, is that the imprecise model increases the size of the context
1831 > structure, as the microarchitectural guts have to be spilled to memory.)
1833 ## Zero/Non-zero Predication
1835 >> > it just occurred to me that there's another reason why the data
1836 >> > should be left instead of zeroed. if the standard register file is
1837 >> > used, such that vectorised operations are translated to mean "please
1838 >> > insert multiple register-contiguous operations into the instruction
1839 >> > FIFO" and predication is used to *skip* some of those, then if the
1840 >> > next "vector" operation uses the (standard) registers that were masked
1841 >> > *out* of the previous operation it may proceed without blocking.
1843 >> > if however zeroing is made mandatory then that optimisation becomes
1844 >> > flat-out impossible to deploy.
1846 >> > whilst i haven't fully thought through the full implications, i
1847 >> > suspect RVV might also be able to benefit by being able to fit more
1848 >> > overlapping operations into the available SRAM by doing something
1852 > Luke, this is called density time masking. It doesn’t apply to only your
1853 > model with the “standard register file” is used. it applies to any
1854 > architecture that attempts to speed up by skipping computation and writeback
1855 > of masked elements.
1857 > That said, the writing of zeros need not be explicit. It is possible to add
1858 > a “zero bit” per element that, when set, forces a zero to be read from the
1859 > vector (although the underlying storage may have old data). In this case,
1860 > there may be a way to implement DTM as well.
1863 ## Implementation detail for scalar-only op detection <a name="scalar_detection"></a>
1865 Note 1: this idea is a pipeline-bypass concept, which may *or may not* be
1868 Note 2: this is just one possible implementation. Another implementation
1869 may choose to treat *all* operations as vectorised (including treating
1870 scalars as vectors of length 1), choosing to add an extra pipeline stage
1871 dedicated to *all* instructions.
1873 This section *specifically* covers the implementor's freedom to choose
1874 that they wish to minimise disruption to an existing design by detecting
1875 "scalar-only operations", bypassing the vectorisation phase (which may
1876 or may not require an additional pipeline stage)
1878 [[scalardetect.png]]
1880 >> For scalar ops an implementation may choose to compare 2-3 bits through an
1881 >> AND gate: are src & dest scalar? Yep, ok send straight to ALU (or instr
1884 > Those bits cannot be known until after the registers are decoded from the
1885 > instruction and a lookup in the "vector length table" has completed.
1886 > Considering that one of the reasons RISC-V keeps registers in invariant
1887 > positions across all instructions is to simplify register decoding, I expect
1888 > that inserting an SRAM read would lengthen the critical path in most
1893 > briefly: the trick i mentioned about ANDing bits together to check if
1894 > an op was fully-scalar or not was to be read out of a single 32-bit
1895 > 3R1W SRAM (64-bit if FPU exists). the 32/64-bit SRAM contains 1 bit per
1896 > register indicating "is register vectorised yes no". 3R because you need
1897 > to check src1, src2 and dest simultaneously. the entries are *generated*
1898 > from the CSRs and are an optimisation that on slower embedded systems
1899 > would likely not be needed.
1901 > is there anything unreasonable that anyone can foresee about that?
1902 > what are the down-sides?
1904 ## C.MV predicated src, predicated dest
1906 > Can this be usefully defined in such a way that it is
1907 > equivalent to vector gather-scatter on each source, followed by a
1908 > non-predicated vector-compare, followed by vector gather-scatter on the
1911 ## element width conversion: restrict or remove?
1913 summary: don't restrict / remove. it's fine.
1915 > > it has virtually no cost/overhead as long as you specify
1916 > > that inputs can only upconvert, and operations are always done at the
1917 > > largest size, and downconversion only happens at the output.
1919 > okaaay. so that's a really good piece of implementation advice.
1920 > algorithms do require data size conversion, so at some point you need to
1921 > introduce the feature of upconverting and downconverting.
1923 > > for int and uint, this is dead simple and fits well within the RVV pipeline
1924 > > without any critical path, pipeline depth, or area implications.
1926 <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/g3feFnAoKIM>
1928 ## Implementation Paradigms <a name="implementation_paradigms"></a>
1930 TODO: assess various implementation paradigms. These are listed roughly
1931 in order of simplicity (minimum compliance, for ultra-light-weight
1932 embedded systems or to reduce design complexity and the burden of
1933 design implementation and compliance, in non-critical areas), right the
1934 way to high-performance systems.
1936 * Full (or partial) software-emulated (via traps): full support for CSRs
1937 required, however when a register is used that is detected (in hardware)
1938 to be vectorised, an exception is thrown.
1939 * Single-issue In-order, reduced pipeline depth (traditional SIMD / DSP)
1940 * In-order 5+ stage pipelines with instruction FIFOs and mild register-renaming
1941 * Out-of-order with instruction FIFOs and aggressive register-renaming
1944 Also to be taken into consideration:
1946 * "Virtual" vectorisation: single-issue loop, no internal ALU parallelism
1947 * Comphrensive vectorisation: FIFOs and internal parallelism
1948 * Hybrid Parallelism
1950 ### Full or partial software-emulation
1952 The absolute, absolute minimal implementation is to provide the full
1953 set of CSRs and detection logic for when any of the source or destination
1954 registers are vectorised. On detection, a trap is thrown, whether it's
1955 a branch, LOAD, STORE, or an arithmetic operation.
1957 Implementors are entirely free to choose whether to allow absolutely every
1958 single operation to be software-emulated, or whether to provide some emulation
1959 and some hardware support. In particular, for an RV32E implementation
1960 where fast context-switching is a requirement (see "Context Switch Example"),
1961 it makes no sense to allow Vectorised-LOAD/STORE to be implemented as an
1962 exception, as every context-switch will result in double-traps.
1966 > For great floating point DSPs check TI’s C3x, C4X, and C6xx DSPs
1968 Idea: basic simple butterfly swap on a few element indices, primarily targetted
1969 at SIMD / DSP. High-byte low-byte swapping, high-word low-word swapping,
1970 perhaps allow reindexing of permutations up to 4 elements? 8? Reason:
1971 such operations are less costly than a full indexed-shuffle, which requires
1972 a separate instruction cycle.
1974 Predication "all zeros" needs to be "leave alone". Detection of
1975 ADD r1, rs1, rs0 cases result in nop on predication index 0, whereas
1976 ADD r0, rs1, rs2 is actually a desirable copy from r2 into r0.
1977 Destruction of destination indices requires a copy of the entire vector
1978 in advance to avoid.
1980 TBD: floating-point compare and other exception handling
1984 * SIMD considered harmful <https://www.sigarch.org/simd-instructions-considered-harmful/>
1985 * Link to first proposal <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/GuukrSjgBH8>
1986 * Recommendation by Jacob Bachmeyer to make zero-overhead loop an
1987 "implicit program-counter" <https://groups.google.com/a/groups.riscv.org/d/msg/isa-dev/vYVi95gF2Mo/SHz6a4_lAgAJ>
1988 * Re-continuing P-Extension proposal <https://groups.google.com/a/groups.riscv.org/forum/#!msg/isa-dev/IkLkQn3HvXQ/SEMyC9IlAgAJ>
1989 * First Draft P-SIMD (DSP) proposal <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/vYVi95gF2Mo>
1990 * B-Extension discussion <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/zi_7B15kj6s>
1991 * Broadcom VideoCore-IV <https://docs.broadcom.com/docs/12358545>
1992 Figure 2 P17 and Section 3 on P16.
1993 * Hwacha <https://www2.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-262.html>
1994 * Hwacha <https://www2.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-263.html>
1995 * Vector Workshop <http://riscv.org/wp-content/uploads/2015/06/riscv-vector-workshop-june2015.pdf>
1996 * Predication <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/XoP4BfYSLXA>
1997 * Branch Divergence <https://jbush001.github.io/2014/12/07/branch-divergence-in-parallel-kernels.html>
1998 * Life of Triangles (3D) <https://jbush001.github.io/2016/02/27/life-of-triangle.html>
1999 * Videocore-IV <https://github.com/hermanhermitage/videocoreiv/wiki/VideoCore-IV-3d-Graphics-Pipeline>
2000 * Discussion proposing CSRs that change ISA definition
2001 <https://groups.google.com/a/groups.riscv.org/forum/#!topic/isa-dev/InzQ1wr_3Ak>
2002 * Zero-overhead loops <https://pdfs.semanticscholar.org/dbaa/66985cc730d4b44d79f519e96ec9c43ab5b7.pdf>
2003 * Multi-ported VLIW Register File Implementation <https://ce-publications.et.tudelft.nl/publications/1517_multiple_contexts_in_a_multiported_vliw_register_file_impl.pdf>
2004 * Fast context save/restore proposal <https://groups.google.com/a/groups.riscv.org/d/msgid/isa-dev/57F823FA.6030701%40gmail.com>
2005 * Register File Bank Cacheing <https://www.princeton.edu/~rblee/ELE572Papers/MultiBankRegFile_ISCA2000.pdf>
2006 * Expired Patent on Vector Virtual Memory solutions
2007 <https://patentimages.storage.googleapis.com/fc/f6/e2/2cbee92fcd8743/US5895501.pdf>
2008 * Discussion on RVV "re-entrant" capabilities allowing operations to be
2009 restarted if an exception occurs (VM page-table miss)
2010 <https://groups.google.com/a/groups.riscv.org/d/msg/isa-dev/IuNFitTw9fM/CCKBUlzsAAAJ>
2011 * Dot Product Vector <https://people.eecs.berkeley.edu/~biancolin/papers/arith17.pdf>
2012 * RVV slides 2017 <https://content.riscv.org/wp-content/uploads/2017/12/Wed-1330-RISCVRogerEspasaVEXT-v4.pdf>
2013 * Wavefront skipping using BRAMS <http://www.ece.ubc.ca/~lemieux/publications/severance-fpga2015.pdf>
2014 * Streaming Pipelines <http://www.ece.ubc.ca/~lemieux/publications/severance-fpga2014.pdf>
2015 * Barcelona SIMD Presentation <https://content.riscv.org/wp-content/uploads/2018/05/09.05.2018-9.15-9.30am-RISCV201805-Andes-proposed-P-extension.pdf>
2016 * <http://www.ece.ubc.ca/~lemieux/publications/severance-fpga2015.pdf>
2017 * Full Description (last page) of RVV instructions
2018 <https://inst.eecs.berkeley.edu/~cs152/sp18/handouts/lab4-1.0.pdf>