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

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