Time-constrained scheduling of large pipelined datapaths

Journal of Systems Architecture

Volumn 51, Issue 12, 2005, Pages 665-687

  Arató, Péter ^a   Ádám Mann, Zoltán ^a,b   Orbán, András ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b IEEE   (Hungary)

Author keywords

Allocation; Constraint logic programming; Genetic algorithm; High level synthesis; Pipeline; Scheduling

Indexed keywords

ALLOCATION; CONSTRAINT LOGIC PROGRAMMING; HIGH-LEVEL SYNTHESIS; PIPELINE;

CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; LOGIC PROGRAMMING; OPTIMIZATION; PIPELINE PROCESSING SYSTEMS;

SCHEDULING;

EID: 33644607017     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2005.02.001     Document Type: Article

References (43)

1. I. Ahmad, M.K. Dhodhi, and F.M. Ali TLS: a tabu search based scheduling algorithm for behavioral synthesis of functional pipelines The Computer Journal 43 2 2000 152 166
2. C. Akturan, M.F. Jacome, CALiBeR: a software pipelining algorithm for clustered embedded VLIW processors, in: Proceedings of ICCAD, 2001, pp. 112-118.
3. P. Arató, S. Juhász, Z.Á. Mann, A. Orbán, D. Papp, Hardware/software partitioning in embedded system design, in: Proceedings of the IEEE International Symposium on Intelligent Signal Processing, 2003.
4. P. Arató, Z.Á. Mann, A. Orbán, Genetic scheduling algorithm for high-level synthesis, in: Proceedings of the IEEE 6th International Conference on Intelligent Engineering Systems, 2002.
5. P. Arató, Z.Á. Mann, and A. Orbán Algorithmic aspects of hardware/software partitioning ACM Transactions on Design Automation of Electronic Systems 10 1 2005 136 156
6. P. Arató, T. Visegrády, and I. Jankovits High-level Synthesis of Pipelined Datapaths 2001 John Wiley & Sons Chichester, United Kingdom
7. B. Bollobás The chromatic number of random graphs Combinatorica 8 1 1988 49 55
8. E. Bonsma, S. Gerez, A genetic approach to the overlapped scheduling of iterative data-flow graphs for target architectures with communication delays, in: Proceedings of the ProRISC Workshop on Circuits, Systems and Signal Processing, 1997.
9. C. Chantrapornchai, S. Tongsima, E.H.-M. Sha, Imprecise task schedule optimization, in: Proceedings of the International Conference on Fuzzy Systems, 1997.
10. L.-F. Chao, A.S. LaPaugh, E.H.-M. Sha, Rotation scheduling: a loop pipelining algorithm, in: Design Automation Conference, 1993, pp. 566-572.
11. F. Chen, S. Tongsima, E.H.-M. Sha, Register-constrained loop scheduling for optimizing time and memory operations, in: Proceedings of the IEEE Workshop on Signal Processing Systems (SiPS), 1998.
12. J.W. Cooley, and J.W. Tukey An algorithm for the machine calculation of complex Fourier series Mathematics of Computation 1965 297 301
13. L. Davis Handbook of Genetic Algorithms 1991 Van Nostran Reinhold
14. M. Daws. Probabilistic combinatorics, part III. http://members.tripod. com/matt_daws/maths/pc.ps, 2001. Based on the lectures of Dr. Thomason, Cambridge University.
15. D. Gajski High-level Synthesis 1992 Kluwer Academic Publishers
16. M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou The complexity of coloring circular arcs and chords SIAM Journal on Algebraic and Discrete Methods 2 1 1980 216 227
17. M.Ch. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
18. S. Haynal, F. Brewer, Representing and scheduling looping behavior symbolically, in: IEEE International Conference on Computer Design, 2000.
19. M.J.M. Heijligers, J.A.G. Jess, High-level synthesis scheduling and allocation using genetic algorithms based on constructive topological scheduling techniques, in: Proceedings of ICEC-95, 1995.
20. K. Ito, T. Iwata, H. Kunieda, An optimal scheduling method for parallel processing system of array architecture, in: Asia and South Pacific Design Automation Conference, ASP-DAC '97, 1997, pp. 447-454.
21. W. Kinnebrock Optimierung Mit Genetischen Und Selektiven Algorithmen 1994 Oldenburg
22. M. Koster, S.H. Gerez, List scheduling for iterative dataflow graphs, in: Proceedings of the Groningen Information Technology Conference for Students, 1995, pp. 123-130.
23. D. Ku, and G. De Micheli Constrained resource sharing and conflict resolution in Hebe Integration: the VLSI Journal 12 2 1991 131 166
24. D. Ku, G. De Micheli, Relative scheduling under timing constraints: algorithms for high-level synthesis of digital circuits, Technical Report CSL-TR-91-477, Stanford, 1991.
25. K. Kuchcinski, An approach to high-level synthesis using constraint logic programming, in: Proceedings of the 24th Euromicro Conference, Workshop on Digital System Design, 1998.
26. X. Lai, J.L. Massey, and S. Murphy Markov ciphers and differential cryptanalysis Lecture Notes in Computer Science 547 1991 17 38
27. G. Lakshminarayana, K.S. Khouri, N.K. Jha, Wavesched: a novel scheduling technique for control-flow intensive behavioral descriptions, in: Proceedings of ICCAD '97, 1997, pp. 244-250.
28. Z.Á. Mann, A. Orbán, Optimization problems in system-level synthesis, in: Proceedings of the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2003.
29. I. Markhof, High-level-synthesis by constraint logic programming, in: GI/ITG-Workshop 'Anwendung formaler Methoden im Systementwurf', 1994.
30. S.O. Memik, E. Bozorgzadeh, R. Kastner, M. Sarrafzadeh, A super-scheduler for embedded reconfigurable systems, in: Proceedings of ICCAD 2001, 2001.
31. S.O. Memik, A. Srivastava, E. Kursun, M. Sarrafzadeh, Algorithmic aspects of uncertainty driven scheduling, in: Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), 2002.
32. M.C. Molina, J.M. Mendías, and R. Hermida High-level synthesis of multiple-precision circuits independent of data-objects length Proceedings of the 39th Conference on Design Automation 2002 ACM Press 612 615
33. Swedish Institute of Computer Science, SICS Quintus Prolog Manual, 1999.
34. A. Orbán, Z.Á. Mann, P. Arató, Time-constrained design of pipelined control-intensive systems, Periodica Polytechnica, Series Electrical Engineering, in press.
35. P.G. Paulin, and J.P. Knight Force-directed scheduling for the behavioural synthesis of ASICs IEEE Transations on Computer Aided Design 22 1989
36. Poiesz, S.H. Gerez, E.R. Bonsma, Generation, genetic optimization and VHDL-based verification of detailed iterative static schedules for multiprocessor systems, in: Proceedings of the ProRISC 10th Annual Workshop on Circuits, Systems and Signal Processing, 1999.
37. M. Potkonjak, and M. Srivastava Behavioral optimization using the manipulation of timing constraints IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17 10 1998
38. R.L. Rivest, M.J.B. Robshaw, R. Sidney, Y.L. Yin, The RC6 block cipher. Available from: 〈http://theory.lcs.mit.edu/rivest/rc6.pdf〉.
39. A. Schrijver Theory of Linear and Integer Programming 1998 Wiley
40. J. Seo, T. Kim, P.R. Panda, An integrated algorithm for memory allocation and assignment in high-level synthesis, in: Proceedings of DAC '02, 2002, pp. 608-611.
41. A.H. Timmer, J.A.G. Jess, Exact scheduling strategies based on bipartite graph matching, in: Proceedings of EDAC'95, 1995, pp. 42-47.
42. S. Tongsima, Ch. Chantrapornchai, N. Passos, E.H.-M. Sha, Probabilistic list scheduling: an algorithm for producing initial schedules for probabilistic rotation scheduling, Technical Report TR 96-16, University of Notre Dame, 1996.
43. N. Wehn, M. Held, M. Glesner, A novel scheduling/allocation approach for datapath synthesis based on genetic paradigms, in: Proceedings of the IFIP TC10/WG10.5 Workshop on Logic and Architecture Synthesis, 1990, pp. 47-56.