A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
From MaRDI portal
(Redirected from Publication:1208577)
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; zbMATH DE number 177834
- 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
Cited in
(30)- Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
- Benchmarking and comparison of the task graph scheduling algorithms
- Parallel Machine Scheduling with Uncertain Communication Delays
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Revisiting communication code generation algorithms for message-passing systems
- A clustering algorithm for multiprocessor environments using dynamic priority of modules
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
- Bayesian network modeling of the consensus between experts: an application to neuron classification
- Communication contention in APN list scheduling algorithm
- SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
- Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs
- Clustering a DAG for CAD databases
- Clustering and scheduling method based on task duplication
- Resource allocation algorithm for light communication grid-based workflows within an SLA context
- Two-way dominant sequence clustering for processor scheduling
- Extending IC-scheduling via the sweep algorithm
- scientific article; zbMATH DE number 6861895 (Why is no real title available?)
- CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
- A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
- CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
- On cluster resource allocation for multiple parallel task graphs
- Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures
- On clustering \textsc{Dag}s for task-hungry computing platforms
- List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
- Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments
- Methods of resource management in problem-oriented computing environment
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
- A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS
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)
