Skip to main content
SpringerLink
Log in

High-performance computing on a honeycomb architecture

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1993)

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

Abstract

We explore time and space optimization problems involved in the mapping of parallel algorithms onto a honeycomb architecture. When a well-known mapping is used, mapped algorithms generally exhibit execution slow-down and require too large area. We design several optimization techniques and enhance the mapping process. Experimental results show more than 50 % saving in processor resources and 30 % saving in execution time, on average. Since computing performances are improved, also the applicability of the honeycomb architecture is wider.

This research is supported by the Ministry of Science and Technology of the Republic of Slovenia under grant P2-5092-106/93.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kung, S.Y.: VLSI Array Processors. (Prentice Hall, 1988).

    Google Scholar 

  2. Koren, I., Peled, I.: The Concept and Implementation of Data-Driven Array. IEEE Computer 20 (July 1987) 102–103.

    Google Scholar 

  3. Koren, I., Silberman, G.M.: A Direct Mapping of Algorithms onto VLSI Processing Arrays Based on the Data Flow Approach. Proc. 1983 Int'l Conference on Parallel Processing, August 1983, 335–337.

    Google Scholar 

  4. Mendelson, B., Silberman, G.M.: An Improved Mapping of Data Flow Programs on a VLSI Array of Processors. Proc. 1987 Int'l Conference on Parallel Processing, August 1987, 871–873.

    Google Scholar 

  5. Weiss, S., Spillinger, I., Silberman, G.M.: Architectural Improvements for Data-Driven VLSI Processing Arrays. Proc. 1989 Conference on Functional Programming Languages and Computer Architecture, September 1989, 243–259.

    Google Scholar 

  6. Mendelson, B., Koren, I.: Using Simulated Annealing for Mapping Algorithms onto Data-Driven Arrays. Proc. 1991 Int'l Conference on Parallel Processing, August 1991, I-123–I-127.

    Google Scholar 

  7. Koren, I., Mendelson, B., Peled, I., Silberman, G.M.: A Data-Driven VLSI Array for Arbitrary Algorithms. IEEE Computer 21 (October 1988) 30–43.

    Google Scholar 

  8. Mendelson, B., Koren, I.: Estimating the Potential Parallelism and Pipelining of Algorithms for Data Flow Machines. Journal of Parallel and Distributed Computing 14 (January 1992) 15–28.

    Google Scholar 

  9. Mendelson, B., Silberman, G.M.: Mapping Data Flow Programs on a VLSI Array of Processors. Proc. 14th Annual Int'l Symposium on Computer Architecture, June 1987, 72–80.

    Google Scholar 

  10. Robič, B., Kolbezen, P., Šilc, J.: Area Optimization of Dataflow-Graph Mappings. Parallel Computing 18, 3 (1992) 297–311.

    Google Scholar 

  11. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. (Prentice Hall, 1982).

    Google Scholar 

  12. Johnson, M.E., ed.: Simulated Annealing (SA) & Optimization: Modern Algorithms with VLSI, Optimal Design, and Missile Defence Applications. American Journal of Mathematical and Management Sciences 8, 3 & 4 (1988) 205–449.

    Google Scholar 

  13. Dueck, G., Scheuer, T.: Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Tech. Rep. TR 88.10.011, IBM Scientific Center, Heidelberg, October 1988.

    Google Scholar 

  14. Lee, C., Bic, L.: Comparing Quenching and Slow Simulated Annealing on the Mapping Problem. Proc. 3rd Annual Parallel Processing Symposium, March 1989, 671–685.

    Google Scholar 

  15. Robič, B., Kolbezen, P., Šilc, J.: Graph Compactor for Mapping of Algorithms on VLSI Processor Arrays. Proc. ISMM Int'l Workshop Parallel Computing, September 1991, 198–200.

    Google Scholar 

  16. Mendelson, B., Silberman, G.M.: Private communication.

    Google Scholar 

  17. Iannucci, R.A.: A Dataflow/von Neumann Hybrid Architecture. Tech. Rep. TR-418, Lab. Computer Science, MIT, Massachusetts, May 1988.

    Google Scholar 

  18. Šilc, J., Robič, B.: Synchronous Dataflow-Based Architecture. Microprocessing and Microprogramming 27, 1–5 (1989) 315–322.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Architectures, Institute Jožef Stefan, Jamova 39, 61111, Ljubljana, Slovenia

    Borut Robič & Jurij Šilc

Authors
  1. Borut Robič
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jurij Šilc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robič, B., Šilc, J. (1993). High-performance computing on a honeycomb architecture. In: Volkert, J. (eds) Parallel Computation. ACPC 1993. Lecture Notes in Computer Science, vol 734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57314-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-57314-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48055-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation