| dc.contributor.author | Ngubiri, John | |
| dc.contributor.author | Van Vliet, Mario | |
| dc.date.accessioned | 2012-01-31T11:39:17Z | |
| dc.date.available | 2012-01-31T11:39:17Z | |
| dc.date.issued | 2006 | |
| dc.identifier.citation | PDPTA'06 Proceedings: The 2006 International Conference on Parallel and Distributed Processing Techniques and Applications | en_US |
| dc.identifier.uri | http://www.world-academy-of-science.org/worldcomp06/ws/PDPTA/publications/pdpta06/authors | |
| dc.identifier.uri | http://ww1.ucmss.com/books/LFS/CSREA2006/PDP4683.pdf | |
| dc.identifier.uri | http://hdl.handle.net/10570/367 | |
| dc.description | The article presents and evaluates a new scheduling algorithm that employs co-allocation for space slicing multi-clusters | en_US |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | WORLDCOMP 2006: The 2006 World Congress in Computer Science, Computer Engineering and Applied Computing | en_US |
| dc.subject | Co-allocation | en_US |
| dc.subject | Parallel Job Scheduling | en_US |
| dc.title | Using the greedy approach to schedule jobs on multi-cluster systems | en_US |
| dc.type | Conference paper | en_US |
