Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency

No abstract is available for this paper.

• Publication year

  2014

• Venue

  J. Parallel Distributed Comput.

• Publication date

  2014-03-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.jpdc.2013.12.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dynamic Fractional Resource Scheduling versus Batch Scheduling

  2012cited by this paper
• Fair and Efficient Online Adaptive Scheduling for Multiple Sets of Parallel Applications

  2011cited by this paper
• Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback

  2011influential reference
• Speed Scaling for Energy and Performance with Instantaneous Parallelism

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

  2010influential reference
• Design and performance of a scheduling framework for resizable parallel applications

  2010cited by this paper
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework

  2010cited by this paper
• Scalable Hierarchical Scheduling for Multiprocessor Systems Using Adaptive Feedback-Driven Policies

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

  2009cited by this paper
• Scalably scheduling processes with arbitrary speedup curves

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

  2008cited by this paper
• Usher: An Extensible Framework for Managing Clusters of Virtual Machines

  2007cited by this paper
• Competitive online scheduling for server systems

  2007influential reference
• Provably Efficient Online Nonclairvoyant Adaptive Scheduling

  2007influential reference
• Adaptive Scheduling with Parallelism Feedback

  2006influential reference
• Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough

  2006cited by this paper
• Pull-based data broadcast with dependencies: be fair to users, not to items

  2006influential reference
• Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs

  2004cited by this paper
• Xen and the art of virtualization

  2003cited by this paper
• Integrated scheduling: the best of both worlds

  2003cited by this paper
• Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics

  2003cited by this paper
• Speed is as powerful as clairvoyance

  2000cited by this paper
• Performance-driven processor allocation

  2000cited by this paper
• Scheduling in the dark

  1999influential reference
• Static scheduling algorithms for allocating directed task graphs to multiprocessors

  1999cited by this paper
• Online computation and competitive analysis

  1998cited by this paper
• Job Scheduling in Multiprogrammed Parallel Systems

  1997cited by this paper
• Non-clairvoyant scheduling

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

  1993cited by this paper
• Process control and scheduling issues for multiprogrammed shared-memory multiprocessors

  1989influential reference

• A knowledge-driven approach to multi-objective IoT task graph scheduling in fog-cloud computing

  2025cites this paper
• Cooperative and non-cooperative algorithms for distributed parallel jobs scheduling

  2022cites this paper
• A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling

  2020cites this paper
• Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

  2018cites this paper
• An adaptive algorithm for scheduling parallel jobs in meteorological Cloud

  2016cites this paper
• A Novel Hierarchal Scheduling Strategy for Rendering System

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

  2014cites this paper
• Knowledge-Based Systems

  year unknowncites this paper