Strip packing with precedence constraints and strip packing with release times

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 180-189

  Augustine, John ^a   Banerjee, Sudarshan ^a   Irani, Sandy ^a  

^a Ringgold Standard Institution Informatics   (United States)

Author keywords

Precedence Constraints; Reconfigurable Architectures; Release Times; Scheduling; Strip Packing

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; FIELD PROGRAMMABLE GATE ARRAYS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

PRECEDENCE CONSTRAINTS; RECONFIGURABLE ARCHITECTURES; STRIP PACKING;

ELECTRONICS PACKAGING;

EID: 33749552247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148139     Document Type: Conference Paper

References (25)

1. Xilinx. http://www.xilinx.com.
2. J. Augustine and S. Seiden. Linear time approximation schemes for vehicle scheduling problems. Theoretical Computer Science, 324(2-3): 147-160, 2004.
3. B. S. Baker, D. J. Brown, and H. P. Katseff. A 5/4 algorithm for two-dimensional packing. J. Algorithms, 2(4):348-368, 1981.
4. B. S. Baker, E. G. Coffman, and R. L. Rivest. Orthogonal packings in two dimensions. SIAM J. Comput., 9(4):846-855, 1980.
5. S. Banerjee, E. Bozorgzadeh, and N. Dutt. Physically-aware hw-sw partitioning for reconfigurable architectures with partial dynamic reconfiguration. In Design Automation Conference, pages 335-340, 2005.
6. A. L. Buchsbaum, H. Karloff, C. Kenyon, N. Reingold, and M. Thorup. Opt versus load in dynamic storage allocation. SIAM J. Comput., 33(3):632-646, 2004.
7. E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput., 9(4):808-826, 1980.
8. J. Csirik and G. J. Woeginger. Shelf algorithms for on-line strip packing. Inf. Process. Lett., 63(4):171-175, 1997.
9. W. F. de la Vega and G. S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1(4):349-355, 1981.
10. W. F. de la Vega and V. Zissimopoulos. An approximation scheme for strip packing of rectangles with bounded dimensions. Discrete Applied Mathematics, 82(1-3):93-101, 1998.
11. M. Grotschel, L. Lovasz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981.
12. K. Jansen and R. van Stee. On strip packing with rotations. In Proceedings of the thirty-seventh annual A CM symposium on Theory of computing, pages 755-761, New York, NY, USA, 2005. ACM Press.
13. K. Jansen and H. Zhang. Scheduling malleable tasks with precedence constraints. In Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures, pages 86-95, New York, NY, USA, 2005. ACM Press.
14. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorial, 4:373-395, 1984.
15. N. Karmarkar and R. Karp. An efficient approximation scheme for the one dimensional bin-packing problem. Proceedings of the 23rd Sympos. Foundations Computer Sci. (FOCS), Tucson, AZ, pages 312-320, 1982.
16. C. Kenyon and E. Rémila. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res., 25(4):645-656, 2000.
17. R. Lepère, D. Trystram, and G. J. Woeginger. Approximation algorithms for scheduling malleable tasks under precedence constraints. In Proceedings of the 9th Annual European Symposium on Algorithms, pages 146-157, London, UK, 2001. Springer-Verlag.
18. D. S. J. M. R. Garey, R. L. Graham and A. C. Yao. Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory, 21(3):257-298, Nov 1976.
19. C. Martel. Preemptive scheduling with release times, deadlines, and due times. Journal of the Association of Computing Machinery, 29(3):812-829, 1982.
20. S. Martello, M. Monaci, and D. Vigo. An exact approach to the strip-packing problem. INFORMS J. on Computing, 15(3):310-319, 2003.
21. G. Mounie, C. Rapine, and D. Trystram. Efficient approximation algorithms for scheduling malleable tasks. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, pages 23-32, New York, NY, USA, 1999. ACM Press.
22. M. Queyranne. Bounds for assembly line balancing heuristics. Operations Research, 33(6): 1353-1359, 1985.
23. I. Schiermeyer. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Proceedings of the Second Annual European Symposium on Algorithms, pages 290-299, London, UK, 1994. Springer-Verlag.
24. C. Steiger, H. Walder, and M. Platzner. Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks. IEEE Transactions on Computers, 53(11):1393-1407, 2004.
25. A. Steinberg. A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput., 26(2):401-409, 1997.