期刊文献+

基于信任QoS增强的网格服务调度算法 被引量:51

A Trust-QoS Enhanced Grid Service Scheduling
下载PDF
导出
摘要 针对目前服务网格资源管理中存在的信任机制与调度机制分离的缺陷,基于网格信任模型与信任效益函数,讨论了信任QoS增强的计算服务调度问题.分析传统调度算法的缺陷,提出了基于信任关系的网格服务调度算法.该算法在保证服务性能Qos要求的同时兼顾信任QoS的要求.对基于信任关系的网格服务调度算法性能进行了多角度分析和大规模仿真实验.结果表明:该算法较传统的基于性能QoS的调度启发式和另外两种基于信任Qos的调度启发式而言,不仅具有较优的平均信任效益、总信任效益和较小的最终服务期,而且在失效服务数和系统吞吐率等方面具有较好的综合性能. At present existing scheduling algorithms in service grid largely ignore the impact of trust mechanism. It is rather doubtful to adopt these algorithms in a realistic environment. Based on the grid trust model and trust utilization functions, a computational service scheduling problem based on trust QoS enhancement is proposed. A novel trust-QoS enhanced heuristic based on trust relationship is put forward. The algorithms are evaluated with large scale simulation. Simulation results demonstrate trust-driven heuristics perform better than time-driven heuristic. The algorithm based on trust relationship achieves better integrative performance on performance- QoS, trust-QoS, etc. than trust-driven Min-Min and Sufferage heuristic algorithms.
出处 《计算机学报》 EI CSCD 北大核心 2006年第7期1157-1166,共10页 Chinese Journal of Computers
基金 本课题得到国家"九七三"重点基础研究发展规划项目基金(G2005CB321806) 国家自然科学基金(90412001)资助.
关键词 服务网格 服务调度 服务质量 信任模型 信任关系 信任效益函数 service grid service scheduling QoS trust model trust relation trust utility function
  • 相关文献

参考文献25

  • 1Foster I.,Kesselman C.,Nick M.,Tuecke S..The physiology of the grid:An open Grid Services architecture for distributed systems integration.Open Grid Service Infrastructure WG,Global Grid Forum,June 22,2002 (extended version of Grid Services for Distributed System Integration).http://www.globus.org/alliance/publications/papers/chervenakGrid2005.pdf
  • 2Papazoglou M.P.,Georgakopoulos D..Service-oriented computing.Communications of the ACM,2003,46(10):24~28
  • 3Papazoglou M.P..Service-oriented computing:Concepts characteristics,and directions.In:Proceedings of the 4th International Conference on Web Information System Engineering,Roma,Italy,2003,3~10
  • 4Sabata B.,Chatterjee S.,Davis M.,Sydir J.,Lawrence T..Taxonomy for QoS specifications.In:Proceedings of the IEEE Computer Society 3rd International Workshop on Object-Oriented Real-Time Dependable Systems,Newport Beach,California,1997,100~107
  • 5张伟哲,刘欣然,云晓春,张宏莉,胡铭曾,刘凯鹏.信任驱动的网格作业调度算法[J].通信学报,2006,27(2):73-79. 被引量:33
  • 6Maheswaran M..Quality of service driven resource management algorithms for network computing.In:Proceedings of the International Conference on Parallel and Distributed Processing Technology,Nevada,USA,1999,1090~1096
  • 7丁箐,陈国良,顾钧.计算网格环境下一个统一的资源映射策略[J].软件学报,2002,13(7):1303-1308. 被引量:60
  • 8Ding Q.,Chen G..A benefit function mapping heuristic for a class of meta-tasks in grid environments.In:Proceedings of the 1st IEEE International Symposium on Cluster Computing and the Grid,Brisbane,Australia,2001,654~658
  • 9He X.,Sun X.,Gregor V.L..QoS guided Min-min heuristic for grid task scheduling.Journal of Computer Science and Technology,2003,18(4):442~451
  • 10Weng C.,Lu X..Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid.Future Generation Computer Systems,2005,21(2):271~280

二级参考文献36

  • 1[1]Foster, I., Kesselman, C. The Grid, Blueprint for a New Computing Infrastructure. San Francisco: Morgan Kaufmann Publishers Inc., 1998. 279~309.
  • 2[2]Czajkowski, K., Foster, I. A resource management architecture for metacomputing systems. In: Feitelson, D.G., Rudolph, L., eds. Proceedings of the 4th Workshop on Job Scheduling Strategies for Parallel Processing. LNCS 1459, Orlando: Springer-Verlag, 1998. 62~82.
  • 3[3]Sekiguchi, S., Sato, M. Ninf: network based information library for globally high performance computing. In: Proceedings of the Parallel Object-Oriented Methods and Applications (POOMA). 1996. 39~48. http://www.acl.lanl.gov/Pooma96/.
  • 4[4]Freund, R., Gherrity, M. Scheduling resources in multi-user, heterogeneous computing environments with Smarnet. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98), IEEE Computer Society Press, 1998. 184~199. http://dlib.computer. org/ conferen/ hcw/8365/pdf/83650003.pdf.
  • 5[5]Iverson, M., Ozguner, F. Dynamic, competitive scheduling of multiple DAGs in a distributed heterogeneous environment. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98). IEEE Computer Society Press, 1998. 70~78. http://dlib. computer. org/ conferen/hcw/8365/pdf/83650070.pdf.
  • 6[6]Wang, L., Siegel, H.J., Roychowdhury, V.P., et al. Task matching and scheduling in heterogeneous computing environments using a genetic algorithm based approach. Journal of Parallel and Distributed Computing, 1997,47(1):8~22.
  • 7[7]Foster, I., Roy, A., Winkler, L. A quality of service architecture that combines resource reservation and application adaptation. In: Proceedings of the 8th International Workshop on Quality of Service (IWQOS 2000). 2000. 181~188. http://www.globus.org/ documentation/ incoming/iwqos_adapt1.pdf.
  • 8[8]Armstrong, R., Hensgen, D., Kidd, T. The relative performance of various mapping algorithm is independent of sizable variance in run-time predictions. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98). IEEE Computer Society Press, 1998. 79~87. http://dlib.computer.org/conferen/hcw/8365/pdf/83650079.pdf.
  • 9[9]Braun, T.D., Siegel, H.J., Beck, N., et al. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proceedings of the 8th IEEE Heterogeneous Computing Workshop (HCW'99). IEEE Computer Society Press, 1999. 15~29. http://dlib.computer.org/conferen/hcw/0107/pdf/01070015.pdf.
  • 10[10]Maheswaran, M., Ali, S., Siegel, H.J., et al. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proceedings of the 8th IEEE Heterogeneous Computing Workshop (HCW'99). IEEE Computer Society Press, 1999. 30~44. http://dlib.computer.org/conferen/hcw/0107/pdf/01070030.pdf.

共引文献92

同被引文献453

引证文献51

二级引证文献166

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部