Advanced Linux Programming Course And Training

About this course

Introduction - Objectives - Who You Are - The Linux Foundation - Linux Foundation Training - Course Registration

Preliminaries - Procedures - Things change in Linux - Linux Distributions - Kernel Versions - Kernel Sources and Use of git - Platforms - Documentation and Links

Kernel Architecture I - UNIX and Linux * - Monolithic and Micro Kernels - Object-Oriented Methods - Main Kernel Tasks - User-Space and Kernel-Space - Kernel Mode Linux *

 

Kernel Programming Preview - Error Numbers and Getting Kernel Output - Task Structure - Memory Allocation - Transferring Data between User and Kernel Spaces - Linked Lists - String to Number Conversions - Jiffies - Labs

Modules - What are Modules? - A Trivial Example - Compiling Modules - Modules vs Built-in - Module Utilities - Automatic Loading/Unloading of Modules - Module Usage Count - The module struct - Module Licensing - Exporting Symbols - Resolving Symbols ** - Labs

Kernel Architecture II - Processes, Threads, and Tasks - Process Context - Kernel Preemption - Real-Time Preemption Patch - Dynamic Kernel Patching - Run-time Alternatives * - Porting to a New Platform *

 

Kernel Initialization - Overview of System Initialization - System Boot - Das U-Boot for Embedded Systems**

Kernel Configuration and Compilation - Installation and Layout of the Kernel Source - Kernel Browsers - Kernel Configuration Files - Kernel Building and Makefiles - initrd and initramfs - Labs

 

System Calls - What are System Calls? - Available System Calls - How System Calls are Implemented - Adding a New System Call - Replacing System Calls from Modules - Labs

 

Kernel Style and General Considerations - Coding Style - kernel-doc * - Using Generic Kernel Routines and Methods - Making a Kernel Patch - sparse - Using likely() and unlikely() - Writing Portable Code, CPU, 32/64-bit, Endianness - Writing for SMP - Writing for High Memory Systems - Power Management - Keeping Security in Mind - Mixing User- and Kernel-Space Headers * - Labs

 

Race Conditions and Synchronization Methods - Concurrency and Synchronization Methods - Atomic Operations - Bit Operations - Spinlocks - Seqlocks - Disabling Preemption - Mutexes - Semaphores - Completion Functions - Read-Copy-Update (RCU) - Reference Counts - Labs

 

SMP and Threads - SMP Kernels and Modules - Processor Affinity - CPUSETS - SMP Algorithms - Scheduling, Locking, etc. - Per-CPU Variables ** - Labs

 

Processes - What are Processes? - The task_struct - Creating User Processes and Threads - Creating Kernel

 

Threads - Destroying Processes and Threads - Executing User-Space Processes From Within the Kernel - Labs

Process Limits and Capabilities ** - Process Limits - Capabilities - Labs

 

Monitoring and Debugging - Debuginfo Packages - Tracing and Profiling - sysctl - SysRq Key - oops Messages - Kernel Debuggers - debugfs - Labs

 

Scheduling Basics - Main Scheduling Tasks - SMP - Scheduling Priorities - Scheduling System Calls - The 2.4 schedule() Function - O(1) Scheduler - Time Slices and Priorities - Load Balancing - Priority Inversion and Priority Inheritance ** - Labs

 

Completely Fair Scheduler (CFS) - The CFS Scheduler - Calculating Priorities and Fair Times - Scheduling Classes - CFS Scheduler Details - Labs

 

Memory Addressing - Virtual Memory Management - Systems With no MMU - Memory Addresses - High and Low Memory - Memory Zones - Special Device Nodes - NUMA - Paging - Page Tables - page structure - Kernel Samepage Merging (KSM) ** - Labs

 

Huge Pages - Huge Page Support - libhugetlbfs - Transparent Huge Pages - Labs

Memory Allocation - Requesting and Releasing Pages - Buddy System - Slabs and Cache Allocations - Memory Pools - kmalloc() - vmalloc()- Early Allocations and bootmem() - Memory Defragmentation - Labs

Process Address Space - Allocating User Memory and Address Spaces - Locking Pages - Memory Descriptors and

Regions - Access Rights - Allocating and Freeing Memory Regions - Page Faults - Labs

 

Disk Caches and Swapping - Caches - Page Cache Basics - What is Swapping? - Swap Areas - Swapping Pages In and Out - Controlling Swappiness - The Swap Cache - Reverse Mapping ** - OOM Killer - Labs

Device Drivers** - Types of Devices - Device Nodes - Character Drivers - An Example - Labs

 

Signals - What are Signals? - Available Signals - System Calls for Signals - Sigaction - Signals and Threads - How the Kernel Installs Signal Handlers - How the Kernel Sends Signals - How the Kernel Invokes Signal Handlers - Real Time Signals - Labs

 

** These sections may be considered in part or in whole as optional. They contain either background reference material, specialized topics, or advanced subjects. The instructor may choose to cover or not cover them depending on classroom experience and time constraints

Course Details
 
  • Duration: 40 hrs

  • hours effort: 0 hours per week

  • Price With GST: 17700/-​

  • Subject: Embedded Systems

  • Level: beginner

Prerequisites​

Basic knowledge of microcontrollers and its architecture strong skills on C programming and troubleshooting, understanding of digital & Analog input/output, protocols like UART, SPI, I2C.

​​

Marathahalli Office:

Real Time Signals Technologies Private Limited

#102, Krishna Grand, Over Marathahalli Bridge,

Bangalore, Karnataka, India 560037

BTM office:

Real Time Signals Technologies Private Limited,

#4, 2nd Floor, 1st phase, 2nd Stage, BTM Layout,

Opposite to Udupi Garden,

Bangalore-76, bengaluru, Karnataka, 560076

Whitefield office:

Real Time Signals Technologies Private Limited,

#1906, Brigade Metropolis,

Mahadevpura,

Bengaluru, Karnataka, 560048

Belgium Europe office:

Real Time Signals Technologies,

Hemelstraat 42, 2018 Antwerpen

Belgium, Europe

Thane Office:

Real Time Signals Technologies Private Limited,

#202, GARDEN ENCLAVES BLDG NO1,

VASANT VIHAR,

THANE 400607, MAHARASHTRA, India 

 

 © 2014-2018 by Real Time Signals Technologies. All Rights Reserved.