Pages that link to "Item:Q1603514"

The following pages link to Approximation algorithms for general parallel task scheduling (Q1603514):

Displaying 14 items.

• Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
• Scheduling problems in a practical allocation model (Q1369746) (← links)
• A parallel approximation scheme for the multiprocessor scheduling problem (Q1606878) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• Provable algorithms for parallel generalized sweep scheduling (Q2495501) (← links)
• Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems (Q2498703) (← links)
• A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)
• Approximation Algorithms For Scheduling On Uniform Processors (Q4202255) (← links)
• Approximation algorithms for scheduling arithmetic expressions on pipelined machines (Q4203814) (← links)
• (Q4536969) (← links)
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701) (← links)
• Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
• Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)