基于处理器配置的一种高效的图形着色算法IJITCSVN.pdf

基于处理器配置的一种高效的图形着色算法IJITCSVN.pdf

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
基于处理器配置的一种高效的图形着色算法IJITCSVN

I.J. Information Technology and Computer Science, 2013, 07, 43-48 Published Online June 2013 in MECS (/) DOI: 10.5815/ijitcs.2013.07.05 An Efficient Graph-Coloring Algorithm for Processor Allocation Mohammed Hasan Mahafzah Faculty of Information Technology, Computer Science Department, Philadelphia University, Amman, 19392, Jordan E-mail: mmahafzah@.jo Abstract— This paper develops an efficient exact processes is used to distribute processes among graph-coloring algorithm based on Maximum processors. The basic idea of the proposed algorithm is Independent Set (MIS) for allocating processors in to select a node with maximum degree first, based on distributed systems. This technique represents the the previous garph-coloring alorithm FMIS [8]. The allocated processors in specific time in a fully proposed algorithm has been constructed by using some connected graph and prevents each processor in modifications of the FMIS algroithm. The experimental multiprocessor system to be assigned to more than one results reveal that the proposed algorithm produces process at a time. This research uses a sequential better performance in terms of CPU utilization, and technique to distribute processes among processors. minimum time for coloring the graph, and produces Moreover, the proposed method has been constructed minimum number of colors needed to color any given by modifying the FMIS algorithm. The proposed

文档评论(0)

docman126 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档