Skip to main content

On the Design of a Register Queue Based Processor Architecture (FaRM-rq)

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

Abstract

We propose in this paper a processor architecture that supports multi instructions set through run time functional assignment algorithm (RUNFA). The above processor, which is named Functional Assignment Register Microprocessor (FaRM-rq) supports queue and register based instruction set architecture and functions into different modes: (1) R-mode (FRM) - when switched for register based instructions support, and (2) Q-mode (FQM) - when switched for Queue based instructions support. The entities share a common data path and may operate independently though not in parallel.

In FRM mode, the machine’s shared storage unit (SSU) behaves as a conventional register file. However, in FQM mode, the system organizes the SSU access as a first-in-first-out latches, thus accesses concentrate around a small window and the addressing of registers is implicit trough the Queue head and tail pointers.

First, we present the novel aspects of the FaRM-rq1 architecture. Then, we give the novel FQM fundamentals and the principles underlying the architecture.

The above architecture embraces multiprogramming languages and will combine the best features of Queue, Register and Stack models of computing.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Okamoto S., Suzuki A., Maeda A., Sowa M.: Design of a Superscalar Processor Based on Queue Machine Computation Model. IEEE PACRIM99, (1999) 151–154

    Google Scholar 

  2. Sohi G.: Instructions Issue logic for high-performance, interruptible, Multiple Functional Unit, Pipelined Computer. IEEE Trans. on Computers, vol.39, No.3, (1990) 349–359

    Article  Google Scholar 

  3. Abderazek B. A., Kirilka N., Sowa M.: FARM-Queue Mode: On a Practical Queue Execution model. Proc. of the Int. Conf. on Circuits and Systems, Computers and Communications, Tokushima, (2001) 939–944

    Google Scholar 

  4. Michael K. M., Harvey G.C.: Processor Implementations Using Queues. IEEE, Micro, (1995) 58–66

    Google Scholar 

  5. Philip K.: Stack Computers, the new Wave. Mountain View Press (1989)

    Google Scholar 

  6. Sowa Laboratory: http://www.sowa.is.uec.ac.jp

    Google Scholar 

  7. Bruno R., Carla V.: Data Flow on Queue Machines. 12th Int. IEEE Symposium on Computer Architecture, (1995) 342–351

    Google Scholar 

  8. Suzuki H., Shusuke O., Maeda A., Sowa M.: Implementation and evaluation of a Superscalar Processor Based on Queue Machine Computation Model. IPSJ SIG, Vol.99, No. 21 (1999) 91–96

    Google Scholar 

  9. Smith J. E., Sohi G. S.: The microarchitecture of Superscalar processors. Proceedings of the IEEE, vol. 83, (no. 12), (1995) 1609–1624

    Article  Google Scholar 

  10. Silc J., Robic B., Ungerer T.: Processor Architecture: From Dataflow to Superscalar and Beyond. Springer-Verlag, Berlin, Heidelberg, New York (1999)

    MATH  Google Scholar 

  11. Periss B. R.: Data Flow on a Queue Machine. Doctoral thesis, Department of Electrical Engineering, University of Toronto, Toronto (1987)

    Google Scholar 

  12. Palacharia, Joupi N. P, Smith J.E: Complexity-Effective Superscalar Processor. Ph.D. dissertation, Univ. of Wisconsin (1998)

    Google Scholar 

  13. Abderazek B.A., Sowa M.: DRA: Dynamic Register Allocator Mechanism for FaRM Microprocessor. The 3rd International Workshop on Advanced Parallel Processing Technologies, IWAPPT99, (1999) 131–136

    Google Scholar 

  14. Abderazek B.A.: Dynamic Instructions Issue Algorithm and a Queue Execution Model Toward the Design of a Hybrid Processor Architecture. PhD. Thesis, IS Graduate School, Univ. of Electro-Communications, (2002)

    Google Scholar 

  15. Sowa M.: Fundamental of Queue machine. The Univ. of Electro-Communications, Sowa Laboratory, Technical Reports SLL30305, (2003)

    Google Scholar 

  16. Radhakrishnan R., Talla D., John L. K.: Allowing for ILP in an Embedded Java Processor. Proceedings of IEEE/ACM International Symposium on Computer Architecture, Vancouver, CA, (2000) 294–305

    Google Scholar 

  17. Sowa M.: Queue Processor Instruction Set Design. The Univ. of Electro-Communications, Sowa laboratory, Technical Report SLL97301, (1997)

    Google Scholar 

  18. Sowa M., Abderazek B.A, Shigeta S., Nikolova K., D. Yoshinaga T. Proposal and Design of a Parallel Queue Processor Architecture (PQP), 14th IASTED Int. Conf. on Parallel and Distributed Computing and System, Cambridge, USA, (2002) 554–560

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abderazek, B.A., Shigeta, S., Yoshinaga, T., Sowa, M. (2003). On the Design of a Register Queue Based Processor Architecture (FaRM-rq). In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics