Non-stalling circular counterflow pipeline processor with...

Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or... – Reducing an impact of a stall or pipeline bubble

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07117345

ABSTRACT:
A method of executing more than one thread at a time in a computer system that has a plurality of threads, including a first and second thread. The method comprises providing a first and a second reorder buffer, reading first instructions and first operands associated with the first thread from the first reorder buffer, executing one of the first instructions and storing a result in the first reorder buffer which includes marking the result with a tag associating the result with the first thread, reading second instructions and second operands associated with the second thread from the second reorder buffer, and executing one of the second instructions and storing a result in the second reorder buffer which includes marking the result with a tag associating the result with the second thread.

REFERENCES:
patent: 4658355 (1987-04-01), Hatakeyama et al.
patent: 5363495 (1994-11-01), Fry et al.
patent: 5428807 (1995-06-01), McKeen et al.
patent: 5497499 (1996-03-01), Garg et al.
patent: 5572690 (1996-11-01), Molnar et al.
patent: 5600848 (1997-02-01), Sproull et al.
patent: 5682493 (1997-10-01), Yung et al.
patent: 5699460 (1997-12-01), Kopet et al.
patent: 5704054 (1997-12-01), Bhattacharya
patent: 5748936 (1998-05-01), Karp et al.
patent: 5758139 (1998-05-01), Sutherland et al.
patent: 5805838 (1998-09-01), Sutherland et al.
patent: 5838939 (1998-11-01), Sutherland
patent: 5913059 (1999-06-01), Torii
patent: 5943491 (1999-08-01), Sutherland et al.
patent: 5944816 (1999-08-01), Dutton et al.
patent: 5974524 (1999-10-01), Cheong et al.
patent: 5987588 (1999-11-01), Popescu et al.
patent: 6065109 (2000-05-01), Coates
patent: 6085316 (2000-07-01), Sutherland et al.
patent: 6185668 (2001-02-01), Arya
patent: 6205538 (2001-03-01), Yung
patent: 6381692 (2002-04-01), Martin et al.
patent: 6691222 (2004-02-01), Janik et al.
Bhandarkar, D. , et al., “Performance Characterization of the Pentium Pro Processor”,Proceedings of the Third International Symposium on High-Performance Computer Architecture, San Antonio, TX, (Feb. 1-5, 1997) ,pp. 288-297.
Burger, D. , “The SimpleScalar Tool Set, Version 2.0”,University of Wisconsin-Madison Computer Sciences Department Technical Report #1342, (Jun. 1997), pp. 1-21.
Carlson, R. , et al., “VRP Simulator”, http://www.ece.orst.edu/˜silu/cfpp/vrpsim/docs/vrpsim.html, (Apr. 1996), 12 p.
Childers, B. R., et al., “A Design Environment for Counterflow Pipeline Synthesis”,ACM Sigplan Workshop Proceedings on Languages, Compilers, and Tools for Embedded Systems, Montreal, Canada, (Jun. 19-20, 1998), pp. 223-234.
Childers, B. R., et al., “Application-Specific Pipelines for Exploiting Instruction-Level Parallelism”,University of Virginia Computer Science Technical Report No. CS-98-14, (May 1, 1998), 10 p.
Childers, B. R., et al., “Automatic Counterflow Pipeline Synthesis”,University of Virginia Computer Science Technical Report No. CS-98-01, (Jan. 1998), 6 p.
Childers, B. R., et al., “Synthesis of Application-Specific Counterflow Pipelines”,Department of Computer Science Slides of the Workshop on the Interaction between Compilers and Computer Architecture, San Jose, CA, (Feb. 4, 1996), 5 p.
Janik, Kenneth J., et al., “Advances of the Counterflow Pipeline Microarchitecture”,IEEE Computer Soc. Press—Proceedings of the Third International Symposium on High-Performance Computer Architecture, (1997), 7 p.
Janik, K. J., et al., “Synchronous Implementation of a Counterflow Pipeline Processor”,Proceedings of the 1996 International Symposium on Circuits and Systems, 4, (May 12-15, 1996), 6 p.
Jones, M. D., “A New Approach to Microprocessors”, http://lal.cs.byu.edu/people/jones/latex/sproull.html/sproull.html.html, (1994), pp. 1-17.
Jones, Michael D., “ Future Computer Plumbing”,Insight, 10 (1), (1994), pp. 50-61.
Josephs, M. B., et al., “Formal design of an asynchronous DSP counterflow pipeline: a case study in Handshake Algebra”,Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems, Salt Lake City, Utah, (Nov. 3-5, 1994), pp. 206-215.
Korver, “Asynchronous implementation of the SCPP-A counterflow pipelined processor”, pp. 287-294.
Lo, J. L., et al., “Converting Thread-Level Parallelism to Instruction-Level Parallelism via Simultaneous Multithreading”,ACM Transactions on Compuater Systems, 15(3), (Aug. 1997), pp. 322-354.
Miller, et al., “Non-Stalling Counterflow Architecture”, (Feb., 1998),334-341.
Smith, J. E., et al., “The Microarchitecture of Superscalar Processors”,Proceedings of the IEEE, 83 (12), (Dec. 1995), pp. 1609-1624.
Sproull, Robert F., et al., “The Counterflow Pipeline Processor Architecture”,IEEE Design&Test of Computers, vol. 11, No. 5, (Fall 1994), pp. 48-59.
Werner, “Asynchronous Processor Survey”,IEEE, (Nov. 1997), 67-76.
Werner, et al., “Counterflow Pipeline Based Dynamic Instruction Scheduling”,IEEE, 69-79.
Yakovlev, A., “Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets”,University of Newcastle upon Tyne Technical Report No. 522, (May 3, 1995), pp. 1-24.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Non-stalling circular counterflow pipeline processor with... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Non-stalling circular counterflow pipeline processor with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-stalling circular counterflow pipeline processor with... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3638712

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.