Using Parallel Program Characteristics in Dynamic Processor Allocation Policies

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Performance evaluation (Print)

• Publication date

  1996-10-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/0166-5316(96)00030-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Coordinated allocation of memory and processors in multiprocessors

  1996cited by this paper
• Maximizing speedup through self-tuning of processor allocation

  1996cited by this paper
• Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling

  1996cited by this paper
• Job Scheduling Strategies for Parallel Processing

  1996cited by this paper
• Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling

  1996cited by this paper
• Exploiting process lifetime distributions for dynamic load balancing

  1996cited by this paper
• Multiprocessor Scheduling for High-Variability Service Time Distributions

  1995cited by this paper
• Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860

  1995cited by this paper
• Scheduling on the Tera MTA

  1995cited by this paper
• The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers

  1995cited by this paper
• Scheduling memory constrained jobs on distributed memory parallel computers

  1995cited by this paper
• Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems

  1994cited by this paper
• Robust Partitioning Policies of Multiprocessor Systems

  1994cited by this paper
• Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems

  1994cited by this paper
• Analysis of the impact of memory in distributed parallel processing systems

  1994cited by this paper
• Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies

  1994influential reference
• Multiprogrammed parallel application scheduling in NUMA multiprocessors

  1994cited by this paper
• On Modeling Partitioned Multiprocessor Systems

  1994cited by this paper
• Processor Scheduling in Multiprogrammed Shared Memory NUMA Multiprocessors

  1993cited by this paper
• A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers

  1993influential reference
• On the importance of parallel application placement in NUMA multiprocessors

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

  1993cited by this paper
• Achieving Service Rate Objectives with Decay Usage Scheduling

  1993cited by this paper
• Performance analysis of job scheduling policies in parallel supercomputing environments

  1993cited by this paper
• Scheduling of Large Scientific Applications on Distributed Memory Multiprocessor Systems

  1993cited by this paper
• The Impact of Operating System Scheduling Policies and Synchronization Methods of the Performance of Parallel Application

  1991cited by this paper
• The impact of operating system scheduling policies and synchronization methods of performance of parallel applications

  1991cited by this paper
• Characterisation of Programs for Scheduling in Multiprogrammed Parallel Systems

  1991cited by this paper
• The Processor Working Set and Its Use in Scheduling Multiprocessor Systems

  1991influential reference
• An analysis of several processor partitioning policies for parallel computers

  1991cited by this paper
• Processor-pool-based scheduling for large-scale NUMA multiprocessors

  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
• The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling

  1990cited by this paper
• Processor scheduling in shared memory multiprocessors

  1990influential reference
• Speedup Versus Efficiency in Parallel Systems

  1989cited by this paper
• Performance of parallel processors

  1989cited by this paper
• Characterizations of parallelism in applications and their use in scheduling

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

  1989influential reference
• Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications

  1988cited by this paper
• Scheduling in multiprogrammed parallel systems

  1988influential reference
• The Design of the UNIX Operating System

  1986cited by this paper
• Load-balancing heuristics and process behavior

  1986cited by this paper
• A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

  1984cited by this paper
• Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp.

  1977cited by this paper
• Queueing Systems, Volume 2: Computer Applications

  1976cited by this paper
• Feedback Queueing Models for Time-Shared Systems

  1968cited by this paper

• Combining performance and priority for scheduling resizable parallel applications

  2016cites this paper
• Systematic Inspection of Scheduling Policies And Algorithms in Grid Computing

  2013cites this paper
• A workload-aware mapping approach for data-parallel programs

  2011cites this paper
• Provably-efficient adaptive scheduling of multiprocessors for performance and energy

  2011influential citation
• Energy-efficient multiprocessor scheduling for flow time and makespan

  2010cites this paper
• Prediction of dynamical, nonlinear, and unstable process behavior

  2009cites this paper
• Extracting and predicting the communication behaviour of parallel applications

  2009cites this paper
• Uma abordagem de predição da dinâmica comportamental de processos para prover autonomia a ambientes distribuídos

  2009cites this paper
• Simulated Performance Analysis of Multiprocessor Dynamic Space-Sharing Scheduling policy

  2009cites this paper
• Grid job scheduling using Route with Genetic Algorithm support

  2008cites this paper
• Provably efficient adaptive scheduling of parallel jobs on multiprocessors

  2008cites this paper
• Feedback-driven threading

  2008cites this paper
• Work Stealing with Parallelism Feedback

  2008cites this paper
• On Simulated Annealing for the Scheduling of Parallel Applications

  2008cites this paper
• Adaptive work-stealing with parallelism feedback

  2008cites this paper
• Feedback-driven threading: power-efficient and high-performance execution of multi-threaded workloads on CMPs

  2008cites this paper
• Provably Efficient Adaptive Scheduling for Parallel Jobs

  2007cites this paper
• Provably Efficient Online Nonclairvoyant Adaptive Scheduling

  2007cites this paper
• Adaptive work stealing with parallelism feedback

  2007cites this paper
• Scheduling in the Dark ( Improved Result )

  2007cites this paper
• Using Operating System Instrumentation and Event Logging to Support User-level Multiprocessor Schedulers

  2006cites this paper
• Adaptive Scheduling with Parallelism Feedback

  2006cites this paper
• Provably Efficient Two-Level Adaptive Scheduling

  2006cites this paper
• An empirical evaluation of work stealing with parallelism feedback

  2006cites this paper
• Using Operating System Instrumentation and Event Logging to Support User-level Multiprocessor Schedulers

  2005cites this paper
• Improving Scheduling Decisions by Using Knowledge About Parallel Applications Resource Usage

  2005cites this paper
• High-throughput image analysis for proteomics

  2005cites this paper
• An Instance-based Learning Approach for Predicting Execution Times of Parallel Applications

  2004cites this paper
• Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs

  2004cites this paper
• Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications

  2004cites this paper
• Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics

  2003cites this paper
• Coordinated Scheduling and Dynamic Performance Analysis in Multiprocessors Systems

  2002cites this paper
• Effective Resource Management for Master-Worker Applications in Opportunistic Environments

  2002cites this paper
• Parallel Models and Job Characterization for System Scheduling

  2001cites this paper
• Adaptive Scheduling for Master-Worker Applications on the Computational Grid

  2000cites this paper
• Performance-driven processor allocation

  2000cites this paper
• Evaluation of an Adaptive Scheduling Strategy for Master-Worker Applications on Clusters of Workstations

  2000cites this paper
• Adaptive Scheduling for Master-Worker Applications on the Computational Grid

  2000cites this paper
• A knowledge-based approach to scheduling jobs in metacomputer environment

  2000cites this paper
• Parallel Job Scheduling: A Performance Perspective

  2000influential citation
• Dynamic Speedup Calculation through Self-Analysis

  1999cites this paper
• Scheduling in the Dark 1

  1999cites this paper
• Scheduling in the dark

  1999cites this paper
• A Historical Application Profiler for Use by Parallel Schedulers

  1997cites this paper
• Job Scheduling in Multiprogrammed Parallel Systems

  1997cites this paper
• A Model For Speedup of Parallel Programs

  1997cites this paper
• A Model for Speedup of Parallel Programs a Model for Speedup of Parallel Programs

  1997cites this paper
• An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors

  1997cites this paper
• Implementing Multiprocessor Scheduling Disciplines

  1997cites this paper
• Parallel Application Characteristics for Multiprocessor Scheduling Policy Design

  1996cites this paper
• Preemptive scheduling of parallel jobs on multiprocessors

  1996cites this paper
• Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling

  1996cites this paper
• Maximizing speedup through self-tuning of processor allocation

  1996cites this paper
• Competitive Analysis of Dynamic Multiprocessor Allocation Strategies

  1995cites this paper