Skip to main content

Implementation of Scheduling and Allocation Algorithm

  • Conference paper
Advances in Computing and Information Technology (ACITY 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 198))

  • 1750 Accesses

Abstract

This paper presents a new evolutionary algorithm developed for scheduling and allocation for an elliptic filter. It involves the scheduling of the operations and resource allocation for elliptic filter. The Scheduling and Allocation Algorithm is compared with different scheduling algorithms like As Soon As Possible algorithm, As Late As Possible algorithm, Mobility Based Shift algorithm, FDLS, FDS and MOGS using Elliptic Filter. In this paper execution time and resource utilization is calculated for different Elliptic Filter and reported that proposed Scheduling and Allocation increases the speed of operation by reducing the control step. The proposed work to analyse the magnitude, phase and noise responses for different scheduling algorithm in an elliptic filter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Papa, G., Silc, J.: Multi-objective genetic scheduling algorithm with respect to allocation in high-level synthesis. In: Proceedings of the 26th Euromicro Conference, vol. 1, September 5-7, pp. 339–346 (2002)

    Google Scholar 

  2. Papa, G., Silc, J.: Automated large-scale integrated synthesis using allocation-based scheduling algorithm, February 2. IEEE, Los Alamitos (2002)

    Google Scholar 

  3. You, M.-K., Song, G.-Y.: Implementation of a C-to-SystemC Synthesizer Prototype, School of Electrical and Computer Engineering Chungbuk National University, Cheongju Chungbuk, Korea, pp. 361–763 (2007)

    Google Scholar 

  4. Hughes, J.B., Moulding, K.W., Richardson, J., Bennett, J., Redman-White, W., Bracey, M., Soin, R.S.: Automated Design of Switched-Current Filter. IEEE Journal of Solid State Circuits 31(7) (July 1996)

    Google Scholar 

  5. Hansen, J., Singh, M.: A Fast Branch-and-Bound Approach to High-Level Synthesis of Asynchronous Systems. In: IEEE Symposium on Asynchronous Circuits and Systems (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marikkannan, S., Leelavathi, Kalaiselvi, U., Kavitha (2011). Implementation of Scheduling and Allocation Algorithm. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Advances in Computing and Information Technology. ACITY 2011. Communications in Computer and Information Science, vol 198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22555-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22555-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22554-3

  • Online ISBN: 978-3-642-22555-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics