Co-Scheduling of Parallel Jobs in Clusters
Co-scheduling of parallel jobs in the chips is wellknown to produce benefits in both system and individual job efficiency. The existing works have shown that job coscheduling can effectively improve the contention, yet the question on the determination of optimal co-schedules still remains unanswered. The need for co-scheduling has been typically associated with communication bandwidth and the memory. In our work we have proposed a novel scheduling algorithm for optimal co-scheduling of parallel jobs. This algorithm facilitates the scheduling of parallel jobs using bandwidth and memory concepts. The co-scheduling of the processes in the chips using the proposed algorithm shows satisfactory improvement in performance of running the parallel jobs.
Co-scheduling Bandwidth Cache Memory Scheduling Algorithms
A. Neela madheswari R.S.D.Wahida Banu
Research Scholar, Anna University Coimbatore, Tamilnadu, India Research Supervisor, Anna University, Coimbatore Tamilnadu, India
国际会议
北京
英文
2019-2023
2009-08-08（万方平台首次上网日期，不代表论文的发表时间）