一个主程序产生两个子进程计算N=36的Fibonacci数列，然后统计进程各自的实际时间，CPU时间，用户时间和内核时间。-main program have a two-calculation process N = 36 Fibonacci sequence, and then statistical process to the actual time, CPU time, the kernel and user time to time.

一个FORK（）调用的实验。通过建立共享内存区来实现进程之间的通信。父进程获取Fibonacci数列长度后，创建子进程来计算，待子进程完成后，父进程输出结果-A FORK () call experiment. Through the establishment of shared memory areas to achieve communication between the process. Parent process for the length of Fibonacci sequen

用NASM汇编语言实现不同颜色的斐波那契数列输出-Fibonacci sequence

通过Linux多线程实现斐波那契数列，适合Linux编程入门者。(The realization of multi-threaded Linux Fibonacci sequence)