Allowable processing orders in the accelerated cascade algorithm
From MaRDI portal
Recommendations
- A new class of asynchronous iterative algorithms with order intervals
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime
- Parallel pipelined filter ordering with precedence constraints
- Efficient algorithms for order basis computation
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- An efficient algorithm for partial order production
- An efficient algorithm for partial order production
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- An efficient design and implementation of the in-parameter-order algorithm
Cites work
- scientific article; zbMATH DE number 3244267 (Why is no real title available?)
- scientific article; zbMATH DE number 3302127 (Why is no real title available?)
- scientific article; zbMATH DE number 3400691 (Why is no real title available?)
- Algebraic structures for transitive closure
- Allowable processing orders in the accelerated cascade algorithm
- Finding the K Shortest Loopless Paths in a Network
- Iterative methods for determining the k shortest paths in a network
- NP-Complete operations research problems and approximation algorithms
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Revised Matrix Algorithms for Shortest Paths
- The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
Cited in
(3)
This page was built for publication: Allowable processing orders in the accelerated cascade algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072941)
