Provably Efficient Online Nonclairvoyant Adaptive Scheduling

Yuxiong He,W. Hsu,C. Leiserson

Published 2007 in IEEE Transactions on Parallel and Distributed Systems

ABSTRACT

No abstract is available for this paper.

PUBLICATION RECORD

Publication year
2007
Venue
IEEE Transactions on Parallel and Distributed Systems
Publication date
2007-03-26
Fields of study
Computer Science
Identifiers
DOI 10.1109/TPDS.2008.39
External record
Open on Semantic Scholar
Source metadata
Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

No claims are published for this paper.

CONCEPTS

No concepts are published for this paper.

REFERENCES

Work Stealing with Parallelism Feedback
2008cited by this paper
Adaptive work stealing with parallelism feedback
2007cited by this paper
MULTIPROCESSOR JOB
2007cited by this paper
Adaptive Scheduling with Parallelism Feedback
2006cited by this paper
An empirical evaluation of work stealing with parallelism feedback
2006cited by this paper
Provably Efficient Two-Level Adaptive Scheduling
2006cited by this paper
Scheduling malleable tasks with precedence constraints
2005cited by this paper
Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs
2004cited by this paper
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
2004influential reference
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics
2003cited by this paper
Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching
2003cited by this paper
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
2003cited by this paper
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
2003cited by this paper
A Framework for Discrete Event Modelling & Simulation
2002cited by this paper
Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
2001cited by this paper
A model for moldable supercomputer jobs
2001cited by this paper
The Effect of Heavy-Tailed Job Size Distributions on Computer System Design
1999cited by this paper
Efficient approximation algorithms for scheduling malleable tasks
1999cited by this paper
Space-efficient scheduling of nested parallelism
1999cited by this paper
Scheduling in the dark
1999cited by this paper
Smart SMART Bounds for Weighted Response Time Scheduling
1999cited by this paper
Scheduling Adaptively Parallel Jobs
1998cited by this paper
BetaSIM: A framework for discrete event modelling and simulation
1998cited by this paper
Thread Scheduling for Multiprogrammed Multiprocessors
1998cited by this paper
Minimizing flow time nonclairvoyantly
1997cited by this paper
Job Scheduling in Multiprogrammed Parallel Systems
1997cited by this paper
Dynamic vs. Static Quantum-Based Parallel Processor Allocation
1996cited by this paper
A provable time and space efficient implementation of NESL
1996cited by this paper
Using Parallel Program Characteristics in Dynamic Processor Allocation Policies
1996cited by this paper
On Multiprocessor System Scheduling
1996cited by this paper
Exploiting process lifetime distributions for dynamic load balancing
1996cited by this paper
Preemptive scheduling of parallel jobs on multiprocessors
1996cited by this paper
Packing Schemes for Gang Scheduling
1996cited by this paper
On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems
1995cited by this paper
Competitive dynamic multiprocessor allocation for parallel applications
1995cited by this paper
Competitive Analysis of Dynamic Multiprocessor Allocation Strategies
1995cited by this paper
Scheduling parallelizable tasks to minimize average response time
1994cited by this paper
Scheduling multithreaded computations by work stealing
1994cited by this paper
Non-clairvoyant scheduling
1994cited by this paper
Scheduling parallel tasks to minimize average response time
1994cited by this paper
Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems
1994cited by this paper
Space-efficient scheduling of multithreaded computations
1993cited by this paper
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
1993influential reference
A dynamic scheduling method for irregular parallel programs
1992cited by this paper
A simple load balancing scheme for task allocation in parallel machines
1991cited by this paper
Scheduling parallel machines on-line
1991cited by this paper
The Performance of Multiprogrammed Multiprocessor Scheduling Policies
1990cited by this paper
The performance of multiprogrammed multiprocessor scheduling algorithms
1990cited by this paper
Processor scheduling in shared memory multiprocessors
1990cited by this paper
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
1989cited by this paper
Scheduling in multiprogrammed parallel systems
1988cited by this paper
Implementation of multilisp: Lisp on a multiprocessor
1984cited by this paper
Executing functional programs on a virtual tree of processors
1981cited by this paper
Bounds on Multiprocessing Timing Anomalies
1969cited by this paper
Human behavior and the principle of least effort
1949cited by this paper

CITED BY

Scheduling Out-Trees Online to Optimize Maximum Flow
2024cites this paper
Entropy and improved k‐nearest neighbor search based under‐sampling (ENU) method to handle class overlap in imbalanced datasets
2023cites this paper
Responsive Parallel Computation
2021cites this paper
Multi-Agent Semi-Siamese Training for Long-Tail and Shallow Face Learning
2021cites this paper
Non-clairvoyant Scheduling of Coflows
2020cites this paper
TSLBS: ?A time-sensitive and load balanced scheduling approach to wireless sensor actor networks
2019cites this paper
Semi-Clairvoyant Scheduling in Data Analytics Systems
2019cites this paper
COBRA: Toward Provably Efficient Semi-Clairvoyant Scheduling in Data Analytics Systems
2018cites this paper
µTune: Auto-Tuned Threading for OLDI Microservices
2018cites this paper
Scheduling Parallelizable Jobs Online to Maximize Throughput
2018cites this paper
New Algorithms for Balancing Energy Consumption and Performance in Computational Clusters
2017cites this paper
Parallel Real-Time Scheduling for Latency-Critical Applications
2017cites this paper
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput
2017cites this paper
Combining performance and priority for scheduling resizable parallel applications
2016cites this paper
TPC: Target-Driven Parallelism Combining Prediction and Correction to Reduce Tail Latency in Interactive Services
2016cites this paper
Managing tail latency in interactive services for multicore servers
2016cites this paper
Adaptive demand‐aware work‐stealing in multi‐programmed multi‐core architectures
2016cites this paper
Work stealing for interactive services to meet target latency
2016influential citation
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time
2016cites this paper
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
2016cites this paper
. 2 0 . 3 0 . 4 0 . 5 4 12 20 28 36 44 52 Pr ob ab ili ty Request Total Work ( ms )
2015cites this paper
Few-to-Many: Incremental Parallelism for Reducing Tail Latency in Interactive Services
2015cites this paper
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
2014influential citation
DWS: Demand-aware Work-Stealing in Multi-programmed Multi-core Architectures
2014cites this paper
Scalable hierarchical scheduling for malleable parallel jobs on multiprocessor-based systems
2014influential citation
A New Approach for Buffering Space in Scheduling Unknown Service Time Jobs in a Computational Cluster with Awareness of Performance and Energy Consumption
2014cites this paper
Process Cooperativity as a Feedback Metric in Concurrent Message-Passing Languages
2014cites this paper
A generalized model for investigating scheduling schemes in computational clusters
2013cites this paper
Adaptive parallelism for web search
2013cites this paper
A queuing network model for minimizing the total makespan of computational grids
2012cites this paper
Adaptive Scheduling Algorithm Based on Dynamic Core-Resource Partitions for Many-Core Processor Systems
2012cites this paper
Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback
2011cites this paper
An Observation on Performance Analysis of Grid Scheduler
2011cites this paper
A clairvoyant site allocation policy based on service demands of jobs in a computational grid
2011cites this paper
Stable Adaptive Work-Stealing for Concurrent Multi-core Runtime Systems
2011cites this paper
Performance Analysis of Adaptive Resource Clustering in Grid
2011cites this paper
Provably-efficient adaptive scheduling of multiprocessors for performance and energy
2011influential citation
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
2010cites this paper
Clairvoyant site allocation of jobs with highly variable service demands in a computational grid
2010cites this paper
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability
2010cites this paper
Energy-efficient multiprocessor scheduling for flow time and makespan
2010cites this paper
Communication cost effective scheduling policies of nonclairvoyant jobs with load balancing in a grid
2009cites this paper
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
2009influential citation
An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach
2009cites this paper
Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules
2008cites this paper
Non-clairvoyant scheduling with precedence constraints
2008cites this paper
Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm
2008cites this paper
Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources
2007cites this paper
Adaptive Scheduling with Parallelism Feedback
2006cites this paper