|
Makerere University Research Repository >
Faculty of Computing and Information Technology >
Research Articles (CIT) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/491
|
| Title: | Using the greedy approach to schedule jobs on multi-cluster systems |
| Authors: | Ngubiri, John
van Vliet, Mario |
| Keywords: | Co-allocation
Parallel Job Scheduling |
| Issue Date: | 2006 |
| Publisher: | WORLDCOMP 2006: The 2006 World Congress in Computer Science, Computer Engineering and Applied Computing |
| Citation: | PDPTA'06 Proceedings: The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications |
| Abstract: | Clusters, multi-cluster systems and the grid are becoming popular high performance computing infrastructures. How jobs are scheduled on them greatly influence the performance. Since jobs are online in most computer systems, they are scheduled when the entire information about them is unknown. We propose a greedy scheduling algorithm that uses both arrival order and how hard a job is to schedule while prioritizing. We compare its performance with that of the Fit processor First Served (FPFS) algorithm. We deduce performance dominance on different job streams. |
| Description: | The article presents and evaluates a new scheduling algorithm that employs co-allocation for space slicing multi-clusters |
| URI: | http://www.world-academy-of-science.org/worldcomp06/ws/PDPTA/publications/pdpta06/authors
http://ww1.ucmss.com/books/LFS/CSREA2006/PDP4683.pdf
http://hdl.handle.net/123456789/491 |
| Appears in Collections: | Research Articles (CIT)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ngubiri-mario-worldcomp-2006-cit-conf.pdf | | 95Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
