搜索资源列表
MBGRAPH
- 曼德勃罗特集 mpi实现 并行计算动态任务分配-曼德勃罗特 set mpi dynamic task allocation for parallel computing
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
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
OpenCLsorting-20110625
- OpenCL实现快速排序在DWMS上的应用适当的的分配各个节点之间的任务负载-OpenCL implementation workload between each node on DWMS quick sort of application adequate allocation
MyGA-master
- 将节点按内存情况排序 将任务按内存需求情况排序 规则：将内存需求最小的节点先行分配在内存剩余最多的节点上(Sort nodes by memory and tasks by memory requirements Rule: the node with the least memory requirement is allocated to the node with the most remaining memory)