SUBMESH ALLOCATION WITH FCFS JOB SCHEDULING FOR MESH MULTI COMPUTER

Abstract

A key issue for efficient processor utilization in multiuser mesh connected system is the scheduling of computing resources. Mesh resource scheduling through hardware partitioning involves two component a job schedular & a submesh allocator . Recently a submesh allocation scheme was proposed for multiuser mesh connected systems. The proposed strategy maintains and uses a free submesh list for an efficient allocation. For an allocation request the strategy selects the best fit submesh , which couses the least amount of potential processor fragmantation. As many large free submesh as possible are preserved for later allocation. The proposed scheme has the capability of recognizing a complete submesh. In this disertation first both the existing & reantly proposed schemes are compaired & togather with it a new scheme is proposed which combines the above mentioned. submesh allocation scheme with a new job scheduling approach. The performance of the proposed strategy is evaluated with strictly FCFS job scheduling and priority based FCFS job scheduling. The simulation is written in c & run on P-II 266Mhz. machine . The simulation is event driven with events being arrival & departure of jobs it is shown that the proposed scheme produced low mean waiting delay & allocation miss.