Approximation algorithms for multiprocessor scheduling under uncertainty
From MaRDI portal
Publication:613111
DOI10.1007/S00224-010-9250-2zbMATH Open1213.68151OpenAlexW2685896946MaRDI QIDQ613111FDOQ613111
Authors: Guolong Lin, Rajmohan Rajaraman 
Publication date: 17 December 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9250-2
Recommendations
- Implementation and experiments with an algorithm for parallel scheduling of complex dags under uncertainty (extended abstract)
- Scheduling independent multiprocessor tasks
- scientific article; zbMATH DE number 1759466
- scientific article; zbMATH DE number 2185607
- Scheduling independent multiprocessor tasks
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Title not available (Why is that?)
- Introduction to algorithms
- On the Distribution of the Number of Successes in Independent Trials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex quadratic and semidefinite programming relaxations in scheduling
- Bounds for Certain Multiprocessing Anomalies
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Approximation algorithms for scheduling unrelated parallel machines
- Project scheduling under uncertainty: survey and research potentials
- Title not available (Why is that?)
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Allocating Bandwidth for Bursty Connections
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Improved Approximation Algorithms for Shop Scheduling Problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for multiprocessor scheduling under uncertainty
Cited In (8)
- Scheduling of conditional executed jobs on unrelated processors
- Scheduling imprecise computation tasks on uniform processors
- Title not available (Why is that?)
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Approximation Algorithms For Scheduling On Uniform Processors
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- New scheduling problems coming from grid computing
- Control of resource-intensive computations under uncertainty. II. Scheduling complex
Uses Software
This page was built for publication: Approximation algorithms for multiprocessor scheduling under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613111)
