The Design of the UNIX Operating System
This is the first, and still, the most comprehensive book to describe the sophisticated workings of the UNIX System V kernel--the internal algorithms, the structures that form the basis of the UNIX operating system, and their relationship to the programming interface. System programmers will gain a better understanding of how the kernel works and will be able to compare algorithms used in the UNIX system to algorithms used in other operating systems. Programmers on UNIX systems will gain a deeper understanding of how their programs interact with the system and can thereby code more efficient programs.
48 pages matching page table in this book
Results 1-3 of 48
What people are saying - Write a review
INTRODUCTION TO THE KERNEL
THE BUFFER CACHE
INTERNAL REPRESENTATION OF FILES
9 other sections not shown
addr algorithm algorithm iput block number buffer cache byte offset Chapter char child process clist command contains context layer context switch copy copy on write creates current directory data structures demand paging described disk block example exec executable file exit file descriptor file name file system file table entry free inodes free list function hardware hash queue header implementation increments inode number input interface interrupt handler invokes kernel allocates kernel mode line discipline linked list lock loop machine mount open system call output page table parameters parent process path name permission physical memory pointer priority process executes process sleeps process table processor program in Figure reference count region table regular file remote satellite process scheduling Section semaphore setuid shared memory shell signal super block superuser swap device swapper text region UNIX system unlink user file descriptor user mode waiting write
Real-time Systems and Programming Languages: Ada 95, Real-time Java, and ...
Alan Burns,Andrew J. Wellings
No preview available - 2001
All Book Search results »