Difference between revisions of "SPO600 Inline Assembler Lab"

From CDOT Wiki
Jump to: navigation, search
(Part B - Individual Task)
(Part A - Class Lab)
Line 14: Line 14:
 
=== Part A - Class Lab ===
 
=== Part A - Class Lab ===
  
1. Write a version of the Volume Scaling solution from the [[SPO600 Algorithm Selection Lab|Algorithm Selection Lab]] for AArch64 that uses the SQDMULH or SQRDMULH instructions via inline assembler.
+
1. Here is a version of the volume scaling problem from the [[SPO600 Algorithm Selection Lab|Algorithm Selection Lab]] for AArch64: [http://matrix.senecacollege.ca/~chris.tyler/spo600/spo600_20173_inline_assembler_lab.tgz spo600_20173_inline_assembler_lab.tgz]. Download, build, and verify the operation of this program on AArchie.
  
  
2. Test the performance of your solution and compare it to your previous solution(s).
+
2. Test the performance of this solution and compare it to your previous solution(s). Adjust the number of samples (in <code>vol.h</code>) to produce a measurable runtime, and adjust your code for comparable test conditions (number of samples, 1 array vs. 2 arrays, and so forth).
  
  
3. Blog about your results in detail, including your reflections.
+
3. Find the answers to the questions identified with "Q:" in the comments in the source code.
 +
 
 +
 
 +
4. Blog about your results in detail, including your reflections.
  
 
=== Part B - Individual Task ===
 
=== Part B - Individual Task ===

Revision as of 12:32, 29 November 2017

Lab icon.png
Purpose of this Lab
This lab is designed to explore the use of inline assembler, and its use in open source software.

Lab 7

References


Part A - Class Lab

1. Here is a version of the volume scaling problem from the Algorithm Selection Lab for AArch64: spo600_20173_inline_assembler_lab.tgz. Download, build, and verify the operation of this program on AArchie.


2. Test the performance of this solution and compare it to your previous solution(s). Adjust the number of samples (in vol.h) to produce a measurable runtime, and adjust your code for comparable test conditions (number of samples, 1 array vs. 2 arrays, and so forth).


3. Find the answers to the questions identified with "Q:" in the comments in the source code.


4. Blog about your results in detail, including your reflections.

Part B - Individual Task

Important.png
After Memory Architecture
Do this part of the lab after the class on Memory Architecture.

1. Select one of the following open source packages which is not claimed by another person in the class. Put your name beside it in (parenthesis) to claim it.

  • amule (Lawrence)
  • ardour (Ray Gervais)
  • avidemux(Shiv Gajiwala)
  • blender(Mohammed Maniar)
  • bunny (laily)
  • busybox (laily)
  • chicken
  • cln (Len)
  • coq
  • cxxtools
  • faad2
  • fawkes
  • gauche (Eugueni)
  • gmime
  • gnash
  • gridengine
  • groonga
  • hoard
  • iaxclient
  • k9copy
  • lame (Timothy Moy)
  • libfame
  • libgcroots
  • libmad
  • libmlx4
  • lightsparc
  • mediatomb
  • mjpegtools
  • mlt
  • mosh (John)
  • mpich2
  • ocaml-zarith
  • openblas(Andrey)
  • opencore-amr
  • openser
  • par2cmdline (Dang)
  • picprog
  • qlandkartegt
  • sooperlooper (Quang)
  • traverso


2. Find the assembler in that software, and determine:

  • How much assembley-language code is present
  • Which platform(s) it is used on
  • Why it is there (what it does)
  • What happens on other platforms
  • Your opinion of the value of the assembler code VS the loss of portability/increase in complexity of the code.


3. Blog your results in detail.