A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors

DOI10.1016/0743-7315(92)90012-CzbMATH Open0797.68021MaRDI QIDQ1208577FDOQ1208577

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Recommendations

A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
scientific article; zbMATH DE number 2042272
On cluster resource allocation for multiple parallel task graphs
scientific article
A heuristic algorithm for scheduling multiprocessor tasks in a grid computing environment
A heuristic for scheduling task graphs with communication delays onto multiprocessors
Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization
Parallel Processing and Applied Mathematics

zbMATH Keywords

scheduling parallel architectures performance comparison clustering of task graphs dominant sequence clustering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (25)

Benchmarking and comparison of the task graph scheduling algorithms
Clustering a DAG for CAD databases
List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS
CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
Methods of resource management in problem-oriented computing environment
On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
Communication contention in APN list scheduling algorithm
Two-way dominant sequence clustering for processor scheduling
Extending IC-scheduling via the sweep algorithm
On clustering \textsc{Dag}s for task-hungry computing platforms
Title not available (Why is that?)
Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments
SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
Revisiting communication code generation algorithms for message-passing systems
Bayesian network modeling of the consensus between experts: an application to neuron classification
Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures
A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
Parallel Machine Scheduling with Uncertain Communication Delays
Clustering and scheduling method based on task duplication
Resource allocation algorithm for light communication grid-based workflows within an SLA context

This page was built for publication: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208577)