Implementation and Use of Data Structures in Linux

ABSTRACT- This paper describes the abstract or conceptual software architecture of the Linux kernel. This level of architecture is concerned with the large-scale subsystems within the kernel, but not with particular procedures or variables. One of the purposes of such an abstract architecture is to form a mental model for Linux developers and architects. The model may not reflect the as-built architecture perfectly, but it provides a useful way to think about the overall structure. This model is most useful for entry-level developers, but is also a good way for experienced developers to maintain a consistent and accurate system vocabulary. The architecture presented here is the result of reverse engineering an existing Linux implementation; the primary sources of information used were the documentation and source code. Unfortunately, no developer interviews were used to extract the live architecture of the system. Linux Kernel & System programming. Some of the information I have taken from books/net and added my perception into it and presenting it in a simple language. Data structures are a fundamental building block for many software systems: computers manipulate information, and this information is often stored in data structures. Implementing linked data structures invariably appears early in an undergraduate Computer Science curriculum. Classically, programmers implement in memory data structures with pointers. Modern programming environments, however, include rich standard