An efficient parallel algorithm for scheduling interval ordered tasks
From MaRDI portal
Recommendations
Cites work
- An Almost-Linear Algorithm for Two-Processor Scheduling
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
- scientific article; zbMATH DE number 176752 (Why is no real title available?)
- Optimal scheduling for two-processor systems
- Optimal Sequencing of Two Equivalent Processors
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- Parallel maximum matching algorithms in interval graphs
- Parallel Merge Sort
- Scheduling Interval Ordered Tasks in Parallel
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Scheduling Interval-Ordered Tasks
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- The edge inducibility of graphs
- The Two-Processor Scheduling Problem is in Random NC
- Two Processor Scheduling is in $\mathcal{NC}$
Cited in
(10)- Optimal scheduling on parallel machines for a new order class
- Scheduling interval orders with communication delays in parallel
- An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
- Scheduling with constrained processor allocation for interval orders
- Non-preemptive profile scheduling and quasi-interval orders
- scientific article; zbMATH DE number 6006722 (Why is no real title available?)
- scientific article; zbMATH DE number 512819 (Why is no real title available?)
- Scheduling Interval Ordered Tasks in Parallel
- scientific article; zbMATH DE number 1759465 (Why is no real title available?)
- Parallel interval order recognition and construction of interval representations
This page was built for publication: An efficient parallel algorithm for scheduling interval ordered tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652455)
