• Corpus ID: 14770168

Understanding the Linux Kernel

@inproceedings{Bovet2000UnderstandingTL,
  title={Understanding the Linux Kernel},
  author={Daniel P. Bovet and Marco Cassetti and Andrew Oram},
  year={2000}
}
In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions between the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn't kept waiting any longer than… 

Understanding the Linux Virtual Memory Manager

TLDR
This book describes VM in unprecedented detail, presenting both theoretical foundations and line-by-line source code commentary, systematically covering everything from physical memory description to out-of-memory management.

Comparative evaluation of the recent Linux and Solaris kernel architectures

TLDR
The paper concludes that both the Linux and the OpenSolaris kernel can offer robust and powerful computing environments both at the server application areas and as well at the desktop and workstation ones.

Encode Decode Linux based Partitions to Hide and Explore File System

TLDR
This work performs analysis on some tool that are Explore 2fs, DiskInternal Linux Reader, Ext2fsd to access Linux partition and security of Linux define based on efficiency of that tools.

The Linux Kernel: A Challenging Workload for Transactional Memory

TLDR
Issues about how an OS can take advantage of a transactional memory hardware system are raised.

LockDoc: Trace-Based Analysis of Locking in the Linux Kernel

TLDR
LockDoc is introduced -- an approach that, based on the analysis of execution traces of an instrumented Linux kernel, automatically deduces the most likely locking rule for all members of arbitrary kernel data structures and generates documentation that supports kernel developers and helps avoiding concurrency bugs.

Language support for Linux device driver programming

TLDR
This thesis analyses the root causes of the device driver rel iability problem, and demonstrates how the current driver programming model can be improved to a ssist programmers in creating better driver code.

Linux Support for Fast Transparent General Purpose Checkpoint/Restart of Multithreaded Processes in Loadable Kernel Module

TLDR
The design and implementation of multithreaded process checkpoint/restart system for Linux which provide capability of dynamic extension to increase compatibility and reduce system overhead is described.

SECURITY HARDENED KERNELS FOR LINUX SERVERS

TLDR
Detailed explanations of root causes for the exploits and various intrusion techniques used by an attacker, using exploit programs posted in security forums are offered and detailed explanations of the prevention techniques are explained.

Making Huge Pages Actually Useful

TLDR
Illuminator is presented, an efficient memory manager that provides various subsystems, such as the page allocator, the ability to track all unmovable pages, which allows subsystems to make informed decisions and eliminate unnecessary work which in turn leads to cost-effective huge page allocations.

Using Memory Allocation Schemes in Linux to Exploit DRAM Vulnerability: with Rowhammer as a Case Study

TLDR
It is shown that an adversary can force the kernel to allocate specific page frames to a victim process, running on the same CPU.
...

References

SHOWING 1-10 OF 15 REFERENCES

IA-64 Linux Kernel: Design and Implementation

TLDR
This book describes the hardware abstraction interfaces used by Linux and, finally, their IA-64 implementations, and believes that the interface descriptions in this book are among the most accurate and most comprehensive descriptions in existence.

UNIX systems for modern architectures - symmetric multiprocessing and caching for Kernel programmers

  • C. Schimmel
  • Education
    Addison-Wesley professional computing series
  • 1994
In what case do you like reading so much? What about the type of the unix systems for modern architectures symmetric multiprocessing and caching for kernel programmers book? The needs to read? Well,

The Indispensable PC Hardware Book

TLDR
The Indispensable PC Hardware Book 4/e will be 'indispensable' to anyone who wants to know more about the inner workings of a personal computer: from programmers who want access to hardware components; professionals and home-users who want to or has to understand the structure and functioning of apersonal computer.

Solaris Internals: Core Kernel Architecture

TLDR
Solaris Internals is an indispensable reference for kernel developers and is full of useful information for monitoring and optimizing Solaris systems.

UNIX Internals: The New Frontiers

TLDR
The Scope of This Book: Process Scheduling in MACH, the Digital UNIX Real-Time Scheduler, and other Considerations.

The Slab Allocator: An Object-Caching Kernel Memory Allocator

This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex

2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm

In a path-breaking paper last year Pat and Betty O’Neil and Gerhard Weikum pro posed a self-tuning improvement to the Least Recently Used (LRU) buffer management algorithm[l5]. Their improvement is

The magic garden explained - the internals of UNIX System V, release 4: an open systems design

TLDR
The internals of unix system v release 4 an open systems design can help you to solve the problem and can be one of the right sources to develop your writing skill.

The Design of the UNIX Operating System

TLDR
This document discusses the representation of processes in the distributed UNIX system, and some of the mechanisms used to achieve this representation are described.

Priority Search Trees

TLDR
A new data structure that is called a priority search tree, of which two variants are introduced, operations (1), (2), and (3) can be implemented in $O(\log n)$ time, where n is the cardinality of D.