Off-Line and On-Line Call-Scheduling in Stars and Trees (1997)


Download Links

by Thomas Erlebach , Klaus Jansen
Venue:in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG ‘97, LNCS1335, Springer-Verlag
Citations:11 - 2 self

Active Bibliography

22 The Complexity of Path Coloring and Call Scheduling – Thomas Erlebach, Klaus Jansen, Corso Elvezia - 2000
550 Cilk: An Efficient Multithreaded Runtime System – Robert D. Blumofe , Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou - 1995
409 Scheduling Multithreaded Computations by Work Stealing – Robert D. Blumofe, Charles E. Leierson
Scheduling in modern networks: state-of-the-art survey – n.n. - 2002
Approximation Algorithms for Path Coloring in Trees – Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano - 2001
334 The Implementation of the Cilk-5 Multithreaded Language – Matteo Frigo, Charles E. Leiserson, Keith H. Randall - 1998
305 The Merge/Purge Problem for Large Databases – Mauricio Hernandez, Mauricio A. Hern'andez, Salvatore Stolfo - 1995
81 Graph problems arising from wavelength-routing in all-optical networks – Bruno Beauquier, Luisa Gargano, Stéphane Perennes, et al. - 1997
10 Short Length Menger's Theorem and Reliable Optical Routing – Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman - 2003