Difference between revisions of "Fall 2019 SPO600 Weekly Schedule"
Chris Tyler (talk | contribs) |
Chris Tyler (talk | contribs) |
||
| Line 231: | Line 231: | ||
* Blog your results to [[SPO600 Algorithm Selection Lab|Lab 4]] | * Blog your results to [[SPO600 Algorithm Selection Lab|Lab 4]] | ||
| + | |||
| + | == Week 5 == | ||
=== Week 5 - Class I === | === Week 5 - Class I === | ||
Revision as of 12:38, 1 October 2019
This is the schedule and main index page for the SPO600 Software Portability and Optimization course for Fall 2019.
This SPO600 weekly schedule will be updated as the course proceeds - dates and content are subject to change. The cells in the summary table will be linked to relevant resources and labs as the course progresses.
Contents
Schedule Summary Table
This is a summary/index table. Please follow the links in each cell for additional detail which will be added below as the course proceeds -- especially for the Deliverables column.
Evaluation
| Category | Percentage | Evaluation Dates |
|---|---|---|
| Communication | 20% | September (5%), October (5%), November (5%), end of course (5%). |
| Quizzes | 10% | May be held during any class, usually at the start of class. A minimum of 5 one-page quizzes will be given. No make-up/retake option is offered if you miss a quiz. Lowest 3 scores will not be counted. Students with Test Centre accommodations may choose to write the quizzes in the class, or alternately write a monthly quiz in the Test Center. |
| Labs | 10% | See deliverables column above. All labs must be submitted by the end of the course, but it is best if you stay on top of the labs and submit according to the table above. |
| Project work | 60% | 3 stages: 15% (Nov 1), 20% (Nov 22), 25% (Dec 11). |
Week 1
Week 1 - Class I
Introduction to the Problems
Porting and Portability
- Most software is written in a high-level language which can be compiled into machine code for a specific computer architecture. In many cases, this code can be compiled for multiple architectures. However, there is a lot of existing code that contains some architecture-specific code fragments written in architecture-specific high-level code or in Assembly Language.
- Reasons that code is architecture-specific:
- System assumptions that don't hold true on other platforms
- Variable or word size
- Endianness
- Code that takes advantage of platform-specific features
- System assumptions that don't hold true on other platforms
- Reasons for writing code in Assembly Langauge include:
- Performance
- Atomic Operations
- Direct access to hardware features, e.g., CPUID registers
- Most of the historical reasons for including assembler are no longer valid. Modern compilers can out-perform most hand-optimized assembly code, atomic operations can be handled by libraries or compiler intrinsics, and most hardware access should be performed through the operating system or appropriate libraries.
- A new architecture has appeared: AArch64, which is part of ARMv8. This is the first new computer architecture to appear in several years (at least, the first mainstream computer architecture).
- At this point, most key open source software (the software typically present in a Linux distribution such as Ubuntu or Fedora, for example) now runs on AArch64. However, it may not run as well as on older architectures (such as x86_64).
Benchmarking and Profiling
Benchmarking involves testing software performance under controlled conditions so that the performance can be compared to other software, the same software operating on other types of computers, or so that the impact of a change to the software can be gauged.
Profiling is the process of analyzing software performance on finer scale, determining resource usage per program part (typically per function/method). This can identify software bottlenecks and potential targets for optimization.
Optimization
Optimization is the process of evaluating different ways that software can be written or built and selecting the option that has the best performance tradeoffs.
Optimization may involve substituting software algorithms, altering the sequence of operations, using architecture-specific code, or altering the build process. It is important to ensure that the optimized software produces correct results and does not cause an unacceptable performance regression for other use-cases, system configurations, operating systems, or architectures.
The definition of "performance" varies according to the target system and the operating goals. For example, in some contexts, low memory or storage usage is important; in other cases, fast operation; and in other cases, low CPU utilization or long battery life may be the most important factor. It is often possible to trade off performance in one area for another; using a lookup table, for example, can reduce CPU utilization and improve battery life in some algorithms, in return for increased memory consumption.
Most advanced compilers perform some level of optimization, and the options selected for compilation can have a significant effect on the trade-offs made by the compiler, affecting memory usage, execution speed, executable size, power consumption, and debuggability.
Build Process
Building software is a complex task that many developers gloss over. The simple act of compiling a program invokes a process with five or more stages, including pre-proccessing, compiling, optimizing, assembling, and linking. However, a complex software system will have hundreds or even thousands of source files, as well as dozens or hundreds of build configuration options, auto configuration scripts (cmake, autotools), build scripts (such as Makefiles) to coordinate the process, test suites, and more.
The build process varies significantly between software packages. Most software distribution projects (including Linux distributions such as Ubuntu and Fedora) use a packaging system that further wraps the build process in a standardized script format, so that different software packages can be built using a consistent process.
In order to get consistent and comparable benchmark results, you need to ensure that the software is being built in a consistent way. Altering the build process is one way of optimizing software.
Note that the build time for a complex package can range up to hours or even days!
General Course Information
- Course resources are linked from the CDOT wiki, starting at https://wiki.cdot.senecacollege.ca/wiki/SPO600 (Quick find: This page will usually be Google's top result for a search on "SPO600").
- Coursework is submitted by blogging.
- Quizzes will be short (1 page) and will be held without announcement at any time, generally at the start of class. There is no opportunity to re-take a missed quiz, but your lowest three quiz scores will not be counted, so do not worry if you miss one or two.
- Students with test accommodations: an alternate monthly quiz is available in the Test Centre. See the professor for details.
- Course marks (see Weekly Schedule for dates):
- 60% - Project Deliverables
- 20% - Communication (Blog and Wiki writing)
- 20% - Labs and Quizzes (10% labs - completed/not completed; 10% for quizzes - lowest 3 scores not counted)
- All classes will be held in an Active Learning Classroom -- you are encouraged to bring your own laptop to class. If you do not have a laptop, consider signing one out of the Learning Commons for class, or using a smartphone with an HDMI adapter.
- For more course information, refer to the SPO600 Weekly Schedule (this page), the Course Outline, and SPO600 Course Policies.
Course and Setup: Accounts, agreements, servers, and more
- SPO600 Communication Tools
- Fall 2019 SPO600 Participants page
- Key generation for SSH to the SPO600 Servers.
How open source communities work
- Do the Code Review Lab (Lab 1) as homework.
Week 1 - Class II
- Compiler Operation
- Stages of Compilation
- Preprocessing
- Compiling
- Assembling
- Linking
- Stages of Compilation
- Analyzing compiler output
- Disassembly
- Compiled C Lab (Lab 2)
Week 1 Deliverables
- Course setup:
- Set up your SPO600 Communication Tools - in particular, set up a blog and add it to Planet CDOT (via the Planet CDOT Feed List).
- Add yourself to the Current SPO600 Participants page (leave the projects columns blank).
- Generate a pair of keys for SSH and email the public key to your professor, so that he can set up your access to the class servers.
- Optional (strongly recommended): Set up a personal Linux system.
- Optional: Purchase an AArch64 development board (such as a 96Boards HiKey or Raspberry Pi 3 or 4. (If you use a Pi, install a 64-bit Linux operating system on it, not a 32-bit version).
- Complete Lab 1 and write it up on your blog.
Week 2
Week 2 - Class I
Week 2 - Class II
- Assembler Lab (Lab 3)
Week 2 Deliverables
- Blog your results and conclusion to Code Review Lab (Lab 1) and Compiled C Lab (Lab 2)
- Blog about your initial work on Lab 3.
- Set up your account on the Seneca Open Source Slack Workspace.
Week 3
Week 3 - Class I
- Sysadmin for Devs
- In-class discussion of tips and tricks for efficient work on a Linux server
Week 3 - Class II
- Finish Lab 3
Week 3 - Deliverables
- Finish and blog your detailed results for the Assembler Lab (Lab 3)
Week 4
Week 4 - Class I
- Binary Representation of Data
- Integers
- Integers are the basic building block of binary numbers.
- In an unsigned integer, the bits are numbered from right to left starting at 0, and the value of each bit is
2bit. The value represented is the sum of each bit multiplied by its corresponding bit value. The range of an unsigned integer is0:2bits-1where bits is the number of bits in the unsigned integer. - Signed integers are generally stored in twos-complement format, where the highest bit is used as a sign bit. If that bit is set, the value represented is
-(!value)-1where ! is the NOT operation (each bit gets flipped from 0→1 and 1→2)
- Fixed-point
- A fixed-point value is encoded the same as an integer, except that some of the bits are fractional -- they're considered to be to the right of the "binary point" (binary version of "decimal point" - or more generically, the radix point). For example, binary 000001.00 is decimal 1.0, and 000001.11 is decimal 1.75.
- An alternative to fixed-point values is integer values in a smaller unit of measurement. For example, some accounting software may use integer values representing cents. For input and display purposes, dollar and cent values are converted to/from cent values.
- Floating-point
- Floating point numbers have three parts: a sign bit (0 for positive, 1 for negative), a mantissa or significand, and an exponent. The value is interpreted as
sign mantissa * 2exponent.
- Floating point numbers have three parts: a sign bit (0 for positive, 1 for negative), a mantissa or significand, and an exponent. The value is interpreted as
- Sound
- Graphics
- Compression techniques
- Huffman encoding / Adaptive arithmetic encoding
- Repeated sequence encoding (1D, 2D, 3D)
- Decomposition
- Pallettization
- Psychoacoustic and psychovisual compression
- Integers
- Problem: Scaling Sound
- Naive approach
- Lookup table
- Fixed-point multiply and shift
Week 4 - Class II
- Algorithm Selection Lab (Lab 4)
Week 4 Deliverables
- Blog your results to Lab 4
Week 5
Week 5 - Class I
- SIMD and Auto-vectorization
- Inline Assembler
- C Intrinsics
- Vectorization Lab (Optional lab - recommended)
Week 5 - Class II
- SPO600 SIMD Labj (Lab 5)
Week 5 Deliverables
- Blog about the SIMD Lab
