World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
58
Citations
14353
World Ranking
3614
National Ranking
58

Overview

Dror G. Feitelson is affiliated with the Hebrew University of Jerusalem in Israel and has contributed to the field of Computer Science, focusing primarily on areas such as Software Engineering Research and Software Reliability and Analysis Research. Their work also spans Software Engineering Techniques and Practices, Open Source Software Innovations, Software Testing and Debugging Techniques, Mobile Crowdsensing and Crowdsourcing, and Software System Performance and Reliability.

The subfields of Dror G. Feitelson's research include Information Systems, Artificial Intelligence, Software, Computer Science Applications, and Computer Networks and Communications.

The scientist has published frequently in a variety of venues, with a notable number of publications appearing in Zenodo (CERN European Organization for Nuclear Research), arXiv (Cornell University), and Empirical Software Engineering. Other common publication venues include the Journal of Systems and Software and IEEE Transactions on Software Engineering.

Their recent papers include:

  • How Developers Choose Names, 2020, IEEE Transactions on Software Engineering
  • From Code Complexity Metrics to Program Comprehension, 2023, Communications of the ACM
  • Understanding large-scale software systems - structure and flows, 2021, Empirical Software Engineering
  • Corrective commit probability: a measure of the effort invested in bug fixing, 2021, Software Quality Journal
  • Considerations and Pitfalls for Reducing Threats to the Validity of Controlled Experiments on Code Comprehension, 2022, Empirical Software Engineering

Frequent collaborators of Dror G. Feitelson include Idan Amit, Mor Shamy, Roee Cates, Nadav Yunik, and Alexey Braver, highlighting a network of co-authors actively contributing alongside in various research projects.

Best Publications

  • Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling

    A.W. Mu'alem;D.G. Feitelson

  • Theory and Practice in Parallel Job Scheduling

    Dror G. Feitelson;Larry Rudolph;Uwe Schwiegelshohn;Kenneth C. Sevcik

  • The workload on parallel supercomputers: modeling the characteristics of rigid jobs

    Uri Lublin;Dror G. Feitelson

  • Backfilling Using System-Generated Predictions Rather than User Runtime Estimates

    D. Tsafrir;Y. Etsion;D.G. Feitelson

  • Gang scheduling performance benefits for fine-grain synchronization

    Dror G. Feitelson;Larry Rudolph

  • Parallel job scheduling — a status report

    Dror G. Feitelson;Larry Rudolph;Uwe Schwiegelshohn

  • Workload Modeling for Computer Systems Performance Evaluation

    Dror G. Feitelson

  • Packing Schemes for Gang Scheduling

    Dror G. Feitelson

  • Development and Deployment at Facebook

    D. G. Feitelson;E. Frachtenberg;K. L. Beck

  • The Vesta parallel file system

    Peter F. Corbett;Dror G. Feitelson

  • Utilization and predictability in scheduling the IBM SP2 with backfilling

    D.G. Feitelson;A.M. Weil

  • Improved Utilization and Responsiveness with Gang Scheduling

    Dror G. Feitelson;Morris A. Jette

  • Experience with using the Parallel Workloads Archive

    Dror G. Feitelson;Dan Tsafrir;David Krakov

  • Towards Convergence in Job Schedulers for Parallel Supercomputers

    Dror G. Feitelson;Larry Rudolph

  • Optical Computing: A Survey for Computer Scientists

    Dror G. Feitelson

  • Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860

    Dror G. Feitelson;Bill Nitzberg

  • Parallel Job Scheduling: Issues and Approaches

    Dror G. Feitelson;Larry Rudolph

  • Metrics and Benchmarking for Parallel Job Scheduling

    Dror G. Feitelson;Larry Rudolph

  • Benchmarks and Standards for the Evaluation of Parallel Job Schedulers

    Steve J. Chapin;Walfredo Cirne;Dror G. Feitelson;James Patton Jones

  • Distributed hierarchical control for parallel processing

    D.G. Feitelson;L. Rudolph

Frequent Co-Authors

Peter F. Corbett
Peter F. Corbett IBM (United States)
Fabrizio Petrini
Fabrizio Petrini Intel (United States)
William R Schafer
William R Schafer MRC Laboratory of Molecular Biology
Marc Snir
Marc Snir University of Illinois at Urbana-Champaign
Sameer Singh
Sameer Singh University of California, Irvine
Danny Dolev
Danny Dolev Hebrew University of Jerusalem
Joseph Y. Halpern
Joseph Y. Halpern Cornell University
Nathan Linial
Nathan Linial Hebrew University of Jerusalem
Mark E. Giampapa
Mark E. Giampapa IBM (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science degree options online can be a strategic choice if you’re seeking flexibility or cost savings. Many students are drawn to the cheapest online college programs, which help reduce educational expenses without compromising quality. For those who may not have a strong academic record, there are excellent opportunities at the best colleges for low gpa students, making a tech career more accessible.

If you’re eager to accelerate your studies, consider enrolling in one of the fastest computer science degree programs. These allow you to complete your education sooner and start your career quickly.

Computer science skills also open up interdisciplinary career paths. For example, fields like environmental science increasingly rely on data analysis, programming, and AI. Find out what can you do with an environmental science degree if you’re interested in applying tech talents to global challenges.

Best Scientists Citing Dror G. Feitelson

Trending Scientists