An Efficient Graph-Coloring Algorithm for Processor Allocation

Provided by: International Journal of Computer and Information Technology (IJCIT)
Topic: Hardware
Format: PDF
In this paper, the authors develop an efficient exact graph-coloring algorithm based on Maximum Independent Set (MIS) for allocating processors in distributed systems. This paper 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 paper uses a sequential technique to distribute processes among processors. Moreover, the proposed method has been constructed by modifying the FMIS algorithm.

Find By Topic