Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s100860300021

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

Scheduling with an Orthogonal Resource Constraint

Authors: Martin Niemeier Andreas Wiese
Publish Date: 2013/09/10
Volume: 71, Issue: 4, Pages: 837-858
PDF Link

Abstract

We address a scheduling problem that arises in highly parallelized environments like modern multicore CPU/GPU computer architectures where simultaneously active jobs share a common limited resource eg memory cache The scheduler must ensure that the demand for the common resource never exceeds the available capacity This introduces an orthogonal constraint to the classical minimum makespan scheduling problem Such a constraint also arises in other contexts where a common resource is shared across machinesWe study the nonpreemptive case of this problem and present a 2+ϵapproximation algorithm which relies on the interplay of several classical and modern techniques in scheduling like grouping jobclassification and the use of configurationLPs This improves upon previous bound of 3 that can be obtained by list scheduling approaches and gets close to the 3/2−ϵ inapproximability bound If the number of machines or the number of different resource requirements are bounded by a constant we obtain a polynomial time approximation scheme

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. Integer Representation and Counting in the Bit Probe Model
  3. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  4. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  5. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  6. Aligning Two Convex Figures to Minimize Area or Perimeter
  7. Introduction for S.I. AofA14
  8. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  9. Detecting Regular Visit Patterns
  10. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  11. Random Matrices and Codes for the Erasure Channel
  12. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  13. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  14. Optimal Parallel Quantum Query Algorithms
  15. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges
  16. Maximum Series-Parallel Subgraph
  17. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  18. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  19. The Parameterized Complexity of Local Search for TSP, More Refined
  20. Approximating Fixation Probabilities in the Generalized Moran Process
  21. Approximation Algorithms for Scheduling with Reservations
  22. Algorithms for the Homogeneous Set Sandwich Problem
  23. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  24. Computing Minimum Cuts by Randomized Search Heuristics
  25. Constructing Labeling Schemes through Universal Matrices
  26. An Approximation Algorithm for the Minimum Co-Path Set Problem
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: