solaris 10 operating systems internals

qa ltd.
aberdeen, birmingham, bristol, edinburgh, exeter, glasgow, leeds, london, manchester, slough, united kingdom

Course Format: Classroom | E-learning | Virtual Class | Online | On-site | Blended | Self-paced

Course Description:

'' the solaris 10 operating system internals course provides students with information about the various kernel subsystems, routines, and structures that make up the solaris 10 operating system. students will use solaris dynamic tracing (dtrace) to step through process creation, execution, signal delivery, and scheduling, correlating observations with source code available through opensolaris. the labs make extensive use of dtrace,kmdb, and mdb commands to examine the system structures on live systems. the labs also make use of opensolaris web access to facilitate understanding how the operating system works. the kernel subsystems covered include the multithreaded architecture, virtual memory, scheduling, process lifetime, signal management, the vnode layer, and file systems such as ufs, zfs and swapfs.

who can benefit
students who can benefit from this course are programmers, system engineers, advanced system administrators, and support personnel.

prerequisites
to get the most value from this course, students should be able to read c programs and explain the meaning of a = (struct foo *) b and int func(int). delegates should also be able to understand and be able to explain the concept of pointers, structures, unions, link lists, hashing, and binary trees

delegates will learn how to
explain step-by-step how a lock is acquired
discuss the reason for priority inheritance and its implementation
identify the steps performed in a virtual to physical memory address translation
list the process structures and routines needed to implement a scheduling class
list the process structures used to implement multiple scheduling classes and the fields in the time-sharing and real-time dispatch parameter tables
describe the paging and swapping algorithms that manage physical memory as a cache
describe process creation, execution, and termination
discuss kernel thread scheduling and preemption
use kmdb, mdb, and dtrace to locate and display the system structures for an open file in a given process, such as the file descriptor, file structure, vnode structure, inode structure, page structure, and superblock
describe the placement policies that the unix® file system (ufs) uses to place inodes and blocks of data
course outline


module 1 �introducing the solaris 10 operating system

define the purpose of the operating system and explain the concept of kernel layering
explain and diagram the segments that make up the process address space
explain the trap mechanism
differentiate between hardware and software interrupts
list the new features in recent releases of the solaris 10 os
start using tools such as mdb, kmdb, and dtrace to examine kernel data structures
start using http://cvs.opensolaris.org/source/ to examine the source code
module 2 �multithread architecture

explain the difference between symmetrical multiprocessing (smp) and asymmetrical multiprocessing (asmp)
define an application and a kernel thread
define a lightweight process (lwp)
explain the difference between a thread and an lwp
list the structures that describe the state of a kernel thread, an lwp, and a process
explain how a mutex lock works
define a condition variable
describe how a counting semaphore is implemented
explain how a multiple-reader, single-writer lock works
explain the advantages of multiple lwps for a given process
module 3 �hardware memory management

describe how the mmu tables are used to perform virtual-to- physical address translation
list the differences between the x86/x64 memory management unit (mmu) and the sfmmu
describe types of cache implemented on sun systems
explain the purpose of the hardware address translation (hat) layer
module 4 �software memory management

list the layers of the sunos 5.x software virtual memory (vm) system and define the role of each layer
list the mapping structures that make up process address space
locate the page structures and process address space structures in mdb or dtrace and identify the fields within the structures
explain how the memory mapping and memory control system calls can be used by an application programmer to effectively manage process memory needs
module 5 �paging and swapping

explain the layered approach to page-fault handling
list the conditions under which the page daemon runs
list the functions of the page daemon
list the conditions under which the swapper runs
module 6 �the swapfs file system

list the shortcomings of sunos 4.x swap management
describe the changes that were made to the anonymous memory layer to accommodate the implementation of the swapfs file system
list two advantages obtained by adding the swapfs file system to the sunos 5.x
module 7 �scheduling

list at least two major barriers to real-time processing in the traditional unix architectures, such as system v release 3 (svr3), the 4.3 berkeley software design version of unix (bsd), and sunos 4.x software
explain the difference between a fully preemptible kernel and a kernel with preemption points
list a routine used to place a thread on a dispatch queue
describe when a thread is placed at the head of a dispatch queue
describe how the sleep queues are ordered
define a user-level preemption
define a kernel-level preemption
define deterministic dispatch latency
define priority inversion
module 8 �process lifetime

explain the differences among the system calls used toa new process
describe the kernel routines used to implement process creation
list the different types of executables supported in the solaris 10 os
explain the routines used to implement executable and linking format (elf) executables
list the advantages of the elf executable format
describe the actions taken by a process when it exits
explain the waitid(2) system call and how it is implemented
module 9 �signals

list the different types of signals that can be delivered to a process or thread
explain the difference between a trap signal and an interrupt signal
list the signal management routines and describe their functions
describe what the signal facility is for, and how a signal is delivered
module 10 �file systems

describe the vnode interface layer to a file system
list the four fields in a directory entry
explain the advantages of the 4.3 bsd file system
describe the function of the superblock and cylinder group structures
list the fields in the disk inode structure and explain how they are used
name the routines involved in determining the global placement policies
explain the allocation routines using the flowcharts and describe how the fragments are located quickly ...''

Elements of this syllabus are subject to change.

Phone:0844 871 2080

School Address:

tel: 0844 871 2080
e-mail us: info@qa.com

Jobs & Resumes: aberdeen, birmingham, bristol, edinburgh, exeter, glasgow, leeds, london, manchester, slough
Houses & Roommates: aberdeen, birmingham, bristol, edinburgh, exeter, glasgow, leeds, london, manchester, slough
Travel Agencies: birmingham, bristol, edinburgh, leeds, london, manchester,

Search other schools for solaris 10 operating systems internals training resources.

sun management center 3.6
Sun SeeBeyond eGate Integrator 4.5.x
sun java caps 6
Solaris 9 Operating System
Dynamic Performance Tuning and Troubleshooting with DTrace
Enterprise Intrusion Analysis
crash dump analysis and the sunos kernel
Personalising Security on the Solaris Operating System
Solaris 10 Containers
Solaris 10 ZFS
solaris volume manager
Sun StorEdge Enterprise Backup 7.x
Sun Systems Fault Analysis
Solaris 10 Operating System
unix essentials featuring the solaris 10 operating system
LDAP as a Naming Service
storage area networks
Sun Cluster 3.2

Notice: The course description on this page was captured from the Internet as historical reference or submitted by visitors. It was archived statically and not updated from day to day.
 

Tips: Try the search form on top of each page to find the latest course information, using course topic and location as keywords. Keep the course topic keyword short to get more results.