搜索资源列表
klister-0.4
- read the internal kernel data structures, in order to get reliable information about the system state (like list of all processes, including those \"hidden\" by rootkits, even by fu )
datastrst
- 数据结构与算法综合资料库。数据结构与算法综合资料库-data structures and algorithms integrated database. Data structures and algorithms comprehensive database
boost_source_code
- 正则表达式，可以与POSIX API和Perl语言处理正则表达式的功能相媲美，而且还能支持各种字符类型（如char、wchar_t，甚至还可以是自定义字符类型）； 多线程，想了很久的跨平台多线程库了； 数据结构“图”，再加上即将加入标准的hash_set、hash_map、hash_multiset、hash_multimap等等（事实上不少STL实作，如SGI STL，已经支持以上数据结构），C++对数据结构的支持已近完备； python，没错，对Python语言的支持；
UCOSIIkernalschedinganalysis
- 多任务系统中，内核负责管理各个任务，或者说为每个任务分配CPU时间，并且负责任务之间的通讯。内核提供的基本服务 以使用实时内核可以大大简化应用系统的设计，是因为实时内核允许将应用分成若干个任务，由实时内核来管理它们。内核 用程序的额外负荷，代码空间增加ROM的用量，内核本身的数据结构增加了RAM的用量。但更主要的是，每个任务要有自己的 吃起内存来是相当厉害的。内核本身对CPU的占用时间一般在2到5个百分点之间。 UC/OS-II有一个精巧的内核调度算法,实时内核精小，执行效率高，
tubianli
- 图的遍历的演示（c 语言 数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i<=n i++) { g->V[i]=
zy19810412
- 在计算机操作系统中，最有代表的避免死锁的算法，是Dijkstra银行家算法。这是由于该算法能用于银行系统现金贷款的发放而得名的。为了加深对该算法的认识和掌握，进而在计算机上实现。为了实现银行家算法，系统中必须设置若干数据结构。-in computer operating systems, and most representative of the deadlock avoidance algorithm is Dijkstra algorithm bankers. This is becaus
MasteringAlgorithmswithC
- 一份很详尽的数据结构与算法资料。除了最基本的数据结构知识外，还介绍了数据压缩、des、rsa加解密等算法.-A very detailed information on data structures and algorithms. In addition to the basic data structure of knowledge, but also introduced a data compression, des, rsa encryption algorithm, etc..
uboot
- u-boot工程的总体结构、主要的数据结构、内存分配，主要分析流程中各函数的功能，基于FS2410板子的u-boot移植，实现了NOR Flash和NAND Flash启动,网络功能。 -u-boot project s overall structure, main data structures, memory allocation, the main function of the function of each process, based on u-boot board FS
UnderstandingLinuxKernel
- All people curious about how Linux works and why it is so efficient will find answers here. After reading the book, you will find your way through the many thousands of lines of code, distinguishing between crucial data structures and secondary one
Datastructure
- A useful document on data structures & Algorithms
DSA
- A book on Algorithms and Data structures using C-A book on Algorithms and Data structures using C++
Unix_system_design
- 本书以unix系统为背景，全面系统介绍了unix操作内核的内部数据结构和算法。描述了文件系统程序调度和存储管理等。-This book as the background to unix system, a comprehensive introduction of the unix operating system kernel' s internal data structures and algorithms. Procedures described in the file sys
alloc
- Memory Allocation in C-write part of a dynamic storage allocation package. The package provides three function calls: void initalloc(), to initialize the data structures involved char* alloc(int n), which returns a pointer to a block
Mastering.Algorithms.with.C
- Data comes in all shapes and sizes, but often it can be organized in the same way. For example, consider a list of things to do, a list of ingredients in a recipe, or a reading list for a class. Although each contains a different type of data, they a
LinuxNotesKernel
- Linux内核注释.旨在给程序员和学生提供比以前更详细的和更易理解的Linux内核代码注释.作者分析了核心的代码,并对重要的函数、系统调用和数据结构提供了大量的注释。-Notes Linux kernel. Designed for programmers and students in more detail than before and easier to understand the Notes of the Linux kernel code. The author analyzes
gdsl-1.4.tar
- The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers
hashtable_in_c++
- Hash tables are very common data structures. They provide efficient key based operations to insert and search for data in containers. This code contains a simple implementation in c++.
Linuxsystemcall
- linux系统函数调用大全，有常用数学函数，环境变量，接口处理，进程操作，内存及字符串操作，内存控制，日期时间，数据结构及算法，文件操作等 -linux system function call Daquan, a commonly used mathematical functions, environment variables, interface processing, the process operation, memory and string operations, memo
LinuxKernelTaskManagment
- 1、linux进程管理的模块组织框架 2、相关数据结构。 3、进程调度原则，调度算法,。 4、进程的创建和运行管理。 5、进程间通讯。 6、更多的技术 进程调度和中断处理交接 进程管理涉及的内核机制：bottom-half处理，等待队列 Linux/SMP的进程管理和调度技术 7、概述2.4的新特点-1, linux process management modules organizational framework 2, the relevant
Several-data-structures
- 几种数据结构，包括排序，堆栈，队列等，都是自己写的，希望能帮助初学者-Several data structures, including the sort, stack, queue, is written in their own, hope to help beginners