码迷,mamicode.com
首页 >  
搜索关键字:bond team nmcli 聚合网络    ( 2858个结果
ZOJ 3693 Happy Great BG
Happy Great BG Time Limit: 2 Seconds      Memory Limit: 65536 KB The summer training of ZJU ICPC in July is about to end. To celebrate this great and happy day, the coaches of ZJU ICPC Team Navi...
分类:移动开发   时间:2015-08-15 06:46:47    阅读次数:129
【UVa 540】Team Queue
Team QueueQueuesandPriority Queuesare data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, thoug...
分类:其他好文   时间:2015-08-14 18:55:30    阅读次数:130
Linux Bond 技术学习资料
Bond 技术原理 Bond 就是将多块网卡虚拟成为一块网卡的技术,通过 bond 技术让多块网卡看起来是一个单独的以太网接口设备并具有相同的 IP 地址。 Bond 的原理是网卡在混杂 (promisc) 模式下运行;在这种模式下,网卡不像在通常情况下,只接收目的硬件地址是自身 Mac 的以太网帧...
分类:系统相关   时间:2015-08-13 17:19:37    阅读次数:188
linux bond配置步骤,七种bond模式说明
一、网卡绑定: 第一步:创建一个ifcfg-bondX #?vi?/etc/sysconfig/network-scripts/ifcfg-bond0 DEVICE=bond0 BONDING_OPTS="mode=0?miimon=100" BOOTPROTO=none ONBOOT=yes BROADCAST=192.168.0.255 IPADDR=...
分类:系统相关   时间:2015-08-12 11:45:53    阅读次数:224
linux mint17.2 安装fcitx输入法
mint17刚出的时候,曾经在虚拟机上体验过。现在决定好好学习linux,再加上实在是太萌mint,就在虚拟机上安装了mint17.2开始配置fcitx输入法:添加ppa:1 sudo add-apt-repository ppa:fcitx-team/nightly更新:1 sudo aptitu...
分类:系统相关   时间:2015-08-11 15:54:26    阅读次数:213
Wireless Network
http://poj.org/problem?id=2236Description An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected a...
分类:Web程序   时间:2015-08-10 11:59:02    阅读次数:180
Warning: Problems in Mirror May Be Larger Than They Appear
?Warning: Problems in Mirror May Be Larger Than They AppearDave Quicki’vE WoRKEd on HundREdS oF SoFTWARE pRojECTS. Every one had issues that caused more problems than the team expected. Often, a small...
分类:移动开发   时间:2015-08-10 10:41:32    阅读次数:130
Frosh Week
Problem Description During Frosh Week, students play various fun games to get to know each other and compete against other teams. In one such game, all the frosh on a team stand in a line, and are th...
分类:其他好文   时间:2015-08-09 17:08:57    阅读次数:125
UVA 11354 Bond 邦德 (RMQ,最小瓶颈MST)
题意:n个城市,m条路,每条路有个危险值,要使得从s走到t的危险值最小。回答q个询问,每个询问有s和t,要求输出从s到t最小的危险值。(5万个点,10万条边)思路:其实要求的是任意点对之间的最小瓶颈路的权值。 先对图求一次MST,那么所有的瓶颈路都在上面。但是q0)16 {...
分类:其他好文   时间:2015-08-09 13:58:48    阅读次数:543
hdu1426 Sudoku Killer dfs
Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。 据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品―――HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的...
分类:其他好文   时间:2015-08-07 22:04:23    阅读次数:110
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!