Abstract
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. processes is used to distribute processes among processors. The basic idea of the proposed algorithm is to select a node with maximum degree first, based on the previous garph-coloring alorithm FMIS (8). The proposed algorithm has been constructed by using some modifications of the FMIS algroithm. The experimental results reveal that the proposed algorithm produces better performance in terms of CPU utilization, and minimum time for coloring the graph, and produces minimum number of colors needed to color any given conncted garph by finding the number of Maximum Independet Sets (MIS). The algorithm takes a polynomial time complexity. During processes allocation, Graph Coloring technique will represent the busy processor at a specified time slot by generating a full directed graph, which in result, busy processors will be mapped in the graph with different colors for each. This paper will be able to answer the following questions: Which processors are allocated? Which processors are idle? What is the number of allocated processors in specific time? What is the number of idle processors in specific time? What is the total number of allocated processors? What is the total number of idle processors?
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information Technology and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
