Publications by Dror Feitelson

Essays

• D. G. Feitelson and M. Treinin, “The blueprint for life?”. Computer 35(7), pp. 34-40, Jul 2002.
  ©Copyright 2002 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Or you might prefer our preliminary version. (78 KB)
• D. G. Feitelson and A. W. Mu'alem, “On the definition of "on-line" in job scheduling problems”. SIGACT News 36(1) pp. 122-131, Mar 2005.
  Also available from the ACM Digital Library.
  
• D. G. Feitelson, Experimental Computer Science: The Need for a Cultural Change. Manuscript, 2005.
• D. G. Feitelson, “Asimov's laws of robotics applied to software”. The Software Practitioner 17(1), pp. 6-9, Jan-Feb 2007.
  Appears in abbreviated form in IEEE Software 24(4), pp. 112-111, Jul/Aug 2007 (Loyal Opposition column)
• D. G. Feitelson, “Looking at data”. In 22nd Intl. Parallel and Distributed Processing Symp., Apr 2008. (200 KB)
  ©Copyright 2008 by IEEE. Definitive version available from IEEE Xplore.
  PowerPoint slides from the keynote presentation at IPDPS 2008.

Workload Characterization and Modeling

>> Importance, Approaches, and Examples

• D. G. Feitelson and L. Rudolph, “Metrics and benchmarking for parallel job scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-24, Springer-Verlag, 1998. Lecture Notes in Computer Science Vol. 1459.
  ©Copyright 1998 by Springer-Verlag. Definitive version available from Springer LINK.
• A. B. Downey and D. G. Feitelson, “The elusive goal of workload characterization”. Perf. Eval. Rev. 26(4), pp. 14-29, Mar 1999. (129 KB)
  Also available from the ACM Digital Library.
  
• S. J. Chapin, W. Cirne, D. G. Feitelson, J. P. Jones, S. T. Leutenegger, U. Schwiegelshohn, W. Smith, and D. Talby, “Benchmarks and standards for the evaluation of parallel job schedulers”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 67-90, Springer-Verlag, 1999. Lecture Notes in Computer Science Vol. 1659.
  ©Copyright 1999 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, “A critique of ESP”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 68-73, Springer-Verlag, 2000. Lecture Notes in Computer Science Vol. 1911. (45 KB)
  ©Copyright 2000 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, “The forgotten factor: facts; on performance evaluation and its dependence on workloads”. In EuroPar 2002, pp. 49-60, Springer-Verlag, Aug 2002. Lecture Notes in Computer Science Vol. 2400. (69 KB)
  ©Copyright 2002 by Springer-Verlag. Definitive version available from Springer LINK.
  PowerPoint slides from the invited plenary presentation at EuroPar 2002.
• D. G. Feitelson, “Workload modeling for performance evaluation”. In Performance Evaluation of Complex Systems: Techniques and Tools, M. C. Calzarossa and S. Tucci (Eds.), pp. 114-141, Springer-Verlag, Sep 2002. Lecture Notes in Computer Science Vol. 2459. (166 KB)
  ©Copyright 2002 by Springer-Verlag. Definitive version available from Springer LINK.
  PowerPoint slides from the tutorial at Performance 2002.
• D. G. Feitelson, “Metric and workload effects on computer systems evaluation”. Computer 36(9) pp. 18-25, Sep 2003.
  ©Copyright 2003 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original version available as Technical Report 2001-13. (41 KB)
• D. G. Feitelson, “Experimental analysis of the root causes of performance evaluation results: a backfilling case study”. IEEE Trans. Parallel & Distributed Syst. 16(2), pp. 175-182, Feb 2005. (69 KB)
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Extended version available as Technical Report 2002-4. (105 KB)
  
• E. Shmueli and D. G. Feitelson, “Uncovering the effect of system performance on user behavior from traces of parallel systems”. In 15th Conf. Modeling, Analysis, & Simulation of Comput. & Telecomm. Syst., pp. 274-280, Oct 2007. (385 KB)
  ©Copyright 2007 by IEEE. Definitive version available from IEEE Xplore.
  
• E. Shmueli and D. G. Feitelson, “On simulation and design of parallel-systems schedulers: are we doing the right thing?”. IEEE Trans. Parallel & Distributed Syst. 20(7), pp. 983-996, Jul 2009. (444 KB)
  ©Copyright 2009 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  
• D. G. Feitelson and E. Shmueli, “A case for conservative workload modeling: parallel job scheduling with daily cycles of activity”. In 17th Conf. Modeling, Analysis, & Simulation of Comput. & Telecomm. Syst., Sep 2009. (385 KB)
  ©Copyright 2009 by IEEE.
  

>> Methodological Issues

• D. G. Feitelson, Random Number Generators and Heavy-Tail Distributions. Technical Report 2001-2, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jan 2001. (79 KB)
• D. G. Feitelson, “Metrics for parallel job scheduling and their convergence”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 188-206, Springer-Verlag, 2001. Lecture Notes in Computer Science Vol. 2221. (242 KB)
  ©Copyright 2001 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, “A distributional measure of correlation”. InterStat, Dec 2004. (2 MB)
  Definitive version available FOR FREE from http://interstat.statjournals.net/YEAR/2004/abstracts/0412001.php.
• D. G. Feitelson and D. Tsafrir, “Workload sanitation for performance evaluation”. In IEEE Intl. Symp. Performance Analysis of Systems and Software, pp. 221-230, Mar 2006. (301 KB)
  ©Copyright 2006 by IEEE. Definitive version available from IEEE Xplore.
• D. Tsafrir and D. G. Feitelson, “Instability in parallel job scheduling simulation: the role of workload flurries”. In 20th Intl. Parallel and Distributed Processing Symp., Apr 2006. (1 MB)
  ©Copyright 2006 by IEEE. Definitive version available from IEEE Xplore.
• D. G. Feitelson, “Metrics for mass-count disparity”. In 14th Conf. Modeling, Analysis, & Simulation of Comput. & Telecomm. Syst., pp. 61-68, Sep 2006. (445 KB)
  ©Copyright 2006 by IEEE. Definitive version available from the IEEE Computer Society Digital Library or IEEE Xplore.
• E. Shmueli and D. G. Feitelson, “Using site-level modeling to evaluate the performance of parallel system schedulers”. In 14th Conf. Modeling, Analysis, & Simulation of Comput. & Telecomm. Syst., pp. 167-176, Sep 2006. (276 KB)
  ©Copyright 2006 by IEEE. Definitive version available from the IEEE Computer Society Digital Library or IEEE Xplore.
  Extended version available as Technical Report 2006-18. (640 KB)
  Nominated for Best Paper Award (1 of 3)
  
• D. G. Feitelson, “Locality of sampling and diversity in parallel system workloads”. In 21st Intl. Conf. Supercomputing, pp. 53-63, Jun 2007. (416 KB)
  ©Copyright 2007 by ACM, Inc. Definitive version available from the ACM Digital Library.
• D. Talby, D. G. Feitelson, and A. Raveh, “A co-plot analysis of logs and models of parallel workloads”. ACM Trans. Modeling & Comput. Simulation 12(3) art. 12, Jul 2007.
  ©Copyright 2007 by ACM, Inc. Definitive version available from the ACM Digital Library.
  Largely based on
  • D. Talby, D. G. Feitelson, and A. Raveh, “Comparing logs and models of parallel workloads using the coplot method”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 43-66, Springer-Verlag, 1999. Lecture Notes in Computer Science Vol. 1659.
    ©Copyright 1999 by Springer-Verlag. Definitive version available from Springer LINK.
• O. Duskin and D. G. Feitelson, “Distinguishing humans from robots in web search logs: preliminary results using query rates and intervals”. In Workshop Web Search Click Data, pp. 15-19, Feb 2009. (90 KB)
  ©Copyright 2009 by ACM, Inc. Definitive version available from the ACM Digital Library.

>> Workloads and Models

• D. G. Feitelson and B. Nitzberg, “Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 337-360, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949. (70 KB)
  ©Copyright 1995 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, “Packing schemes for gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 89-110, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162. (79 KB)
  ©Copyright 1995 by Springer-Verlag. Definitive version available from Springer LINK.
• K. Windisch, V. Lo, R. Moore, D. Feitelson, and B. Nitzberg, “A comparison of workload traces from two productions parallel machines”. In 6th Synp. Frontiers Massively Parallel Comput., pp. 319-326, Oct 1996.
  Repeats some of the NASA iPSC paper above.
  ©Copyright 1996 by IEEE. Definitive version available from IEEE Xplore.
• D. G. Feitelson, “Memory usage in the LANL CM-5 workload”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 78-94, Springer-Verlag, 1997. Lecture Notes in Computer Science Vol. 1291. (190 KB)
  ©Copyright 1997 by Springer-Verlag. Definitive version available from Springer LINK.
• U. Lublin and D. G. Feitelson, “The workload on parallel supercomputers: modeling the characteristics of rigid jobs”. J. Parallel & Distributed Comput. 63(11), pp. 1105-1122, Nov 2003. (109 KB)
  ©Copyright 2003 by Elsevier. Definitive version available from ScienceDirect.
• D. Tsafrir, Y. Etsion, and D. G. Feitelson, “Modeling user runtime estimates”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, E. Frachtenberg, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 1-35, Springer-Verlag, 2005. Lecture Notes in Computer Science Vol. 3834.
  ©Copyright 2005 by Springer-Verlag. Definitive version available from Springer LINK.

Operating Systems

• D. G. Feitelson and M. Naaman, “Self-tuning systems”. IEEE Software 16(2), pp. 52-60, Mar/Apr 1999. (72 KB)
  ©Copyright 1999 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• Y. Etsion and D. G. Feitelson, Time Stamp Counters Library - Measurements with Nano Seconds Resolution. Technical Report 2000-36, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Aug 2000. (57 KB)
• Y. Etsion, D. Tsafrir, and D. G. Feitelson, “Effects of clock resolution on the scheduling of interactive and soft real-time processes”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 172-183, Jun 2003. (304 KB)
  ©Copyright 2003 by ACM, Inc. Definitive version available from the ACM Digital Library.
• D. Tsafrir, Y. Etsion, and D. G. Feitelson, General-Purpose Timing: The Failure of Periodic Timers. Technical Report 2005-6, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Feb 2005. (139 KB)
• D. Tsafrir, Y. Etsion, D. G. Feitelson, and S. Kirkpatrick, “System noise, OS clock ticks, and fine-grained parallel applications”. In 19th Intl. Conf. Supercomputing, pp. 303-312, Jun 2005.
  ©Copyright 2005 by ACM, Inc. Definitive version available from the ACM Digital Library.
• Y. Etsion, D. Tsafrir, and D. G. Feitelson, “Process prioritization using output production: scheduling for multimedia”. ACM Trans. Multimedia Comput., Commun. & Appl. 2(4), pp. 318-342, Nov 2006 (358 KB)
  ©Copyright 2006 by ACM, Inc. Definitive version available from the ACM Digital Library.
  Partly based on
  • Y. Etsion, D. Tsafrir, and D. G. Feitelson, “Desktop scheduling: how can we know what the user wants?”. In 14th Workshop on Network and Operating System Support for Digital Audio and Video, pp. 110-115, Jun 2004. (137 KB)
    ©Copyright 2004 by ACM, Inc. Definitive version available from the ACM Digital Library.
• Y. Etsion, D. Tsafrir, S. Kirkpatrick, and D. G. Feitelson, “Fine grained kernel logging with KLogger: experience and insights”. In 2nd EuroSys, pp. 259-272, Mar 2007. (245 KB)
  ©Copyright 2007 by ACM, Inc. Definitive version available from the ACM Digital Library.
• D. Tsafrir, Y. Etsion, and D. G. Feitelson, “Secretly monopolizing the CPU without superuser privileges”. In 16th USENIX Security Symp., pp. 239-256, Aug 2007. (401 KB)
  Definitive version available FOR FREE from Usenix.
  Covered in Slashdot
• T. Ben-Nun, Y. Etsion. and D. G. Feitelson, The Klogger Networking Schema. Technical Report 2008-1, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jan 2008. (40 KB)
• Y. Etsion, T. Ben-Nun, and D. G. Feitelson, “A global scheduling framework for virtualization environments”. In 5th Intl. Workshop System Management Techniques, Processes, and Services, May 2009.
  ©Copyright 2009 by IEEE. Definitive version available from IEEE Xplore.
  Best Student Paper Award

Software Engineering

• D. G. Feitelson, G. Heller, and S. R. Schach, “An empirically-based criterion for determining the success of an open-source project”. In Australian Software Engineering Conference, pp. 363-368, Apr 2006. (205 KB)
  ©Copyright 2006 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• S. R. Schach, T. O. S. Adeshiyan, D. Balasubramanian, G. Madl, E. P. Osses, S. Singh, K. Suwanmongkol, M. Xie, and D. G. Feitelson, “Common coupling and pointer variables, with application to a Linux case study”. Software Quality J. 15(1), pp. 99-113, Mar 2007.
  ©Copyright 2007 by Springer-Verlag. Definitive version available from Springer LINK.
  
• D. G. Feitelson, T. O. S. Adeshiyan, D. Balasubramanian, Y. Etsion, G. Madl, E. P. Osses, S. Singh, K. Suwanmongkol, M. Xie, and S. R. Schach, “Fine-grain analysis of common coupling and its application to a Linux case study”. J. Syst. & Softw. 80(8), pp. 1239-1255, Aug 2007. (271 KB)
  ©Copyright 2007 by Elsevier Inc. Definitive version available from ScienceDirect.
  
• A. Israeli and D. G. Feitelson, “Success of open source projects: patterns of downloads and releases with time”. In IEEE Intl. Conf. Software Science, Technology, & Engineering, pp. 87-94, Oct 2007. (160 KB)
  ©Copyright 2007 by IEEE. Definitive version available from IEEE Xplore.
• A. Israeli and D. G. Feitelson, Characterizing Software Maintenance Categories Using the Linux Kernel. Technical Report 2009-10, School of Computer Science and Engineering, The Hebrew University of Jerusalem, May 2009. (260 KB)
• A. Israeli and D. G. Feitelson, “The Linux kernel as a case study in software evolution”. J. Syst. & Softw., to appear. (345 KB)
  ©Copyright 2009 by Elsevier Inc. Definitive version available from ScienceDirect.
  A tar file with our measured metrics for all functions of all distributions is available. (WARNING: 1.7 GB)
  

Architecture

• D. Citron, D. G. Feitelson, and L. Rudolph, “Accelerating multi-media processing by implementing memoing in multiplication and division units”. In Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 252-261, Oct 1998.
  ©Copyright 1998 by ACM, Inc. Definitive version available from the ACM Digital Library.
• D. Citron and D. G. Feitelson, The Structure of Lookup Tables in Instruction Memoization. Technical Report 2000-4, Inst. Computer Science, The Hebrew University of Jerusalem, Mar 2000. (432 KB)
• D. Citron and D. G. Feitelson, Hardware Memoization of Mathematical and Trigonometric Functions. Technical Report 2000-7, Inst. Computer Science, The Hebrew University of Jerusalem, May 2000. (391 KB)
• D. Citron and D. G. Feitelson, “Revisiting instruction level reuse”. In Workshop on Duplicating, Deconstructing, and Debunking, May 2002. (134 KB)
• D. Citron and D. G. Feitelson, “"Look it up" or "do the math": an energy, area, and timing analysis of instruction reuse and memoization”. In 3rd Workshop on Power-Aware Computer Systems, B. Falsafi and T. N. Vijaykumar (Eds.), pp. 101-116, Springer-Verlag, Dec 2003. Lecture Notes in Computer Science Vol. 3164. (805 KB)
  ©Copyright 2004 by Springer-Verlag. Definitive version available from Springer LINK.
  
• Y. Etsion and D. G. Feitelson, Cache Insertion Policies to Reduce Bus Traffic and Cache Conflicts. Technical Report 2006-4, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Feb 2006. (3 MB)
  
• Y. Etsion and D. G. Feitelson, “Probabilistic prediction of temporal locality”. IEEE Comput. Architecture Let. 6(1), Jan-Jun 2007.
  ©Copyright 2007 by IEEE. Definitive version available from IEEE CS Digital Library.
• Y. Etsion and D. G. Feitelson, “L1 cache filtering through random selection of memory references”. In 16th Parallel Architectures and Compilation Techniques, pp. 235-244, Sep 2007.
  ©Copyright 2007 by IEEE. Definitive version available from IEEE Xplore.

Parallel Job Scheduling

>> Workshop Proceedings

• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 1997. Lecture Notes in Computer Science Vol. 1291.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 1998. Lecture Notes in Computer Science Vol. 1459.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 1999. Lecture Notes in Computer Science Vol. 1659.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2000. Lecture Notes in Computer Science Vol. 1911.
• D. G. Feitelson and L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2001. Lecture Notes in Computer Science Vol. 2221.
• D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2002. Lecture Notes in Computer Science Vol. 2537.
• D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2003. Lecture Notes in Computer Science Vol. 2862.
• D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2004. Lecture Notes in Computer Science Vol. 3277.
• D. G. Feitelson, E. Frachtenberg, L. Rudolph, and U. Schwiegelshohn (Eds.), Job Scheduling Strategies for Parallel Processing. Springer-Verlag, 2005. Lecture Notes in Computer Science Vol. 3834.

>> General Overviews

• D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994.
  Revised version from August 1997 (388 KB), or shorter version (245 KB).
• D. G. Feitelson and L. Rudolph, “Job scheduling for parallel supercomputers”. In Encyclopedia of Computer Science and Technology, A. Kent and J. G. Williams (Eds.), Vol. 38, pp. 287-314, Marcel Dekker, Inc., 1998.
  Largely based on
  • D. G. Feitelson and L. Rudolph, “Parallel job scheduling: issues and approaches”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-18, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949. (57 KB)
    ©Copyright 1995 by Springer-Verlag. Definitive version available from Springer LINK.
  • D. G. Feitelson and L. Rudolph, “Toward convergence in job schedulers for parallel supercomputers”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 1-26, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162. (75 KB)
    ©Copyright 1996 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, L. Rudolph, U. Schweigelshohn, K. Sevcik, and P. Wong, “Theory and practice in parallel job scheduling”. In Job Scheduling Strategies for Parallel Processing D. G. Feitelson and L. Rudolph (Eds.), pp. 1-34, Springer-Verlag, 1997. Lecture Notes in Computer Science Vol. 1291. (95 KB)
  ©Copyright 1997 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, “Scheduling parallel jobs on clusters”. In High Performance Cluster Computing, Vol 1: Architectures and Systems, Rajkumar Buyya (Ed.), pp. 519-533, Prentice-Hall, 1999. (56 KB)
  Translated to Chinese.
• A. W. Mu'alem and D. G. Feitelson, “Preemptive bicriteria scheduling for parallel jobs: off-line and on-line algorithms”. Multidisciplinary Intl. Conf. on Scheduling: Theory and Applications, Aug 2003. (85 KB)
• D. G. Feitelson, “Metrics for parallel job scheduling and their convergence”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 188-206, Springer-Verlag, 2001. Lecture Notes in Computer Science Vol. 2221. (242 KB)
  ©Copyright 2001 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, “Parallel job scheduling --- a status report”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 1-16, Springer-Verlag, 2004. Lecture Notes in Computer Science Vol. 3277. (34 KB)
  ©Copyright 2004 by Springer-Verlag. Definitive version available from Springer LINK.
• E. Frachtenberg and D. G. Feitelson, “Pitfalls in parallel job scheduling evaluation”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, E. Frachtenberg, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 257-282, Springer-Verlag, 2005. Lecture Notes in Computer Science Vol. 3834.
  ©Copyright 2005 by Springer-Verlag. Definitive version available from Springer LINK.

>> Gang Scheduling and DHC

• D. G. Feitelson and L. Rudolph, “Distributed hierarchical control for parallel processing”. Computer 23(5), pp. 65-77, May 1990.
  ©Copyright 1990 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• D. G. Feitelson and L. Rudolph, “Gang scheduling performance benefits for fine-grain synchronization”. J. Parallel & Distributed Comput. 16(4), pp. 306-318, Dec 1992. (109 KB)
  ©Copyright 1992 by Academic Press.
• D. G. Feitelson and L. Rudolph, “Coscheduling based on run-time identification of activity working sets”. Intl. J. Parallel Programming 23(2), pp. 135-160, Apr 1995. (79 KB)
• D. G. Feitelson, “Packing schemes for gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 89-110, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162. (79 KB)
  ©Copyright 1995 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson and L. Rudolph, “Evaluation of design choices for gang scheduling using distributd hierarchical control”. J. Parallel & Distributed Comput. 35(1), pp. 18-34, May 1996.
  ©Copyright 1996 by Academic Press. Definitive version available from ScienceDirect.
  Largely based on
  • D. G. Feitelson and L. Rudolph, “Mapping and scheduling in a shared parallel environment using distributed hierarchical control”. In Int'l Conf. Parallel Processing, vol. I, pp. 1-8, Aug 1990.
  • D. G. Feitelson and L. Rudolph, “Wasted resources in gang scheduling”. In 5th Jerusalem Conf. Information Technology, pp. 127-136, IEEE Computer Society Press, Oct 1990.
    ©Copyright 1990 by IEEE. Definitive version available from IEEE Xplore.
• D. G. Feitelson and M. A. Jette, “Improved utilization and responsiveness with gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), pp. 238-261, Springer-Verlag, 1997. Lecture Notes in Computer Science Vol. 1291. (77 KB)
  ©Copyright 1997 by Springer-Verlag. Definitive version available from Springer LINK.
• A. Batat and D. G. Feitelson, “Gang scheduling with memory considerations”. In 14th Intl. Parallel and Distributed Processing Symp., pp. 109-114, May 2000. (115 KB)
  ©Copyright 2000 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 99-33 (161 KB).
• Y. Etsion and D. G. Feitelson, “User-level communication in a system with gang scheduling”. In 15th Intl. Parallel and Distributed Processing Symp., Apr 2001.
  ©Copyright 2001 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 2000-39 (110 KB).
• Y. Wiseman and D. G. Feitelson, “Paired gang scheduling”. IEEE Trans. Parallel & Distributed Syst., 14(6), pp. 581-592, Jun 2003. (932 KB)
  ©Copyright 2003 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  
• E. Frachtenberg, D. G. Feitelson, F. Petrini, and J. Fernandez, “Adaptive parallel job scheduling with flexible coscheduling”. IEEE Trans. Parallel & Distributed Syst. 16(11), pp. 1066-1077, Nov 2005.
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Largely based on
  • E. Frachtenberg, D. G. Feitelson, F. Petrini, and J. Fernandez, “Flexible CoScheduling: mitigating load imbalance and improving utilization of heterogeneous resources”. In 17th Intl. Parallel and Distributed Processing Symp., Apr 2003. (56 KB)
    ©Copyright 2003 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
    Best Paper Award in Architecture Track
    
  • E. Frachtenberg, D. G. Feitelson, J. Fernandez, and F. Petrini, “Parallel job scheduling under dynamic workloads”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 208-227, Springer-Verlag, 2003. Lecture Notes in Computer Science Vol. 2862.
    ©Copyright 2003 by Springer-Verlag. Definitive version available from Springer LINK.

>> Backfilling

• A. W. Mu'alem and D. G. Feitelson, “Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling”. IEEE Trans. Parallel & Distributed Syst. 12(6), pp. 529-543, Jun 2001. (658 KB)
  ©Copyright 2001 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  This supercedes the preliminary version:
  • D. G. Feitelson and A. Mu'alem Weil, “Utilization and predictability in scheduling the IBM SP2 with backfilling”. In 12th Intl. Parallel Processing Symp., pp. 542-546, Apr 1998.
    ©Copyright 1998 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• D. Talby and D. G. Feitelson, “Supporting priorities and improving utilization of the IBM SP2 scheduler using slack-based backfilling”. In 13th Intl. Parallel Processing Symp., pp. 513-517, Apr 1999. (35 KB)
  ©Copyright 1999 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 98-13 (95 KB).
• D. G. Feitelson, “Experimental analysis of the root causes of performance evaluation results: a backfilling case study”. IEEE Trans. Parallel & Distributed Syst. 16(2), pp. 175-182, Feb 2005. (69 KB)
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Extended version available as Technical Report 2002-4. (105 KB)
• D. Talby and D. G. Feitelson, “Improving and stabilizing parallel computer performance using adaptive backfilling”. In 19th Intl. Parallel and Distributed Processing Symp., Apr 2005. (134 KB)
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  
• E. Shmueli and D. G. Feitelson, “Backfilling with lookahead to optimize the packing of parallel jobs”. J. Parallel & Distributed Comput. 65(9), pp. 1090-1107, Sep 2005. (133 KB)
  ©Copyright 2005 by Elsevier Inc. Definitive version available from ScienceDirect.
  Largely based on
  • E. Shmueli and D. G. Feitelson, “Backfilling with lookahead to optimize the performance of parallel job scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 228-251, Springer-Verlag, 2003. Lecture Notes in Computer Science Vol. 2862.
    ©Copyright 2003 by Springer-Verlag. Definitive version available from Springer LINK.
• D. Tsafrir, Y. Etsion, and D. G. Feitelson, “Modeling user runtime estimates”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, E. Frachtenberg, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 1-35, Springer-Verlag, 2005. Lecture Notes in Computer Science Vol. 3834.
  ©Copyright 2005 by Springer-Verlag. Definitive version available from Springer LINK.
• D. Tsafrir and D. G. Feitelson, “The dynamics of backfilling: solving the mystery of why increased inaccuracy may help”. In IEEE Intl. Symp. Workload Characterization, pp. 131-141, Oct 2006. (349 KB)
  ©Copyright 2006 by IEEE. Definitive version available from IEEE Xplore.
• D. Tsafrir, Y. Etsion, and D. G. Feitelson, “Backfilling using system-generated predictions rather than user runtime estimates”. IEEE Trans. Parallel & Distributed Syst. 18(6), pp. 789-803, Jun 2007. (512 KB)
  ©Copyright 2007 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
• Avi Nissimov and Dror G. Feitelson, “Probabilistic backfilling”. In Job Scheduling Strategies for Parallel Processing, E. Frachtenberg and U. Schwiegelshohn (Eds.), pp. 102-115, Springer-Verlag, 2007. Lecture Notes in Computer Science Vol. 4942. (235 KB)
  ©Copyright 2003 by Springer-Verlag. Definitive version available from Springer LINK.
• E. Shmueli and D. G. Feitelson, “On simulation and design of parallel-systems schedulers: are we doing the right thing?”. IEEE Trans. Parallel & Distributed Syst. 20(7), pp. 983-996, Jul 2009. (444 KB)
  ©Copyright 2009 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  

Parallel Systems

• D. G. Feitelson, “On the interpretation of Top500 data”. Intl. J. High Performance Comput. Applications, 13(2), pp.146-153, Summer 1999. (217 KB)
  ©Copyright 1999 by Sage Publications.
  Color figures for all years in postscript. (47 KB)
• D. G. Feitelson, “The supercomputer industry in light of the Top500 data”. Comput. in Science & Engineering 7(1), pp. 42-47, Jan/Feb 2005. (50 KB)
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  

>> The ParPar Project and Clusters

• D. G. Feitelson, A. Batat, G. Benhanokh, D. Er-El, Y. Etsion, A. Kavas, T. Klainer, U. Lublin, and M. A. Volovic, “The ParPar system: A software MPP”. In High Performance Cluster Computing, Vol 1: Architectures and Systems, Rajkumar Buyya (Ed.), pp. 754-770, Prentice-Hall, 1999. (108 KB)
  Translated to Chinese.
• Y. Etsion, M. Raizman, and D. G. Feitelson, Topology and Routing in Clusters: From Theory to Practice. Technical Report 99-??, Dec 1999 (266 KB).
• A. Batat and D. G. Feitelson, “Gang scheduling with memory considerations”. In 14th Intl. Parallel and Distributed Processing Symp., pp. 109-114, May 2000. (115 KB)
  ©Copyright 2000 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 99-33 (161 KB).
• A. Kavas, D. Er-El, and D. G. Feitelson, “Using multicast to pre-load jobs on the ParPar cluster”. Parallel Computing 27(3) pp. 315-327, Feb 2001.
  ©Copyright 2001 Elsevier Science B.V. Definitive version available from ScienceDirect.
  Preliminary version available as Technical Report 98-14 (54 KB).
• Y. Etsion and D. G. Feitelson, “User-level communication in a system with gang scheduling”. In 15th Intl. Parallel and Distributed Processing Symp., Apr 2001.
  ©Copyright 2001 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 2000-39 (110 KB).
• A. Kavas and D. G. Feitelson, “Comparing Windows NT, Linux, and QNX as the basis for cluster systems”. Concurrency and Computation -- Practice and Experience 13(15) pp. 1303-1332, Dec 2001.
  ©Copyright 2001 John Wiley & Sons, Ltd. Definitive version available from Wiley InterScience.
  Original version available as a Technical Report (75 KB).
  A tar file with the benchmarks used is available. (3 MB)
• D. G. Feitelson, “On the scalability of centralized control”. In Workshop on System Management Tools for Large-Scale Parallel System, Apr 2005. (77 KB)
  ©Copyright 2005 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.

>> The Makbilan Project and ParC

• Y. Ben-Asher and D. G. Feitelson, Performance and Overhead Measurements on the Makbilan. Technical Report 91-5, Dept. Computer Science, The Hebrew University of Jerusalem, Oct 1991. (55 KB)
• D. G. Feitelson, Y. Ben-Asher, M. Ben Ezra, I. Exman, L. Picherski, L. Rudolph, and D. Zernik, “Issues in run-time support for tightly-coupled parallel processing”. In 3rd Symp. Experiences with Distributed & Multiprocessor Syst., pp. 27-42, USENIX, Mar 1992. (97 KB)
• K. Shteiman, D. Feitelson, L. Rudolph, and I. Exman, “Envelopes in adaptive local queues for MIMD load balancing”. In Parallel Processing: CONPAR 92 - VAPP V, pp. 479-484, Springer-Verlag, Sep 1992. Lecture Notes in Computer Science Vol. 634. (42KB)
  ©Copyright 1992 by Springer-Verlag. Definitive version available from Springer LINK.
• D. Citron, D. G. Feitelson, and I. Exman, “Parallel activity roadmaps”. In Parallel Computing: Trends and Applications, G. R. Joubert, D. Trystram, F. J. Peters, and D. J. Evans (Eds.), pp. 593-596, Elsevier, 1994. (66 KB)
• Y. I. Friedman, D. G. Feitelson, and I. Exman, “The parallel break construct, or how to kill an activity tree”. In 10th Intl. Parallel Processing Symp., pp. 230-234, Apr 1996.
  ©Copyright 1996 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 91-20 (65 KB).
• Y. Ben-Asher, D. G. Feitelson, and L. Rudolph, “ParC - an extension of C for shared memory parallel processing”. Software - Pract. & Exp. 26(5), pp. 581-612, May 1996. (126 KB)
  ©Copyright 1996 by John Wiley & Sons. Definitive version available from Wiley InterScience

>> Runtime Support in Parallel Systems

• D. G. Feitelson and L. Rudolph, “Implementation of a wait-free synchronization primitive that solves n-process consensus”. Inf. Process. Lett. 32, pp. 81-83, Jul 1989. (38 KB)
  ©Copyright 1989 by Elsevier. Definitive version available from ScienceDirect
• D. G. Feitelson, Communicators: Object-Based Multiparty Interactions for Parallel Programming. Technical Report 91-12, Dept. Computer Science, The Hebrew University of Jerusalem, Nov 1991. (83 KB)
• D. G. Feitelson, “Deadlock detection without wait-for graphs”. Parallel Computing 17(12), pp. 1377-1383, Dec 1991. (51 KB)
• G. Aharoni, D. G. Feitelson, and A. Barak, “A run-time algorithm for managing the granularity of parallel functional programs”. J. Functional Programming 2(4), pp. 387-405, Oct 1992. (98 KB)
• D. Tsafrir and D. G. Feitelson, “Barrier synchronization on a loaded SMP using two-phase waiting algorithms”. In 16th Intl. Parallel and Distributed Processing Symp., Apr 2002. (268 KB)
  ©Copyright 2002 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Original extended version available as Technical Report 2001-11 (277 KB).

Parallel File Systems and I/O

• P. F. Corbett, S. J. Baylor, and D. G. Feitelson, “Overview of the Vesta parallel file system”. In Proc. IPPS '93 Workshop on Input/Output in Parallel Computer Systems, pp. 1-16, Apr 1993.
  Reprinted in Comput. Arch. News 21(5), pp. 7-14, Dec 1993.
• P. F. Corbett, D. G. Feitelson, J.-P. Prost, and S. J. Baylor, “Parallel access to files in the Vesta file system”. In Supercomputing '93, pp. 472-481, Nov 1993.
  ©Copyright 1993 by IEEE. Definitive version available from the ACM Digital Library or IEEE Xplore.
• D. G. Feitelson, “Terminal I/O for massively parallel systems”. In Scalable High Performance Comput. Conf., pp. 263-270, May 1994. (100 KB)
  ©Copyright 1994 by IEEE. Definitive version available from IEEE Xplore.
  Work received an IBM Outstanding Technical Achievement Award
  
• P. F. Corbett and D. G. Feitelson, Vesta File System Programmer's Reference, Version 1.01. Research Report RC 19898 (88058), IBM T. J. Watson Research Center, Oct 1994.
• P. F. Corbett, D. G. Feitelson, J-P. Prost, G. S. Almasi, S. J. Baylor, A. S. Bolmarcich, Y. Hsu, J. Satran, M. Snir, R. Colao, B. D. Herr, J. Kavaky, T. R. Morgan, and A. Zlotek, “Parallel file systems for the IBM SP computers”. IBM Syst. J. 34(2), pp. 222-248, 1995.
  ©Copyright 1995 IBM. Definitive version available from the IBM Technical Journals site.
• D. G. Feitelson, P. F. Corbett, S. J. Baylor, and Y. Hsu, “Parallel I/O subsystems in massively parallel supercomputers”. IEEE Parallel & Distributed Technology 3(3), pp. 33-47, Fall 1995.
  ©Copyright 1995 by IEEE. Definitive version available from the IEEE Computer Society Digital Library.
  Re-published in High Performance Mass Storage and Parallel I/O: Technologies and Applications, H. Jin, T. Cortes, and R. Buyya (Ed.), pp. 389-407, IEEE Press and Wiley, 2001.
• D. G. Feitelson, P. F. Corbett, Y. Hsu, and J.-P. Prost, “Parallel I/O systems and interfaces for parallel computers”. Should appear in Multiprocessor Systems - Design and Integration, C. L. Wu (Ed.), World Scientific Pub. Co., if that book is ever published (don't count on it 8-(. (104 KB)
• P. Corbett, D. Feitelson, S. Fineberg, Y. Hsu, B. Nitzberg, J.-P. Prost, M. Snir, B. Traversat, and P. Wong, “Overview of the MPI-IO parallel I/O interface”. In Input/Output in Parallel and Distributed Computer Systems, R. Jain, J. Werth, and J. C. Browne (Eds.), Kluwer Academic Publishers, 1996, pp. 127-146. (63 KB)
  
  • Previously appeared in IPPS '95 Workshop on Input/Output in Parallel and Distributed Systems, pp. 1-15, Apr 1995
  • Re-published in High Performance Mass Storage and Parallel I/O: Technologies and Applications, H. Jin, T. Cortes, and R. Buyya (Ed.), pp. 477-487, IEEE Press and Wiley, 2001.
• P. F. Corbett and D. G. Feitelson, “The Vesta parallel file system”. ACM Trans. Comput. Syst. 14(3), pp. 225-264, Aug 1996. (174 KB)
  ©Copyright 1996 by ACM, Inc. Definitive version available from the ACM Digital Library.
  Largely based on
  • P. F. Corbett and D. G. Feitelson, “Design and implementation of the Vesta parallel file system”. In Scalable High Performance Comput. Conf., pp. 63-70, May 1994.
    ©Copyright 1994 by IEEE. Definitive version available from IEEE Xplore.
  • D. G. Feitelson, P. F. Corbett, and J.-P. Prost, “Performance of the Vesta parallel file system”. In 9th Intl. Parallel Processing Symp., pp. 150-158, Apr 1995.
    ©Copyright 1995 by IEEE. Definitive version available from IEEE Xplore.
  Re-published in High Performance Mass Storage and Parallel I/O: Technologies and Applications, H. Jin, T. Cortes, and R. Buyya (Ed.), pp. 285-308, IEEE Press and Wiley, 2001.
• D. G. Feitelson and T. Klainer, “XML, hyper-media, and Fortran I/O”. In High Performance Mass Storage and Parallel I/O: Technologies and Applications, H. Jin, T. Cortes, and R. Buyya (Ed.), pp. 633-644, IEEE Press and Wiley, 2001. (105 KB)

Other Topics

>> Optics and Computing

• D. G. Feitelson, Optical Computing: A Survey for Computer Scientists. MIT Press, 1988. (cover 170 KB)
  Selected as Best New Professional and Scholarly Publishing Book in Computer Science for 1988 by the Association of American Publishers
  Translated into Japanese, Morikita Press, Tokyo, 1991. (cover 171 KB)
  Published in paperback, MIT Press, 1992.
• D. G. Feitelson, L. Rudolph, and E. Schenfeld, “Limitations on optical free-space crossbar-like interconnection networks”. In Optical Interconnections and Networks, pp. 41-52, Mar 1990. Proc. SPIE vol. 1281. (59 KB)
• D. G. Feitelson, L. Rudolph, and E. Schenfeld, “A three-dimensional optical interconnection network with distributed control”. Intl. J. Optoelectronics 10(3), pp. 163-177, 1995.
• D. G. Feitelson and L. Rudolph, The Promise of Optical Free-Space Interconnections for Concurrent Memory Access. Technical Report 95-6, Inst. Computer Science, The Hebrew University of Jerusalem, Jun 1995. (50 KB)
• D. Er-El and D. G. Feitelson, “Communication models for a free-space optical cross-connect switch”. J. Supercomput. 27(1), pp. 19-48, Jan 2004. (122 KB)
  ©Copyright 2004 Kluwer Academic Publishers. Definitive version available from Kluwer online.
  

>> The BoW Project and Digital Libraries

• D. G. Feitelson, The BoW Project. Technical Report 99-30, Inst. Computer Science, The Hebrew University of Jerusalem, Oct 1999. (98 KB)
• D. G. Feitelson, “Cooperative indexing, classification and evaluation in BoW”. In 7th IFCIS Intl. Conf. Cooperative Information Systems, O. Etzion and P. Scheuermann (Eds.), pp. 66-77, Springer-Verlag, Sep 2000. Lecture Notes in Computer Science Vol. 1901. (103 KB)
  ©Copyright 2000 by Springer-Verlag. Definitive version available from Springer LINK.
• D. G. Feitelson and A. Kremer, Design and Implementation of the BoW User Interface. Technical Report 2000-40, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Sep 2000; revised version, Nov 2001. (240 KB)
• D. G. Feitelson, From Digital Libraries to RIAL Electronic Publishing. Technical Report 2001-4, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jan 2001. (150 KB)
• M. Geffet and D. G. Feitelson, “Hierarchical indexing and document matching in BoW”. In 1st ACM/IEEE Joint Conf. Digital Libraries, pp. 259-267, Jun 2001. (252 KB)
  ©Copyright 2001 by ACM, Inc. Definitive version available from the ACM Digital Library.
• D. G. Feitelson and U. Yovel, “Predictive ranking of computer scientists using CiteSeer data”. J. Documentation 60(1), pp. 44-61, Jan 2004. (282 KB)
  ©Copyright 2004 by Emerald Group Publishing Ltd. Definitive version available from Emerald Insight.
• D. G. Feitelson, “On identifying name equivalences in digital libraries”. Information Research 9(4) paper 192, Jul 2004. (67 KB)
  Definitive version available FOR FREE from http://InformationR.net/ir/9-4/paper192.html.
• M. Zhitomirsky-Geffet, D. G. Feitelson, E. Frachtenberg, and Y. Wiseman, “A unified strategy for search and result representation for an online bibliographical catalog”. Online Information Rev. 33(3), pp. 511-536, 2009. (432 KB)
  ©Copyright 2009 by Emerald Group Publishing Ltd. Definitive version available from Emerald Insight.

>> Miscellanea

• D. Dolev, D. G. Feitelson, and H. Sompolinsky, Majority Voting in the Presence of Random Voters. Research Report RJ 6538 (63339), IBM Almaden Research Center, Oct 1988. (88 KB)
• M. Treinin and D. G. Feitelson, “Unequal cell division as a driving force during differentiation”. J. Theor. Biology 160(1), pp. 85-95, Jan 1993.
  ©Copyright 1993 by Elsevier. Definitive version available from ScienceDirect.
• D. G. Feitelson, Comparing Partitions with Spie Charts. Technical Report 2003-87, School of Computer Science and Engineering, The Hebrew University of Jerusalem, Dec 2003. (55 KB)
  Featured in the “bright ideas” page of Michael Friendly's Gallery of Data Visualization.
  An example and R code available from the R Graph Gallery.
• D. Tsafrir, K. Ouaknine, and D. G. Feitelson, “Reducing performance evaluation sensitivity and variability by input shaking”. In 15th Conf. Modeling, Analysis, & Simulation of Comput. & Telecomm. Syst., pp. 231-237, Oct 2007. (185 KB)
  ©Copyright 2007 by IEEE. Definitive version available from IEEE Xplore.
  

To home page