【作者】 孙冕； 朱桀奡； 刘学； 郑智捷；

【Author】 Sun Mian,Zhu Jieao,Liu Xue,Zheng Zhijie (Software School,Yunnan University,Kunming 650091,China)

【机构】 云南大学 软件学院；

【摘要】 当一次计算服务由多个彼此之间存在依赖关系的运行时任务组成时,可以用第二类Petri网的结构描述运行时任务及其之间的依赖关系和所依赖的数据量,并以此作为并行性发掘的模型。通过计算服务确定化、构建Petri网、求解任务的等待时间优先级,可以得出任务和处理机的分配关系,以达到提高并行度、均衡负载、减少数据通信的目标。文章将讨论该方案的特点,以及其适用环境。更多还原

【Abstract】 If a computing service is composed by several runtime tasks among which dependence relationships exist,the structure of the class 2 of Petri Net can be used to describe the dependence relationships and how much data is depended among runtime tasks,and it can be regarded as a model for concurrency minding.Via determining computing service,constructing Petri Net,solving the waiting time priority for each task,the distribution mapping can be resolve to achieve the objective of improving the parallelism,balancing the load,reducing data communication.The essay will investigate the features of the solution and under which circumstance it is appropriate.更多还原