Binary Trees and Parallel Scheduling Algorithms

DOI10.1109/TC.1983.1676223MaRDI QIDQ3659131zbMATH OpenFDO

Authors Eliezer Dekel, Sartaj Sahni

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1983.1676223

zbMATH Keywords

design methodologiesparallel algorithmsparallel computationsschedulingshared memory model

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(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
• Parallel circle-cover algorithms
• On iterative and cellular tree arrays
• 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
• A parallel Poisson generator using parallel prefix
• Sequential and parallel local search for the time-constrained traveling salesman problem
• A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS
• SCHEDULING INTERVAL ORDERS IN PARALLEL
• single Machine Preemptive Scheduling With Special Cost Functions¹
• Parallel algorithms on circular-arc graphs
• Efficient parallel algorithms for computing all pair shortest paths in directed graphs

This page was built for publication: Binary Trees and Parallel Scheduling Algorithms

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