TORSCHE Scheduling
Toolbox for Matlab


[Graham79] R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann. Discrete Math. 5. 287-326. 1979.

[Błażewicz83] J. Błażewicz, J. K. Lenstra, and A. H. Rinnooy Kan. Scheduling subject to resource constrains: classification and complexity. 5. Ann. Discrete Math. 11-24. 1933.

[Błażewicz01] J. Błażewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Węglarz. Scheduling Computer and Manufacturing Process. Springer. 2nd printing. 2001. 3-540-41931-4.

[Pinedo02] Michael Pinedo. Scheduling. Theory, Algorithms and Systems. Prentice Hall. 2nd edition. 2002. 586. 0-13-028138-7.

[Butazo97] G. C. Butazo. Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers. 1997. 0-7923-9994-3.

[Liu00] J. W. Liu. Real-time systems. Prentice-Hall. 1st printing. 2000. 0-13-099651-3.

[Hanen95] C. Hanen and A. Munier. A Study of the Cyclic Scheduling Problem on Parallel Processors. Discrete Applied Mathematics. 57. 167-192. February, 1995.

[Brucker99] P. Brucker, T. Hilbig, and J. Hurink. A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics. 94. 1999.

[Sucha04] P. Šůcha, Z. Pohl, and Z. Hanzálek. Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit. 10th IEEE Real-Time and Embedded Technology and Applications Symposium. May, 2004.

[Hanzalek07] P. Šůcha and Z. Hanzálek. Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times. Mathematical and Computer Modelling Journal (Article in Press). 2007.

[Sucha07] P. Šůcha and Z. Hanzálek. Cyclic Scheduling of Tasks with Unit Processing Time on Dedicated Sets of Parallel Identical Processors. Multidisciplinary International Scheduling Conference: Theory and Application (MISTA07). August, 2007.

[Hanzalek04] P. Šůcha and Z. Hanzálek. Scheduling with Start Time Related Deadlines. IEEE Conference on Computer Aided Control Systems Design. September, 2004.

[Rau81] B. R. Rau and C. D. Glaeser. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. Proceedings of the 20th Annual Workshop on Microprogramming and Microarchitecture. 183-198. 1981.

[Fettweis86] A. Fettweis. Wave digital filters: theory and practice. Proceedings of the IEEE. 74. 270-327. February, 1986.

[Diestel00] Reinhard Diestel. Graph Theory. Springer. February, 2000. 313. 0-38-798976-5.

[Leung04] Joseph Y-T. Leung. Handbook of Scheduling. Algorithms, Models, and Performance Analysis. Chapman & Hall/CRC. April 15, 2004. 1120. 1-58488-397-9.

[Ahuja93] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Theory, Algorithms, and Applications. Prentice Hall. February 18, 1993. 864. 013617549X.

[Heemstra92] Sonia M. Heemstra de Groot, Sabih H. Gerez, and Otto E. Herrmann. Range-Chart-Guided Iterative Data-Flow-Graph Scheduling. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. May, 1992. 351-364. 39 (5). 013617549X.

[Paulin86] Pierre G. Paulin, John P. Knight, and Emil F. Girczyc. HAL: A multi-paradigm approach to automatic data path synthesis. 23rd IEEE Design Automation Conf. July, 1986. 263-270.

[Rabaey91] J. M. Rabaey, C. Chu, P. Hoang, and M. Potkonjak. Fast Prototyping of Datapath-Intensive Architectures. IEEE Design and Test of Computers. 1991. 8 (2). 40-51. 0740-7475.

[Dongen92] V. H. Dongen and G. R. Gao. A Polynomial Time Method for Optimal Software Pipelining. Lecture Notes in Computer Science, Springer-Verlag. 1992. 613-624. 3-540-55895-0.

[Makhorin04] Andrew Makhorin. GLPK (GNU Linear Programming Kit) Version 4.6. Department for Applied Informatics, Moscow Aviation Institute, Moscow. 2004.

[CPLEX04] ILOG, Inc.. CPLEX Version 9.1. Department for Applied Informatics, Moscow Aviation Institute, Moscow. 2004.

[Berkelaar05] Michel Berkelaar, Kjell Eikland, and Peter Notebaert. lp_solve (Open source (Mixed-Integer) Linear Programming system) Version 2005.

[Bemporad04] Alberto Bemporad and Domenico Mignone. Mixed Integer Quadratic Program (MIQP) solver for Matlab. Automatic Control Laboratory, ETH Zentrum, Zurich, Switzerland. 2004.

[QAPLIB06] Rainer E. Burkard, Eranda Çela, Stefan E. Karisch, and Franz Rendl. QAPLIB - A Quadratic Assignment Problem Library. Institute of Mathematics, Graz University of Technology. 2006.

[Stützle99] Thomas Stützle and Marco Dorigo. New ideas in optimization ACO Algorithms for the Quadratic Assignment Problem (New ideas in optimization). McGraw-Hill Ltd., UK. 1999. 33-50. 0-07-709506-5. Maidenhead, UK, England.

[Horn74] W. A. Horn. Some Simple Scheduling Algorithms. Naval Res. Logist. Quart., 21. 1974. 177-185.

[Bru76] P.J. Brucker. Sequencing unit-time jobs with treelike precedence on m processors to minimize maximum lateness. Proc. IX International Symposium on Mathematical Programming, Budapest. 1976.

[Graham66] R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal. 1966. 45:1563--1581.

[CDFG05] Jinhwan Jeon and Yong-Jin Ahn. Control-Data Flow Graph Toolset. 2005.

[HSLA02] R. Matoušek, M. Tichý, Z. Pohl, J. Kadlec, and C. Softley. Logarithmic number system and floating-point arithmetics on FPGA. Field-Programmable Logic and Applications: Reconfigurable Computing is Going Mainstream, Lecture Notes in Computer Science 2438. 627-636. 2002.

[RLS03] A. Heřmánek, Z. Pohl, and J. Kadlec. FPGA Implementation of the Adaptive Lattice Filter. Field-Programmable Logic and Applications. Proceedings of the 13th International Conference. 1095-1098. 2003.

[Pohl05] Z. Pohl, P. Šůcha, J. Kadlec, and Z. Hanzálek. Performance Tuning of Iterative Algorithms in Signal Processing. The International Conference on Field-Programmable Logic and Applications (FPL'05), Tampere, Finland. 699-702. 2005.

[DSVF06] National Instruments. Implementation of Digital Filters as Part of Custom Synthesizer with NI SPEEDY 33. National Instruments, 2006.

[Cervin06] M. Ohlin, D. Henriksson, and A. Cervin. TRUETIME 1.4—Reference Manual. Department of Automatic Control, Lund University. 2006.

[TORSCHE06] P. Šůcha, M. Kutil, M. Sojka, and Z. Hanzálek. TORSCHE Scheduling Toolbox for Matlab. IEEE International Symposium on Computer-Aided Control Systems Design (CACSD'06), Munich, Germany. 2006.

[Memik02] S. O. Memik and F. Fallah. Accelerated SAT-based Scheduling of Control/Data Flow Graphs. 20th International Conference on Computer Design (ICCD), IEEE Computer Society. 2002. 395-400.

[DSVF06] Tarjan, R. E.. Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 146-160. 1972.

[Demel02] Demel, J.. Grafy a jejich aplikace. Academia. 2002.

Webmaster - Jan Dvořák (2004 - 2019)