Skip to main content

An Improved Greedy Based Global Optimized Placement Algorithm

  • Chapter
  • 1395 Accesses

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 56))

Abstract

An improved Greedy based global optimized Placement algorithm was proposed in this paper. Probability controlling was applied to avoid local minimization of traditional Greedy algorithm. Some new technique such as Marker bit method, dynamical selection and weight matrix were introduced to improve efficiency of this algorithm. From the experiments and comparison with Simulated Annealing algorithm, this novel algorithm shows better stability and accuracy.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast Template Placement for Reconfigurable Computing Systems. IEEE Design and Test of Computers 17, 68–83 (2000)

    Article  Google Scholar 

  2. Walder, H., Plazner, M., Thiele, L.: Online Scheduling and Placement of real-time asks to partially Reconfigurable Devices. In: Real-Time Systems Symposium (RTSS), pp. 224–225 (2003)

    Google Scholar 

  3. Walder, H., Steige, C., Plazner, M.: Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D Hashing. In: International Parralel and Distribute Processing Symposium (IPDPS), p. 178 (2003)

    Google Scholar 

  4. Ahmadinia, A., Bodda, C., Teich, J.: A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds.) ARCS 2004. LNCS, vol. 2981, pp. 125–139. Springer, Heidelberg (2004)

    Google Scholar 

  5. Handa, M., Vemuri, R.: An Efficient Algorithm for Finding Empty Space for Online FPGA placement. In: Design Automation Conference (DAC), June 2004, pp. 960–965 (2004)

    Google Scholar 

  6. Handa, M., Vemuri, R.: An Integrated online Scheduling and Placement Methodology. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 444–453. Springer, Heidelberg (2004)

    Google Scholar 

  7. Cui, J., Deng, Q., He, X., Gu, Z.: An Efficient Algorithm for Online Management of 2D Area of Partially Reconfigurable FPGAs. In: Design Automation and Test in Europe (DATE), pp. 129–134 (2007)

    Google Scholar 

  8. Cui, J., Gu, Z., Liu, W., Deng, Q.: An Efficient Algorithm for Online Soft Real-time Task Placement on Reconfigurable Hardware Device. In: IEEE International Symposium on Object/Component/Service-Oriented Real-time Distributed Computing (ISORC), pp. 321–328 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zhong, L., Wang, K., Yuan, J., He, J. (2009). An Improved Greedy Based Global Optimized Placement Algorithm. In: Wang, H., Shen, Y., Huang, T., Zeng, Z. (eds) The Sixth International Symposium on Neural Networks (ISNN 2009). Advances in Intelligent and Soft Computing, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01216-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01216-7_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01215-0

  • Online ISBN: 978-3-642-01216-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics