Performance evolution in Distributed Real-Time System under dynamic load sharing scheme

Computing for Sustainable Global Development(2014)

引用 0|浏览2
暂无评分
摘要
Distributed Real-Time System [DRTS] is a prodigious platform for high performance parallel applications. The Performance of the system can be amended by using the policies of dynamic load sharing. Allocation of parallel application's tasks under load sharing schemes had increased the performance of the system. Task allocation is NP-hard or NP-complete problem. The new heuristic has been deployed in this paper. In the suggested model the limitation of memory and the number of tasks allowed over the processor has been considered. At the time of allocation, the above constraint has been checked and fulfilled. In the proposed model clustering has been done at two levels. For clustering task k-mean clustering has been used and MATLAB 7.11.0 has been used to simulate the proposed model.
更多
查看译文
关键词
computational complexity,parallel processing,pattern clustering,processor scheduling,resource allocation,drts,matlab 7.11.0,np-complete problem,np-hard problem,clustering task,distributed real-time system,dynamic load sharing scheme,high performance parallel application,k-mean clustering,memory limitation,performance evolution,task allocation,cluster,dynamic load sharing,np-complete,parallel application,memory management,np complete,vectors,electronic countermeasures,np hard problem,clustering algorithms,np complete problem,resource management,k mean clustering,mathematical model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要