期刊名称：International Journal of Information Technology and Computer Science
印刷版ISSN：2074-9007
电子版ISSN：2074-9015
出版年度：2013
卷号：5
期号：7
页码：43-48
DOI：10.5815/ijitcs.2013.07.05
出版社：MECS Publisher
摘要：This paper develops an efficient exact graph-coloring algorithm based on Maximum Independent Set (MIS) for allocating processors in distributed systems. This technique represents the allocated processors in specific time in a fully connected graph and prevents each processor in multiprocessor system to be assigned to more than one process at a time. This research uses a sequential technique to distribute processes among processors. Moreover, the proposed method has been constructed by modifying the FMIS algorithm. The proposed algorithm has been programmed in Visual C++ and implemented on an Intel core i7. The experiments show that the proposed algorithm gets better performance in terms of CPU utilization, and minimum time for of graph coloring, comparing with the latest FMIS algorithm. The proposed algorithm can be developed to detect defected processor in the system.
关键词：Distributed System; Graph Coloring; CPU Scheduling; Multiprocessor System; CPU Utilization; Fully Connected Graph; Processor Allocation
