前言
记录一下使用的std库,用法以及使用场景等,不涉及源码。
同样只写下自己用过的函数
map
1.Map是一种关联容器,它按照特定顺序存储由键值Key和映射值Value组合而成的元素。
2.在map内部,元素总是按照其键Key使用其内部比较对象(Compare)并遵循指定的严格弱序准则。如不需要排序只是需要字典,用unordered_map
//引用
#include <map>
//创建
std::map<std::string,int> map
//迭代器遍历
for(std::map<std::string,int>::iterator i=map.begin();i!=map.end();++i)
{
//访问元素
std::cout<<i->first<<" "<<i->second<<std::endl;
}
Algorithm 1 : Dynamic Scheduler
一一一一一一一一一一一一一一一一一一一一一
Input the node that finish the task
Output
for n o d e node node in n o d e L i s t nodeList nodeList do:
f i n i s h T i m e [ n o d e ] finishTime[node] finishTime[node] ← ← ← 0
l o a d T i m e [ n o d e ] loadTime[node] loadTime[node] ← ← ← 0
t a s k R e m a i n [ n o d e ] taskRemain[node] taskRemain[node] ← ← ← 0
for t a s k task task in t a s k l i s t tasklist tasklist do:
find the n o d e node node such that f i n i s h T i m e [ n o d e ] finishTime[node] finishTime[node]+ l o a d T i m e [ n o d e ] ∗ t a s k R e m a i n [ n o d e ] loadTime[node]*taskRemain[node] loadTime[node]∗taskRemain[node] is minmum
t a r g e t target target ← ← ← t a s k R e m a i n [ n o d e ] taskRemain[node] taskRemain[node]++
t a r g e t target target ← ← ← t a s k R e m a i n [ n o d e ] taskRemain[node] taskRemain[node]++
Algorithm 2 : Tail Latency Handler
一一一一一一一一一一一一一一一一一一一一一