Online training of Advanced Linux Programming

Advanced Linux Programming

Propelled Linux Programming is partitioned into two sections. The main spreads nonexclusive UNIX framework administrations, however with a specific eye towards Linux explicit data. This segment of the book will be useful even to cutting edge software engineers who have worked with other Linux frameworks since it will cover Linux explicit subtleties and contrasts.

Enroll Now
Online training of Advanced Linux Programming
Enquire more about the Course

About this course

What you'll learn

  • Objectives
  • Who You Are
  • The Linux Foundation
  • Linux Foundation Training
  • Course Registration
  • Procedures
  • Things change in Linux
  • Linux Distributions
  • Kernel Versions
  • Kernel Sources and Use of git
  • Platforms
  • Documentation and Links
  • UNIX and Linux
  • Monolithic and Micro Kernels
  • Object-Oriented Methods
  • Main Kernel Tasks
  • User-Space and Kernel-Space
  • Kernel Mode Linux
  • 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
  • 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
  • Processes, Threads, and Tasks
  • Process Context
  • Kernel Preemption
  • Real-Time Preemption Patch
  • Dynamic Kernel Patching
  • Run-time Alternatives
  • Porting to a New Platform
  • Overview of System Initialization
  • System Boot
  • Das U-Boot for Embedded Systems
  • Installation and Layout of the Kernel Source
  • Kernel Browsers
  • Kernel Configuration Files
  • Kernel Building and Makefiles
  • initrd and initramfs
  • What are System Calls?
  • Available System Calls
  • How System Calls are Implemented
  • Adding a New System Call
  • Replacing System Calls from Modules
  • 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
  • Kernel-Space Headers
  • Concurrency and Synchronization Methods
  • Atomic Operations
  • Bit Operations
  • Spinlocks
  • Seqlocks
  • Disabling Preemption
  • Mutexes
  • Semaphores
  • Completion Functions
  • Read-Copy-Update (RCU)
  • Reference Counts
  • SMP Kernels and Modules
  • Processor Affinity
  • CPUSETS
  • SMP Algorithms
  • Scheduling, Locking, etc
  • Per-CPU Variables
  • 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
  • Process Limits
  • Capabilities
  • Debuginfo Packages
  • Tracing and Profiling
  • sysctl
  • SysRq Key
  • oops Messages
  • Kernel Debuggers
  • debugfs
  • 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
  • The CFS Scheduler
  • Calculating Priorities and Fair Times
  • Scheduling Classes
  • CFS Scheduler Details
  • 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)
  • Huge Page Support
  • libhugetlbfs
  • Transparent Huge Pages
  • Requesting and Releasing Pages
  • Buddy System
  • Slabs and Cache Allocations
  • Memory Pools
  • kmalloc()
  • vmalloc()
  • Early Allocations and bootmem()
  • Memory Defragmentation
  • Allocating User Memory and Address Spaces
  • Locking Pages
  • Memory Descriptors and Regions
  • Access Rights
  • Allocating and Freeing Memory Regions
  • Page Faults
  • Caches
  • Page Cache Basics
  • What is Swapping?
  • Swap Areas
  • Swapping Pages In and Out
  • Controlling Swappiness
  • The Swap Cache
  • Reverse Mapping
  • OOM Killer
  • Types of Devices
  • Device Nodes
  • Character Drivers
  • 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
Enroll Now
Batches
Class Room Training
₹17,700+GST
Enroll Now
Online Live Classes
₹17,700+GST
Enroll Now
Self Paced Classes
₹17,700+GST
Enroll Now
Course Video
  • 1-Objectives
  • 2-Who You Are
  • 3- The Linux Foundation
  • 4-Linux Foundation Training
  • 5-Course Registration
  • 1-Procedures
  • 2-Things change in Linux
  • 3-Linux Distributions
  • 4-Kernel Versions
  • 5-Kernel Sources and Use of git
  • 6-Platforms
  • 7-Documentation and Links
  • 1-UNIX and Linux
  • 2-Monolithic and Micro Kernels
  • 3-Object-Oriented Methods
  • 4-Main Kernel Tasks
  • 5-User-Space and Kernel-Space
  • 6-Kernel Mode Linux
  • 1- Error Numbers and Getting Kernel Output
  • 2-Task Structure
  • 3- Memory Allocation
  • 4-Transferring Data between User and Kernel Spaces
  • 5-Linked Lists
  • 6-String to Number Conversions
  • 7-Jiffies
  • 1- What are Modules?
  • 2-A Trivial Example
  • 3-Compiling Modules
  • 4- Modules vs Built-in
  • 5-Module Utilities
  • 6-Automatic Loading/Unloading of Modules
  • 7-Module Usage Count
  • 8-The module struct
  • 9-Module Licensing
  • 10-Exporting Symbols
  • 11-Resolving Symbols
  • 1-Processes
  • 2- Threads, and Tasks
  • 3-Process Context
  • 4-Kernel Preemption
  • 5-Real-Time Preemption Patch
  • 6-Dynamic Kernel Patching
  • 7-Run-time Alternatives
  • 8-Porting to a New Platform
  • 1-Overview of System Initialization
  • 2- System Boot
  • 3-Das U-Boot for Embedded Systems
  • 1- Installation and Layout of the Kernel Source
  • 2- Kernel Browsers
  • 3-Kernel Configuration Files
  • 4-Kernel Building and Makefiles
  • 5-initrd and initramfs
  • 1- What are System Calls?
  • 2-Available System Calls
  • 3-How System Calls are Implemented
  • 4-Adding a New System Call
  • 5-Replacing System Calls from Modules
  • 1-Coding Style
  • 2-kernel-doc
  • 3-Using Generic Kernel Routines and Methods
  • 4-Making a Kernel Patch
  • 5-Sparse
  • 6-Using likely() and unlikely()
  • 7-Writing Portable Code
  • 8-CPU, 32/64-bit, Endianness
  • 9-Writing for SMP
  • 10-Writing for High Memory Systems
  • 11- Power Management
  • 12- Keeping Security in Mind
  • 13-Mixing User
  • 14-Kernel-Space Headers
  • 1-Concurrency and Synchronization Methods
  • 2-Atomic Operations
  • 3-Bit Operations
  • 4-Spinlocks
  • 5-Seqlocks
  • 6- Disabling Preemption
  • 7-Mutexes
  • 8-Semaphores
  • 9-Completion Functions
  • 10-Read-Copy-Update (RCU)
  • 11-Reference Counts
  • 1-SMP Kernels and Modules
  • 2-Processor Affinity
  • 3-CPUSETS
  • 4- SMP Algorithms
  • 5-Scheduling, Locking, etc
  • 6-Per-CPU Variables
  • 1-What are Processes?
  • 2-The task struct
  • 3- Creating User Processes and Threads
  • 4-Creating Kernel Threads
  • 5-Destroying Processes and Threads
  • 6-Executing User-Space Processes From Within the Kernel
  • 1-Process Limits
  • 2-Capabilities
  • 1-Debuginfo Packages
  • 2-Tracing and Profiling
  • 3-Sysctl
  • 4-SysRq Key - oops Messages
  • 5-Oops Messages
  • 6-Kernel Debuggers
  • 7-debugfs
  • 1-Main Scheduling Tasks
  • 2-SMP
  • 3-Scheduling Priorities
  • 4-Scheduling System Calls
  • 5-The 2.4 schedule() Function
  • 6- O(1) Scheduler
  • 7-Time Slices and Priorities
  • 8-Load Balancing
  • 9-Priority Inversion and Priority Inheritance
  • 1-The CFS Scheduler
  • 2-Calculating Priorities and Fair Times
  • 3-Scheduling Classes
  • 4-CFS Scheduler Details
  • 1-Virtual Memory Management
  • 2- Systems With no MMU
  • 3-Memory Addresses
  • 4-High and Low Memory
  • 5-Memory Zones
  • 6-Special Device Nodes
  • 7-NUMA
  • 8-Paging
  • 9- Page Tables
  • 10-Page structure
  • 11-Kernel Samepage Merging (KSM)
  • 1-Huge Page Support
  • 2-libhugetlbfs
  • 3-Transparent Huge Pages
  • 1-Requesting and Releasing Pages
  • 2-Buddy System
  • 3-Slabs and Cache Allocations
  • 4-Memory Pools
  • 5-kmalloc()
  • 6-vmalloc()
  • 7-Early Allocations and bootmem()
  • 8-Memory Defragmentation
  • 1-Allocating User Memory and Address Spaces
  • 2-Locking Pages
  • 3-Memory Descriptors and Regions
  • 4-Access Rights
  • 5- Allocating and Freeing Memory Regions
  • 6- Page Faults
  • 1-Caches
  • 2-Page Cache Basics
  • 3- What is Swapping?
  • 4- Swap Areas
  • 5- Swapping Pages In and Out
  • 6-Controlling Swappiness
  • 7-The Swap Cache
  • 8-Reverse Mapping
  • 9-OOM Killer
  • 1-Types of Devices
  • 2-Device Nodes
  • 3-Character Drivers
  • 1-What are Signals?
  • 2-Available Signals
  • 3-System Calls for Signals
  • 4-Sigaction
  • 5-Signals and Threads
  • 6-How the Kernel Installs Signal Handlers
  • 7-How the Kernel Sends Signals
  • 8-How the Kernel Invokes Signal Handlers
  • 9-Real Time Signals
Enroll Now
Advanced Linux Programming Free PDF Book:
Advantage
Certification
 
Customer Reviews
No Review For This Course