Location:
Search - fork
Search list
Description: 实现Linux的进程管理。
a. 通过fork创建一个子进程。然后父子进程分别多次循环打印\"parent\"和\"child\", 同时打印出它们的pid,可以通过让进程睡眠一段时间来观看父子进程交叉执行的效果。
b. 通过fork创建子进程A, B。 A进程统计用户主目录下文件的个数并打印结果， B 进程列出用户主目录下的所有文件， 等待两个子进程都执行完毕时，父进程打印出后\"child are completed!\"信息后退出。
Platform: |
Size: 74341 |
Author: zc |
Hits:
Description: 工ARM＿LINUX的几个源代码，fork,pipe,fifo,及共享内存的实验源程序
Platform: |
Size: 71589 |
Author: yxh |
Hits:
Description: asterisk系统源代码
程序截获SIGHUP信号来保证语音处理部分正常结束。
正常结束,产生MVMSTATUS变量
Main模式：
程序截获SIGHUP信号来保证语音处理部分正常结束。
正常结束,产生MVMSTATUS变量
被hangup或其他异常结束：
检测是否录音模式,是否需要处理文件
利用fork语法产生新进程，处理外部程序(ftp或smtp在处理完成以后根据要求是否删除掉本地文件)
功能约定：
语音播放部分从配置中分析。播放习惯直接检测caller的language类型。
用户可以指定greet和mail存放在不同folder里。
mail部分只保留new和old两个分类。
系统可以检测指定磁盘是否足够存放voicemail。
可以限制留言每条的时间，以及每个人允许有多少条，以及留过以后处理完成是否删除。
提示语音说的内容根据配置文件产生，两单词之间用空格做分割，特别变量用％表示
Platform: |
Size: 183264 |
Author: RobinWang |
Hits:
Description: 操作系统实习报告，LINUX常用命令，fork.c源代码分析，磁盘调度
Platform: |
Size: 530972 |
Author: 屈辰子 |
Hits:
Description: 这是一个进程创建实现的简单源程序，实现进程间的通信和管理
Platform: |
Size: 3422 |
Author: 肖欣 |
Hits:
Description: 数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!" / "NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Platform: |
Size: 4030 |
Author: 洪玲叶 |
Hits:
Description: 网络编程的服务端和客户端.包括用fork和select分别实现多进程编程和多线程编程.程序已经通过测试的.-network programming services and clients. Including fork and select respectively programming multi-process and multi-threaded programming. Procedures have to pass the test.
Platform: |
Size: 4482 |
Author: 柳心雨 |
Hits:
Description: java的小程序,上传了好几次都没成功,不知怎么回事...再试试看看....再不行就叉了-small procedures, a number of upload never succeeded, I do not know how the case ... try again to see it .... If there is not a fork
Platform: |
Size: 5911142 |
Author: 沉默 |
Hits:
Description: 使用系统调用fork()创建两个子进程。当此程序运行时，在系统中有一个父进程和两个子进程活动。让每一个进程在屏幕上现实一个字符：父进程显示字符’a’；子进程分别显示字符’b’和’c’。试观察记录屏幕上的显示结果并分析原因。-use system calls fork () to create two child process. When running, the system is a process and the father of two sub-process activities. Each process in a realistic one screen characters : the father of the process show the character 'a'; Child showed the characters' b 'and' c '. Let observation records on the screen to show the results and analysis of the reasons.
Platform: |
Size: 10481 |
Author: 杨宇文 |
Hits:
Description: 本程序只对一个IP地址进行，如果要对一段IP进行测试，简单修改程序即可。可将发送放在单独的进程 里(使用fork（）），send_icmp里做成循环，每次重新初始化struct sockaddr_in。那么对接收到的数据 进行分析的proc_icmp（）将多一道对IP报头ip->src字段的判断。-this procedure only a pair of IP addresses, IP to a test, a simple change procedures. This can be placed on a separate process (the use of fork ()), causing Lane send_icmp cycle, each re-initialization struct sockaddr_in. Then Butt received the data analysis proc_icmp () will more than one pair of IP header ip-gt; Src field judgment.
Platform: |
Size: 2109 |
Author: 吕杰 |
Hits:
Description: Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like
solution,Is very important in the translation
Platform: |
Size: 2659 |
Author: 罗文 |
Hits:
Description: 数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree
Platform: |
Size: 1596984 |
Author: 孙锋志 |
Hits:
Description: 一个UNIX进程间通讯的程序，使用了信号量来解决操作系统的消费者与生产者问题，使用了fork,wait,nanosleep,sempo等unix函数。-a UNIX inter-process communication, the use of the signal operating system to solve the volume of consumers and producers, the use of the fork, wait, nanosleep, sempo other unix function.
Platform: |
Size: 2495 |
Author: 飞杨 |
Hits:
Description: 二叉排序树的建立与插入-two fork-tree insert the establishment and
Platform: |
Size: 1024 |
Author: 郭强 |
Hits:
Description: 该问题与以前经典的五个哲学家五根筷子不同，这次是每个哲学家身边均有一副刀叉，总的资源是充足的-problems with the previous five classic philosophers five different chopsticks, this is the philosopher of each side have a knife and fork, the total resources are adequate
Platform: |
Size: 7168 |
Author: 陶文婧 |
Hits:
Description: unix下用fork()创建process的例子-unix using fork () to create examples of process
Platform: |
Size: 8192 |
Author: 求晓鹏 |
Hits:
Description: 数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Platform: |
Size: 4096 |
Author: 洪玲叶 |
Hits:
Description: java的小程序,上传了好几次都没成功,不知怎么回事...再试试看看....再不行就叉了-small procedures, a number of upload never succeeded, I do not know how the case ... try again to see it .... If there is not a fork
Platform: |
Size: 5910528 |
Author: 沉默 |
Hits:
Description: 使用系统调用fork()创建两个子进程。当此程序运行时，在系统中有一个父进程和两个子进程活动。让每一个进程在屏幕上现实一个字符：父进程显示字符’a’；子进程分别显示字符’b’和’c’。试观察记录屏幕上的显示结果并分析原因。-use system calls fork () to create two child process. When running, the system is a process and the father of two sub-process activities. Each process in a realistic one screen characters : the father of the process show the character 'a'; Child showed the characters' b 'and' c '. Let observation records on the screen to show the results and analysis of the reasons.
Platform: |
Size: 10240 |
Author: 杨宇文 |
Hits:
Description: 本程序只对一个IP地址进行，如果要对一段IP进行测试，简单修改程序即可。可将发送放在单独的进程 里(使用fork（）），send_icmp里做成循环，每次重新初始化struct sockaddr_in。那么对接收到的数据 进行分析的proc_icmp（）将多一道对IP报头ip->src字段的判断。-this procedure only a pair of IP addresses, IP to a test, a simple change procedures. This can be placed on a separate process (the use of fork ()), causing Lane send_icmp cycle, each re-initialization struct sockaddr_in. Then Butt received the data analysis proc_icmp () will more than one pair of IP header ip-gt; Src field judgment.
Platform: |
Size: 2048 |
Author: 吕杰 |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
32
»