Skip to main content

A performance modeling and analysis environment for reconfigurable computers

  • Reconfigurable Architectures Workshop Peter M. Athanas, Virginia Tech, USA Reiner W. Hartenstein, University of Kaiserslauteren, Germany
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

Abstract

In many of the various layers of software supporting reconfigurable architectures such as compilers, operating systems, synthesis tools, and so forth, a primary objective is to deliver the performance, power, cost, and other advantages of reconfigurable architectures to a target application. Inherent to these tools are various estimation procedures for such performance metrics as throughput time, power, reliability, cost, and so on. Analysis of Reconfigurable Computers (ARC) is a comprehensive analysis and modeling tool we are developing that can be used to calculate these and other performance metrics.

This work is sponsored in part by the DARPA f ITO Adaptive Computing Systems Program and monitored by the US Army under contract number DABT63-97-C0030.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Iseli and E. Sanchez. A C++ Compiler for FPGA Custom Units Synthesis. In IEEE Conference on FPGAs for Custom Computing Machines, pages 173–179, 1995.

    Google Scholar 

  2. Michael J. Wirthlin and Brad L. Hutchings. A Dynamic Instruction Set Computer. In IEEE Workshop on FPGAs for Custom Computing Machines, pages 99–107, 1995.

    Google Scholar 

  3. Ranga Vemuri, Ram Mandayam, Vijay Meduri. Performance Modeling Using PDL. IEEE Computer, pages 44–53, April 1996.

    Google Scholar 

  4. Jeffrey Walrath and Ranga Vemuri. Symbolic Evaluation of Performance Models for Tradeoff Visualization. In Proceedings of 34th Design Automation Conference, pages 359–364, 1997.

    Google Scholar 

  5. M. Nagl and A. Schurr. A Specification Environment for Graph Grammars. In H. Ehrig and H.-J. Kreowski, editors, Graph Grammars and their Application to Computer Science, volume 411, pages 599–609. Springer-Verlag, 1991.

    Google Scholar 

  6. U. Kastens. Ordered Attribute Grammars. In Acta Informatica, volume 13, pages 229–256, 1980.

    Article  Google Scholar 

  7. K. Kennedy and S.K. Warren. Automatic Generation of Efficient Evaluators for Attribute Grammars. In Proceeding of 3rd ACM Symposium on Principles of Programming Languages, pages 32–49, 1976.

    Google Scholar 

  8. M. Jazayeri, W. Ogden, and W. Rounds. The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. Communications of the ACM, 18:679–706, December 1975.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walrath, J., Vemuri, R. (1998). A performance modeling and analysis environment for reconfigurable computers. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_667

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_667

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics