搜索资源列表
2007-Multi-Task-Data-Structure
- 《多任务下的数据结构》随书的源代码。探讨多任务下的常用数据结构的实现，如AVL，红黑树，以及一些符合数据结构，如哈西链表，哈希红黑树。可以作为STL数据结构的多任务扩展。
Min_min-and--Max_min
- 任务调度的一篇好文章，比较并分析了经典Max-min和Min-min两种算法的优劣-a good paper of Task scheduling
raskparellel
- 本程序完成任务并行等值面提取功能，采用VC开发平台嵌入VTK可视化程序开发保制作。-This procedure task parallel isosurface extraction of features, the use of VC development platform embedded development VTK visualization production security.
balance-para-tuff
- 并行分布式任务调度算法实现，运行于LINUX平台，有详细的源码-Distributed task scheduling parallel algorithm, running on the LINUX platform, the source in detail
fig_mpi
- Is the figure on the plane, presented in the form of plural-va points (xi, yi) There are changes that need to perform (turning, moving, scaling) Leave the system, which has undertaken the conversion figures, but every single child process may t
MBGRAPH
- 曼德勃罗特集 mpi实现 并行计算动态任务分配-曼德勃罗特 set mpi dynamic task allocation for parallel computing
nabbit_v1.tar
- 任何形式的任务并行依赖图都可以获得，有篇这个源代码的论文-Any form of task parallelism to the dependence graph can be obtained
nabbit_arrays_v1.tar
- 任何形式的任务并行依赖图都可以获得，有篇这个源代码的论文，这个是矩阵的-Task parallelism of any form of dependence graph can be obtained, the articles of this source of paper, this is the matrix
MulTask
- 描述了并行编程过程中的几种任务分解模式，对于并行编程的初学者比较实用-Describes several parallel programming task decomposition model more practical for parallel programming for beginners
task_division
- task division for parallel system
TASKQUEUE
- THIS THE TASK WHICH RUNS FOR EVERY 2 MIN, 5 MIN-THIS IS THE TASK WHICH RUNS FOR EVERY 2 MIN, 5 MIN
parallel-compute.
- 一个基于OpenMp并行编程的实例，基于多线程，多线程比单线程下节省运行时间的典型例子。算法内容主要是计算矩阵乘积，再求个元素和。可通过"任务管理器"-"性能"查看运行在多核上。-Typical example of a parallel programming based OpenMp instance, save run time based on the multi-threaded, multi-threading than single-threaded. The algorithm
MSF-HR-2
- 基于DVS的多核周期任务调度，在任务队列分配时采用最大空闲时间预分配策略-DVS the multicore cycle task scheduling, task queue allocation maximum idle time pre-allocation strategy
GLF-and-GTEF
- 基于DVS的多核周期任务调度，在任务队列分配时采用最大空闲时间预分配策略-DVS the multicore cycle task scheduling, task queue allocation maximum idle time pre-allocation strategy
remapping
- 基于DVS的多核周期任务调度，任务映射到处理器核的策略，这是在多核周期调度的第一个阶段-DVS of multicore cycle task scheduling, tasks are mapped to the processor core strategy, which is a scheduling on multicore cycle, the first stage
slack
- 基于DVS的多核周期任务调度，在任务队列分配时采用最大空闲时间预分配策略，任务的第三步空闲时间回收的策略-Pre-allocation strategy based DVS the multicore cycle task scheduling, task queue allocation maximum idle time, the third step of the task idle time recovery strategy
mpi_array
- 这个程序演示了一个简单的数据分解。主任务首先初始化数组，然后分配相等的部分该数组的其他任务。后的其他任务接收其阵列的一部分，它们执行加法运算，以每个数组元素。-This program demonstrates a simple data decomposition. The master task first initializes an array and then distributes an equal portion that array to the other tasks. Aft
MPI_Distributed_Genetic_Algorithm-master
- For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route th
mesh-indexing-master
- MEDLINE citations are manually indexed at the U.S. National Library of Medicine (NLM) using as reference the Medical Subject Headings (MeSH) controlled vocabulary. For this task, the human indexers read the full text of the article. Due to the growth