Файл:On-line Hierarchical Job Scheduling on Grids with Admissible Allocation (Andrei Tchernykh, Uwe Schwiegelshohn, Ramin Yahyapour, Nikolai Kuzjurin).pdf
Размер при предпросмотре: 463 × 599 пикселей. Другое разрешение: 185 × 240 пикселей. |
In this paper, we address non preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine while at the second stage, local scheduling is independently applied to each machine. We discuss strategies based on various combinations of allocation strategies and local scheduling algorithms. Finally, we propose and analyze a scheme named adaptive admissible allocation. This includes competitive analysis for different parameters and constraints. We show that the algorithm is beneficial under certain conditions and allows an efficient implementation in real systems. Furthermore, a dynamic and adaptive approach is presented which can cope with different workloads and Grid properties. KEY WORDS: Grid Computing, Online Scheduling, Resource Management, Job Allocation
История файла
Нажмите на дату/время, чтобы просмотреть, как тогда выглядел файл.
Дата/время | Миниатюра | Размеры | Участник | Примечание | |
---|---|---|---|---|---|
текущий | 14:14, 30 июля 2011 | 612 × 792, 12 страниц (181 КБ) | StasFomin (обсуждение | вклад) | In this paper, we address non preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. A |
- Вы не можете перезаписать этот файл.
Использование файла
Нет страниц, ссылающихся на данный файл.
[ Хронологический вид ]Комментарии
Войдите, чтобы комментировать.