Stable Adaptive Work-Stealing for Concurrent Multi-core Runtime Systems

No abstract is available for this paper.

• Publication year

  2011

• Venue

  IEEE International Conference on High Performance Computing and Communications

• Publication date

  2011-09-02

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/HPCC.2011.24
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback

  2011cited by this paper
• Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs

  2010cited by this paper
• Competitive Two-Level Adaptive Scheduling Using Resource Augmentation

  2009cited by this paper
• Evaluation of OpenMP Task Scheduling Strategies

  2008influential reference
• John von Neumann Institute for Computing Enhancing OpenMP and Its Implementation for Programming Multicore Systems

  2008influential reference
• Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm

  2008cited by this paper
• Amdahl's Law in the Multicore Era

  2008cited by this paper
• Scheduling in the Dark ( Improved Result )

  2007cited by this paper
• Provably Efficient Online Nonclairvoyant Adaptive Scheduling

  2007cited by this paper
• Intel threading building blocks - outfitting C++ for multi-core processor parallelism

  2007cited by this paper
• Adaptive work stealing with parallelism feedback

  2007cited by this paper
• Provably Efficient Two-Level Adaptive Scheduling

  2006cited by this paper
• Adaptive Scheduling with Parallelism Feedback

  2006influential reference
• An empirical evaluation of work stealing with parallelism feedback

  2006cited by this paper
• The Future of Microprocessors

  2005cited by this paper
• Scheduling in the dark

  1999influential reference
• The implementation of the Cilk-5 multithreaded language

  1998influential reference
• Scheduling multithreaded computations by work stealing

  1994cited by this paper
• A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors

  1993influential reference
• Space-efficient scheduling of multithreaded computations

  1993cited by this paper
• The Parallel Evaluation of General Arithmetic Expressions

  1974cited by this paper
• Bounds for certain multiprocessing anomalies

  1966cited by this paper

• Waste-Efficient Work Stealing

  2026cites this paper
• Design and Implementation of a Criticality- and Heterogeneity-Aware Runtime System for Task-Parallel Applications

  2021influential citation
• Scheduling Parallel Computations by Work Stealing: A Survey

  2018cites this paper
• CHRT: A criticality- and heterogeneity-aware runtime system for task-parallel applications

  2017cites this paper
• Effective cooperative scheduling of task-parallel applications on multiprogrammed parallel architectures

  2015cites this paper
• Palirria: accurate on‐line parallelism estimation for adaptive work‐stealing

  2014cites this paper
• Scalable hierarchical scheduling for malleable parallel jobs on multiprocessor-based systems

  2014cites this paper
• Performance analysis of current parallel programming models for many-core systems

  2013cites this paper
• Cooperative user- and system-level scheduling of task-centric parallel programs

  2013cites this paper