A comparison of list schedules for parallel processing systems

From MaRDI portal
Publication:4045652

DOI10.1145/361604.361619zbMath0293.68047OpenAlexW2057108708MaRDI QIDQ4045652

Thomas L. Adam, J. R. Dickson, K. Mani Chandy

Publication date: 1974

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361604.361619




Related Items (18)

Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometryTWO-SIDED ELIMINATION ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS USING HOUSEHOLDER REDUCTIONSBenchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modulesUsing integer linear programming for instruction scheduling and register allocation in multi-issue processorsJob scheduling methods for reducing waiting time varianceHeuristics and augmented neural networks for task scheduling with non-identical machinesA Comparison of Random Task Graph Generation Methods for Scheduling ProblemsA comparison of multiprocessor task scheduling algorithms with communication costsReliability-aware scheduling strategy for heterogeneous distributed computing systemsA list-scheduling heuristic for the short-term planning of assessment centersPARAdeg-processor scheduling for acyclic SWITCH-less program netsAdvanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systemsDepth optimization for topological quantum circuitsResource allocation algorithm for light communication grid-based workflows within an SLA contextTask scheduling with and without communication delays: A unified approachDistributed scheduling using simple learning machinesA standard task graph set for fair evaluation of multiprocessor scheduling algorithmsA fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications






This page was built for publication: A comparison of list schedules for parallel processing systems