A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
From MaRDI portal
Publication:1208577
DOI10.1016/0743-7315(92)90012-CzbMath0797.68021MaRDI QIDQ1208577
Apostolos Gerasoulis, Tao Yang
Publication date: 16 May 1993
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
schedulingparallel architecturesperformance comparisonclustering of task graphsdominant sequence clustering
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (19)
Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry ⋮ CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS ⋮ Methods of resource management in problem-oriented computing environment ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS ⋮ Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments ⋮ On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules ⋮ Extending IC-scheduling via the sweep algorithm ⋮ SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS ⋮ On clustering \textsc{Dag}s for task-hungry computing platforms ⋮ Communication contention in APN list scheduling algorithm ⋮ Automatic implementation of affine iterative algorithms: Design flow and communication synthesis ⋮ List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity ⋮ Resource allocation algorithm for light communication grid-based workflows within an SLA context ⋮ Revisiting communication code generation algorithms for message-passing systems ⋮ CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL ⋮ A standard task graph set for fair evaluation of multiprocessor scheduling algorithms ⋮ Two-way dominant sequence clustering for processor scheduling ⋮ Bayesian network modeling of the consensus between experts: an application to neuron classification
This page was built for publication: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
