Binary Trees and Parallel Scheduling Algorithms
From MaRDI portal
Publication:3659131
DOI10.1109/TC.1983.1676223zbMath0513.68031MaRDI QIDQ3659131
Eliezer Dekel, Sartaj K. Sahni
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Algorithms in computer science (68W99)
Related Items (16)
An introduction to parallelism in combinatorial optimization ⋮ Some parallel algorithms on interval graphs ⋮ Optimal computation of prefix sums on a binary tree of processors ⋮ A parallel Poisson generator using parallel prefix ⋮ A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS ⋮ SCHEDULING INTERVAL ORDERS IN PARALLEL ⋮ Parallel circle-cover algorithms ⋮ On iterative and cellular tree arrays ⋮ single Machine Preemptive Scheduling With Special Cost Functions1 ⋮ Efficient parallel algorithms for computing all pair shortest paths in directed graphs ⋮ Parallel algorithms on circular-arc graphs ⋮ Optimal parallel algorithms for finding cut vertices and bridges of interval graphs ⋮ A new upper bound on the complexity of the all pairs shortest path problem ⋮ An efficient parallel logarithmic time algorithm for the channel routing problem ⋮ Non-associative parallel prefix computation ⋮ Sequential and parallel local search for the time-constrained traveling salesman problem
This page was built for publication: Binary Trees and Parallel Scheduling Algorithms
