5 ms·
Ripes: Visual computer architecture simulator, assembly code editor for RISC-V
- gkhartman 4y agoThis is the tool I needed while taking the computer architecture series in college. An animated simulation would have gotten me up to speed much faster. Working through each instruction using a pencil and paper was a slow process that would have been more beneficial after seeing a simulation run a few times.
- photonbeam 4y agoThis looks great! Would be interesting to make custom processor models for this
- lizardactivist 4y agoWow.. there's just one principal author who has written almost all of it. Very impressive!
- mvdwoord 4y agoThis is super cool! I have not had time yet to play with it properly but just running some sample code and watching the animated stepping is insanely nice and very educational! Thanks.
- mncharity 4y agoMight one do a cache-aware code competition? Given the simulator's determinism and cache. As attention to cache-friendly data layout seems often lagging its importance ... err, and the world doesn't yet have enough premature optimization. Implement this algorithm; it will be challenged with <large n> input sets; here is a training set generator; your competition set runtimes will be aggregated with <metric>; minimize it. Does anything like this exist already?
- zozbot234 4y agoCache-oblivious code is a lot more successful in the real world, because systems change over time. Hardwiring code to rely on a rigidly predefined amount of cache is the worst kind of premature optimization.
- binarycrusader 4y agoIsn’t “a lot more successful” is only true more generally? Many developers have fixed platform targets for the life of a product (e.g., consoles, embedded, microarch). So I’d agree in general but hesitate to say “a lot more successful”.
- mncharity 4y agoSo the concern is overfitting to a single target? Hmm, then perhaps: here are several/parameterized cache models to develop on; one/several will be used to judge the competition? > Cache-oblivious code is a lot more successful [...] Hardwiring code to rely on a rigidly predefined amount of cache is the worst Yes, but ... Creating cache-oblivious code requires devs non-oblivious to cache. Perhaps a kata/competition might encourage such.
- user062 4y agocheckout the cache lab [1] [1] https://csapp.cs.cmu.edu/3e/labs.html https://csapp.cs.cmu.edu/3e/labs.html
- mncharity 4y ago> https://csapp.cs.cmu.edu/3e/labs.html https://csapp.cs.cmu.edu/3e/labs.html Accessing cachelab.tar there regrettably requires login. Also on https://csapp.cs.cmu.edu/public/labs.html https://csapp.cs.cmu.edu/public/labs.html . Though the other Cache Lab links work. But googling "cachelab" currently turns up similar elsewhere. And a few students' solutions. Tnx!
- user062 4y agoYou're welcome, the self-study handout [1] doesn't require login. [1] http://csapp.cs.cmu.edu/3e/cachelab-handout.tar http://csapp.cs.cmu.edu/3e/cachelab-handout.tar
- thethirdone 4y agoAs someone in the risc-v education space, it has been very cool to see RIPES develop. It seems like I blinked and it gained a lot of features. It gives you the most information about how a program might run. If you would rather focus on the software and you want to try learning risc-v assembly, I would recommend the simulator I made https://github.com/TheThirdOne/rars https://github.com/TheThirdOne/rars .
- jll29 4y agoThis is great for teaching, thanks for sharing!
- pjmlp 4y agoGreat tool and kudos for it being native.