Sriram Govindarajan
ABSTRACT
No abstract available.
- 1.D. D. Gajski et.al. "High-Level Synthesis: Introduction to Chip and System Design". Kluwer Academic Publishers, 1992. Google Scholar
Digital Library
- 2.J. Vanhoof, G. Goosens et al. "High-Level Synthesis for Real-Time Digital Signal Processing". Kluwer Academic Publishers, 1993. Google ScholarDigital Library
- 3.S. Govindarajan and R. Vemuri. "Cone-Based Clustering Heuristic for List Scheduling Algorithms". In Proc. of European Design & Test Conference (ED&TC), pages 456-462, March 1997. Google ScholarDigital Library
- 4.E Kollig, B. M. A1-Hashimi, and K. M. Abbott. "Efficient scheduling of behavioral descriptions in high-level synthesis". In lEE Proc. of Computers and Digital Tech., vol. 144(2), pages 75-82, March 1997.Google ScholarCross Ref
- 5.I.Ouaiss, et al. "An Integrated Partitioning and Synthesis System for Dynamically Reconfigurable Multi-FPGA Architectures". In Proc. of the Reconfig. Arch. Workshop 1998, LNCS 1388, pages 31-36.Google Scholar
Index Terms
- Improving the schedule quality of static-list time-constrained scheduling (poster paper)
Recommendations
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74: Proceedings of the 7th conference on Winter simulation - Volume 2The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present ...
Scheduling time-constrained instructions on pipelined processors
In this work we investigate the problem of scheduling instructions on idealized microprocessors with multiple pipelines, in the presence of precedence constraints, release-times, deadlines, and latency constraints. A latency of lij specifies that there ...
Approximation schemes for constrained scheduling problems
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer ScienceSeveral constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for ...
Comments