This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
haas:spring2024:comporg:projects:pnc0 [2024/03/13 13:10] – [PNC0] wedge | haas:spring2024:comporg:projects:pnc0 [2024/03/13 13:20] – [PNC1] wedge | ||
---|---|---|---|
Line 21: | Line 21: | ||
* display each N value and result in an arrangement on the screen that can be clearly identified and read by the viewer | * display each N value and result in an arrangement on the screen that can be clearly identified and read by the viewer | ||
* timing should go out, as reasonable, to a few decimal places, but should be consistent across all attempts. | * timing should go out, as reasonable, to a few decimal places, but should be consistent across all attempts. | ||
- | | + | * timing is on the computational process |
- | | + | |
* create a graph (using some external tool) that plots the performance of the C and assembly implementations working on identical workloads of this brute force algorithm according to the various N's and the time it took. Share your graph of your results on the class discord and on the project documentation page. | * create a graph (using some external tool) that plots the performance of the C and assembly implementations working on identical workloads of this brute force algorithm according to the various N's and the time it took. Share your graph of your results on the class discord and on the project documentation page. | ||
* a line graph is the suggested best candidate | * a line graph is the suggested best candidate | ||
- | * the assembly version is to be done entirely by hand, and make zero use of C API functions | + | * the assembly version is to be done entirely by hand, and make zero use of C API functions. Just the usual in/out stuff we've been doing. |
* this will not be an interactive program: it starts up, does its thing, outputs it results, then halts. | * this will not be an interactive program: it starts up, does its thing, outputs it results, then halts. | ||
- | * this brute force implementation is meant as our baseline. As such, it should not contain any optimizations or attempted improvements. As we progress through pnc1 and pnc2, these variants | + | * this brute force implementation is meant as our baseline. As such, it should not contain any optimizations or attempted improvements. As we progress through pnc1 and pnc2, this base implementation |
=====REFERENCE===== | =====REFERENCE===== | ||
Line 38: | Line 37: | ||
- | ====PNC1==== | ||
- | ===C implementation=== | ||
- | {{: | ||
=====EDIT===== | =====EDIT===== | ||
You will want to go [[/ | You will want to go [[/ |