Skip to main content

Evaluation of Space Allocation Circuits

  • Conference paper
  • 694 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3824))

Abstract

This paper describes the design and evaluation of the PCA (Plastic Cell Architecture) cell, which implements a novel space allocation method. PCA is a dynamically reconfigurable architecture which exceeds the FPGA (Field Programmable Gate Array) in flexibility and generality. Circuit dynamically reconfiguration is achieved as administrators manage the heap areas. But, because objects operate and require new space in parallel, it is difficult to manage them collectively. So, we introduced the concept of pressure, which enables space allocation. As a simulation result, we found that this new method, which relies on pressure commands, could solve the problems of object management efficiently. We designed the PCA cell with space allocation capability. Consequently, the number of gates per PCA cell is 200, and the maximum delay time per cell is 3.55 ns. Moreover, the 3×3 PCA cell processing of six space-allocation commands consumes 306.3μW.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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. Oguri, K.: New general-purpose information processing architecture PCA1 by cloth line theory. BIT 32(1), 27–35 (2000); Kyoritsu Syuppan

    Google Scholar 

  2. Oguri, K.: New general-purpose information processing architecture PCA1 by cloth line theory. BIT 32(3), 54–62 (2000); Kyoritsu Syuppan

    Google Scholar 

  3. Oguri, K.: New general-purpose information processing architecture PCA1 by cloth line theory. BIT 32(7), 51–59 (2000); Kyoritsu Syuppan

    Google Scholar 

  4. Ito, H., Konishi, R., Nakata, H., Nagoya, A.: Dynamically reconfigurable method LSI PCA-2. In: The 1st reconfigurable system society, pp. 119–126 (2003)

    Google Scholar 

  5. Soda, K.: Design of LUT array type PLD and method of burying logical function. Kyoto university graduate school graduation thesis (2000)

    Google Scholar 

  6. Soga, Y., Sugimoto, N., Izumi, T., Ogata, T., Nakamura, Y.: Examination of granularity of PCA-chip2 based on logical mounting efficiency. In: The 19th PARTHENON society, pp. 15–20 (1999)

    Google Scholar 

  7. Sugimoto, N., Tomita, A., TsuTsumi, H., Sakai, K., Soda, K., Nakamura, Y.: Design and making for trial purposes of LUT array type PLD. In: VDEC LSI design forum (September 2000)

    Google Scholar 

  8. Motomura, M.: A Dynamically Reconfigurable Processor Architecture. Microprocessor Forum (October 2002)

    Google Scholar 

  9. http://www.ipflex.com

  10. http://www.pactcorp.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kyusaka, S., Higuchi, H., Nagamoto, T., Shibata, Y., Oguri, K. (2005). Evaluation of Space Allocation Circuits. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_44

Download citation

  • DOI: https://doi.org/10.1007/11596356_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30807-2

  • Online ISBN: 978-3-540-32295-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics