TAMS / Java / Hades / applets: contents | previous | next | ||||
Hades Applets contents visual index introduction std_logic_1164 gatelevel circuits delay models flipflops adders and arithm... counters LFSR and selftest memories programmable logic state-machine editor misc. demos I/O and displays DCF-77 clock relays (switch-le... CMOS circuits (sw... RTLIB logic RTLIB registers Prima processor D*CORE MicroJava Pic16 cosimulation Mips R3000 cosimu... Intel MCS4 (i4004) image processing ... [Sch04] Codeumsetzer [Sch04] Addierer [Sch04] Flipflops [Sch04] Schaltwerke [Sch04] RALU, Min... [Fer05] State-Mac... [Fer05] PIC16F84/... [Fer05] Miscellan... [Fer05] Femtojava adder factorial calculator Multicycle F... Bubblesort Insertion-sort Quicksort Pipelined Fe... quicksort (p... FreeTTS | Femtojava processor: quicksort demo
Circuit Description
This applet demonstrates the Quicksort Algorithm
running on the Femtojava Multicycle Processor.
Please see the
Femtojava overview page
for details about the RT-level hardware structure
and the design flow and tools.
The applet directly loads the quicksort algorithm into the program ROM and some initial (unsorted) data into the main memory RAM. Again, the binary memory data dumps (mif files for RAM and ROM) were generated using the Sashimi Tool. Now, you can start the simulation. If you want that the simulation runs automatic, just turn on the auto_clock, otherwise, you can control the clocks just clicking in manual_clock button. The sort program needs about 5800 cicles to finish. The result can be found in the RAM memory, starting at address 20.
| |||
Print version | Run this demo in the Hades editor (via Java WebStart) | ||||
Usage | FAQ | About | License | Feedback | Tutorial (PDF) | Referenzkarte (PDF, in German) | ||||
Impressum | http://tams.informatik.uni-hamburg.de/applets/hades/webdemos/96-femtojava/caco/quicksort.html |