Description: 这个系统属于自动化的搜索引擎，它可以从一个网址列表开始，自动寻找这些网址的下一级网页。可以让中小网站也有有自己特色的搜索引擎。适合与于对某一指定领域里的网站进行搜索，比如建立一个内网的搜索引擎。
升级内容：
1.增加屏蔽网址功能 。
2.修正上一版本处理网页重定向时判断部分网址的错误。
3.增加了删除重复数据功能，可选择是否采用重复页面删除模式，可定义索引重复数据的数据表。
4.首次采用注册码注册完全版本，共享版本限制每网址索引10个页面。
-this system is an automated search engine, it can list a site, automatic search for a site to the next website. Small and medium-sized websites can also have their own characteristics search engine. With the right fit in a specified area of the site search, such as the establishment of a network within the search engines. Upgrades : 1. Additional shielding the website. 2. A revised version of the Web redirect part of the website judgment error. 3. A function to delete duplicate data, the choice of whether to delete pages using repeat mode definable Index duplication of data tables. 4. License introduced for the first time fully registered version, sharing version of the web site to limit each index 10 pages. Platform: |
Size: 115875 |
Author:李文超 |
Hits:
Description: 这个系统属于自动化的搜索引擎，它可以从一个网址列表开始，自动寻找这些网址的下一级网页。可以让中小网站也有有自己特色的搜索引擎。适合与于对某一指定领域里的网站进行搜索，比如建立一个内网的搜索引擎。
升级内容：
1.增加屏蔽网址功能 。
2.修正上一版本处理网页重定向时判断部分网址的错误。
3.增加了删除重复数据功能，可选择是否采用重复页面删除模式，可定义索引重复数据的数据表。
4.首次采用注册码注册完全版本，共享版本限制每网址索引10个页面。
-this system is an automated search engine, it can list a site, automatic search for a site to the next website. Small and medium-sized websites can also have their own characteristics search engine. With the right fit in a specified area of the site search, such as the establishment of a network within the search engines. Upgrades : 1. Additional shielding the website. 2. A revised version of the Web redirect part of the website judgment error. 3. A function to delete duplicate data, the choice of whether to delete pages using repeat mode definable Index duplication of data tables. 4. License introduced for the first time fully registered version, sharing version of the web site to limit each index 10 pages. Platform: |
Size: 115712 |
Author:李文超 |
Hits:
Description: 内存管理
设计一个内存管理器，支持至少两种分配策略。
对不同分配策略的性能进行评估。
利用c++语言实现了，First-fit，next-fit。两种分配算法。并实现了测试程序
-Design a memory management memory management, and support for at least two types of allocation strategies. On the performance of different allocation strategies for evaluation. Using c++ language achieved, First-fit, next-fit. Two allocation algorithm. And the realization of the test procedure Platform: |
Size: 715776 |
Author:张帅 |
Hits:
Description: 内存管理实验，设计一个内存管理器，支持至少两种分配策略,如first-fit, next-fit-Memory management experiment, the design of a memory manager to support the allocation of at least two strategies, such as first-fit, next-fit Platform: |
Size: 124928 |
Author:jiangyuan |
Hits:
Description: 本实验要求建造一个没有虚拟功能的内存管理系统．任务如下：
设计一个内存管理器，支持至少两种分配策略，如first-fit，next-fit，best-fit，worst-fit等．
对不同分配策略的性能进行评估．
这次实验主要实现了first fit和best fit两个算法。
-This experiment did not require the construction of a virtual memory management system functions. Tasks are as follows: the design of a memory manager to support the allocation of at least two strategies, such as first-fit, next-fit, best-fit, worst-fit and so on. on the performance of different allocation strategies for evaluation. The main achievement of the experiment the first fit and best fit the two algorithms. Platform: |
Size: 273408 |
Author:小江 |
Hits:
Description: 分析Unix最先适应（first fit，ff）存储分配算法。即map数据结构、存储分配函数ma lloc()和存储释放函数mfree()，找出与算法有关的成分。修改上述算法有关成分，使其分别体现BF(best fit，最佳适应)分配原则WF(worst fit，最坏适应)分配原则。-Analysis of Unix was first to adapt to (first fit, ff) memory allocation algorithm. The map data structure, storage allocation function ma lloc () and memory release function mfree (), and algorithms to identify the elements. Modify the above algorithm as the ingredients, so that, respectively, embody BF (best fit, best fit) the principle of distribution WF (worst fit, the worst adaptation) distribution. Platform: |
Size: 1024 |
Author:高飞 |
Hits:
Description: 本次实验主要围绕动态分区分配方式展开。熟悉并掌握动态分配五大算法：first fit，next fit，best fit，worst fit，quick fit-This experiment mainly around the dynamic partitioning distribution expanded. Familiar with and master the dynamic allocation of five algorithms: first fit, next fit, best fit, worst fit, quick fit Platform: |
Size: 6083584 |
Author:春春 |
Hits:
Description: 3）必须模拟该4种内存分配算法：first fit，next fit，best fit和worst fit中的至少2种。
4） 需显示出每次分配和回收后的空闲分区链的情况来以及内存占用情况图，并统计各种算法产生的碎片空闲区（小于3个单元（unit）的空闲区）数。
5）计算2个性能参数：碎片数、平均搜索空闲区次数-3) must simulate the four kinds of memory allocation algorithms: first fit, at least two kinds of next fit, best fit and worst fit in. 4) the need to show the situation after each allocation and recovery partition chain to idle and memory usage graph and statistical debris generated by various algorithms free zone (less than 3 units (unit) free zone) number. 5) Calculation of individual performance parameters: the number of fragments, the average number of idle search area Platform: |
Size: 2048 |
Author:刘万友 |
Hits:
Search - first fit next fit