D
Dror G. Feitelson
Researcher at Hebrew University of Jerusalem
Publications - 193
Citations - 10513
Dror G. Feitelson is an academic researcher from Hebrew University of Jerusalem. The author has contributed to research in topics: Scheduling (computing) & Job scheduler. The author has an hindex of 49, co-authored 185 publications receiving 9941 citations. Previous affiliations of Dror G. Feitelson include IBM & Vanderbilt University.
Papers
More filters
Journal ArticleDOI
Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling
Ahuva Mu'alem,Dror G. Feitelson +1 more
TL;DR: The study of backfilling to the accuracy of the runtime estimates provided by the users and a very surprising result is found: Backfilling actually works better when users overestimate the runtime by a substantial factor.
Book ChapterDOI
Theory and Practice in Parallel Job Scheduling
TL;DR: The scheduling of jobs on parallel supercomputer is becoming the subject of much research, however, there is concern about the divergence of theory and practice, and a proposal for standard interfaces among the components of a scheduling system is proposed.
Journal ArticleDOI
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Uri Lublin,Dror G. Feitelson +1 more
TL;DR: This work analyzes and model the job-level workloads with an emphasis on those aspects that are universal to all sites, and creates a synthetic workload based on the results of the analysis.
Journal ArticleDOI
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
TL;DR: The end result is a surprisingly simple scheduler, which requires minimal deviations from current practices and behaves exactly like EASY as far as users are concerned; nevertheless, it achieves significant improvements in performance, predictability, and accuracy.
Journal ArticleDOI
Gang scheduling performance benefits for fine-grain synchronization
Dror G. Feitelson,Larry Rudolph +1 more
TL;DR: A model to evaluate the performance of different combinations of synchronization mechanisms and scheduling policies leads to the conclusion that gang scheduling is required for efficient fine-grain synchronization on multiprogrammed multiprocessors.