Parallel multi-threaded processing

Wolrich , et al. October 19, 2

Patent Grant RE41849

U.S. patent number RE41,849 [Application Number 11/159,427] was granted by the patent office on 2010-10-19 for parallel multi-threaded processing. This patent grant is currently assigned to Intel Corporation. Invention is credited to Matthew J. Adiletta, Debra Bernstein, William Wheeler, Gilbert Wolrich.


United States Patent RE41,849
Wolrich ,   et al. October 19, 2010

Parallel multi-threaded processing

Abstract

A parallel, multi-threaded processor system and technique for arbitrating command requests is described. The system includes a plurality of microengines, a plurality of shared system resources and a global command arbiter. The global command arbiter uses a command request protocol that is based on the shared system resources and command type to grant or deny a microengine command request for a shared resource.


Inventors: Wolrich; Gilbert (Framingham, MA), Bernstein; Debra (Sudbury, MA), Adiletta; Matthew J. (Worcester, MA), Wheeler; William (Southborough, MA)
Assignee: Intel Corporation (Santa Clara, CA)
Family ID: 23868021
Appl. No.: 11/159,427
Filed: June 22, 2005

Related U.S. Patent Documents

Application Number Filing Date Patent Number Issue Date
09470541 Dec 22, 1999 6532509
Reissue of: 10339221 Jan 9, 2003 06587906 Jul 1, 2003

Current U.S. Class: 710/240; 718/104; 710/52
Current CPC Class: G06F 9/3851 (20130101)
Current International Class: G06F 13/00 (20060101); G06F 13/14 (20060101)
Field of Search: ;718/1,100,102,103,104,106,107 ;710/305,240-244,200,40,107,52,56,20,7,105,313,310 ;712/32,36 ;370/464,910 ;709/200,201,217,231,104 ;711/148,150,151 ;361/679,683,760

References Cited [Referenced By]

U.S. Patent Documents
3373408 March 1968 Ling
3478322 November 1969 Evans
3623001 November 1971 Kleist et al.
3736566 May 1973 Anderson et al.
3792441 February 1974 Wymore et al.
3889243 June 1975 Drimak
3940745 February 1976 Sajeva
4016548 April 1977 Law et al.
4032899 June 1977 Jenny et al.
4075691 February 1978 Davis et al.
4130890 December 1978 Adam
4400770 August 1983 Chan et al.
4514807 April 1985 Nogi
4523272 June 1985 Fukunaga et al.
4658351 April 1987 Teng
4709347 November 1987 Kirk
4745544 May 1988 Renner et al.
4788640 November 1988 Hansen
4831358 May 1989 Ferrio et al.
4858108 August 1989 Ogawa et al.
4866664 September 1989 Burkhardt, Jr. et al.
4890218 December 1989 Bram
4890222 December 1989 Kirk
4991112 February 1991 Callemyn
5115507 May 1992 Callemyn
5140685 August 1992 Sipple et al.
5142683 August 1992 Burkhardt, Jr. et al.
5155831 October 1992 Emma et al.
5155854 October 1992 Flynn et al.
5168555 December 1992 Byers et al.
5173897 December 1992 Schrodi et al.
5251205 October 1993 Callon et al.
5255239 October 1993 Taborn et al.
5263169 November 1993 Genusov et al.
5313454 May 1994 Bustini et al.
5347648 September 1994 Stamm et al.
5367678 November 1994 Lee et al.
5379295 January 1995 Yonehara
5379432 January 1995 Orton et al.
5390329 February 1995 Gaertner et al.
5392391 February 1995 Caulk, Jr. et al.
5392411 February 1995 Ozaki
5392412 February 1995 McKenna
5404464 April 1995 Bennett
5404469 April 1995 Chung et al.
5404482 April 1995 Stamm et al.
5432918 July 1995 Stamm
5448702 September 1995 Garcia, Jr. et al.
5450351 September 1995 Heddes
5452437 September 1995 Richey et al.
5452452 September 1995 Gaetner et al.
5459842 October 1995 Begun et al.
5459843 October 1995 Davis et al.
5463625 October 1995 Yasrebi
5467452 November 1995 Blum et al.
5475856 December 1995 Kogge
5485455 January 1996 Dobbins et al.
5515296 May 1996 Agarwal
5517648 May 1996 Bertone et al.
5539737 July 1996 Lo et al.
5542070 July 1996 LeBlanc et al.
5542088 July 1996 Jennings, Jr. et al.
5544236 August 1996 Andruska et al.
5550816 August 1996 Hardwick et al.
5557766 September 1996 Takiguchi et al.
5568476 October 1996 Sherer et al.
5568617 October 1996 Kametani
5574922 November 1996 James
5581729 December 1996 Nishtala et al.
5592622 January 1997 Isfeld et al.
5613071 March 1997 Rankin et al.
5613136 March 1997 Casavant et al.
5617327 April 1997 Duncan
5623489 April 1997 Cotton et al.
5627829 May 1997 Gleeson et al.
5630074 May 1997 Beltran
5630130 May 1997 Perotto et al.
5633865 May 1997 Short
5644623 July 1997 Gulledge
5649110 July 1997 Ben-Nun et al.
5649157 July 1997 Williams
5651002 July 1997 Van Seters et al.
5659687 August 1997 Kim et al.
5680641 October 1997 Sidman
5689566 November 1997 Nguyen
5692126 November 1997 Templeton et al.
5699537 December 1997 Sharangpani et al.
5701434 December 1997 Nakagawa
5717898 February 1998 Kagan et al.
5721870 February 1998 Matsumoto
5724574 March 1998 Stratigos et al.
5740402 April 1998 Bratt et al.
5742587 April 1998 Zornig et al.
5742782 April 1998 Ito et al.
5742822 April 1998 Motomura
5745913 April 1998 Pattin et al.
5751987 May 1998 Mahant-Shetti et al.
5754764 May 1998 Davis et al.
5761507 June 1998 Govett
5761522 June 1998 Hisanaga et al.
5764915 June 1998 Heimsoth et al.
5768528 June 1998 Stumm
5781551 July 1998 Born
5781774 July 1998 Krick
5784649 July 1998 Begur et al.
5784712 July 1998 Byers et al.
5796413 August 1998 Shipp et al.
5797043 August 1998 Lewis et al.
5805816 September 1998 Picazo, Jr. et al.
5809235 September 1998 Sharma et al.
5809237 September 1998 Watts et al.
5809530 September 1998 Samra et al.
5812868 September 1998 Moyer et al.
5828746 October 1998 Ardon
5828863 October 1998 Barrett et al.
5828881 October 1998 Wang
5828901 October 1998 O'Toole et al.
5832215 November 1998 Kato et al.
5835755 November 1998 Stellwagen, Jr.
5838988 November 1998 Panwar et al.
5850399 December 1998 Ganmukhi et al.
5850530 December 1998 Chen et al.
5854922 December 1998 Gravenstein et al.
5857188 January 1999 Douglas
5860138 January 1999 Engebretsen et al.
5860158 January 1999 Pai et al.
5886992 March 1999 Raatikainen et al.
5887134 March 1999 Ebrahim
5890208 March 1999 Kwon
5892979 April 1999 Shiraki et al.
5898686 April 1999 Virgile
5898701 April 1999 Johnson
5905876 May 1999 Pawlowski et al.
5905889 May 1999 Wilhelm, Jr.
5909686 June 1999 Muller et al.
5915123 June 1999 Mirsky et al.
5918235 June 1999 Kirshenbaum et al.
5933627 August 1999 Parady
5937187 August 1999 Kosche et al.
5938736 August 1999 Muller et al.
5940612 August 1999 Brady et al.
5940866 August 1999 Chisholm et al.
5946487 August 1999 Dangelo
5948081 September 1999 Foster
5953336 September 1999 Moore et al.
5958031 September 1999 Kim
5961628 October 1999 Nguyen et al.
5968169 October 1999 Pickett
5970013 October 1999 Fischer et al.
5974518 October 1999 Nogradi
5978838 November 1999 Mohamed et al.
5983274 November 1999 Hyder et al.
5995513 November 1999 Harrand et al.
6012151 January 2000 Mano
6014729 January 2000 Lannan et al.
6023742 February 2000 Ebeling et al.
6032190 February 2000 Bremer et al.
6032218 February 2000 Lewin et al.
6047002 April 2000 Hartmann et al.
6049867 April 2000 Eickemeyer et al.
6058168 May 2000 Braband
6061710 May 2000 Eickemeyer et al.
6067300 May 2000 Baumert et al.
6067585 May 2000 Hoang
6070231 May 2000 Ottinger
6072781 June 2000 Feeney et al.
6073215 June 2000 Snyder
6079008 June 2000 Clery, III
6085215 July 2000 Ramakrishnan et al.
6085248 July 2000 Sambamurthy et al.
6085294 July 2000 Van Doren et al.
6092127 July 2000 Tausheck
6092158 July 2000 Harriman et al.
6104700 August 2000 Haddock et al.
6111886 August 2000 Stewart
6112016 August 2000 MacWilliams et al.
6122251 September 2000 Shinohara
6128669 October 2000 Moriarty et al.
6134665 October 2000 Klein et al.
6141677 October 2000 Hanif et al.
6141689 October 2000 Yasrebi
6141765 October 2000 Sherman
6144669 November 2000 Williams et al.
6145054 November 2000 Mehrotra et al.
6157955 December 2000 Narad et al.
6160562 December 2000 Chin et al.
6170051 January 2001 Dowling
6175927 January 2001 Cromer et al.
6182177 January 2001 Harriman
6195676 February 2001 Spix et al.
6199133 March 2001 Schnell
6201807 March 2001 Prasanna
6212542 April 2001 Kahle et al.
6212544 April 2001 Borkenhagen et al.
6212604 April 2001 Tremblay
6212611 April 2001 Nizar et al.
6216220 April 2001 Hwang
6223207 April 2001 Lucovsky et al.
6223238 April 2001 Meyer et al.
6223243 April 2001 Ueda et al.
6223274 April 2001 Catthoor et al.
6223279 April 2001 Nishimura et al.
6247025 June 2001 Bacon
6256713 July 2001 Audityan et al.
6269391 July 2001 Gillespie
6272109 August 2001 Pei et al.
6272520 August 2001 Sharangpani et al.
6272616 August 2001 Fernando et al.
6275505 August 2001 O'Loughlin et al.
6279113 August 2001 Vaidya
6282169 August 2001 Kiremidjian
6286083 September 2001 Chin et al.
6289011 September 2001 Seo et al.
6295600 September 2001 Parady
6298370 October 2001 Tang et al.
6307789 October 2001 Wolrich et al.
6311261 October 2001 Chamdani et al.
6320861 November 2001 Adam et al.
6324624 November 2001 Wolrich et al.
6335932 January 2002 Kadambi et al.
6338078 January 2002 Chang et al.
6345334 February 2002 Nakagawa et al.
6347344 February 2002 Baker et al.
6349331 February 2002 Andra et al.
6356962 March 2002 Kasper
6359911 March 2002 Movshovich et al.
6360262 March 2002 Guenthner et al.
6360277 March 2002 Ruckley et al.
6366998 April 2002 Mohamed
6373848 April 2002 Allison et al.
6377998 April 2002 Noll et al.
6389031 May 2002 Chao et al.
6389449 May 2002 Nemirovsky et al.
6393026 May 2002 Irwin
6393483 May 2002 Latif et al.
6404737 June 2002 Novick et al.
6415338 July 2002 Habot
6418488 July 2002 Chilton et al.
6424657 July 2002 Voit et al.
6424659 July 2002 Viswanadham et al.
6426940 July 2002 Seo et al.
6426943 July 2002 Spinney et al.
6427196 July 2002 Adiletta et al.
6430626 August 2002 Witkowski et al.
6434145 August 2002 Opsasnick et al.
6438132 August 2002 Vincent et al.
6438134 August 2002 Chow et al.
6448812 September 2002 Bacigalupo
6453404 September 2002 Bereznyi et al.
6457015 September 2002 Eastham
6463035 October 2002 Moore
6463072 October 2002 Wolrich et al.
6463480 October 2002 Kikuchi et al.
6463527 October 2002 Vishkin
6466898 October 2002 Chan
6477562 November 2002 Nemirovsky et al.
6484224 November 2002 Robins et al.
6501731 December 2002 Bleszynski et al.
6507862 January 2003 Joy et al.
6522188 February 2003 Poole
6526451 February 2003 Kasper
6526452 February 2003 Petersen et al.
6529983 March 2003 Marshall et al.
6532509 March 2003 Wolrich et al.
6535878 March 2003 Guedalia et al.
6552826 April 2003 Adler et al.
6553406 April 2003 Berger et al.
6560667 May 2003 Wolrich et al.
6570850 May 2003 Gutierrez et al.
6577542 June 2003 Wolrich et al.
6584522 June 2003 Wolrich et al.
6604125 August 2003 Belkin
6606704 August 2003 Adiletta et al.
6625654 September 2003 Wolrich et al.
6628668 September 2003 Hutzli et al.
6629147 September 2003 Grow
6629236 September 2003 Aipperspach et al.
6631422 October 2003 Althaus et al.
6631430 October 2003 Wolrich et al.
6631462 October 2003 Wolrich et al.
6657963 December 2003 Paquette et al.
6658551 December 2003 Berenbaum et al.
6661774 December 2003 Lauffenburger et al.
6661794 December 2003 Wolrich et al.
6665699 December 2003 Hunter et al.
6665755 December 2003 Modelski et al.
6667920 December 2003 Wolrich et al.
6668317 December 2003 Bernstein et al.
6671827 December 2003 Guilford et al.
6675190 January 2004 Schabernack et al.
6675192 January 2004 Emer et al.
6678746 January 2004 Russell et al.
6680933 January 2004 Cheesman et al.
6681300 January 2004 Wolrich et al.
6684326 January 2004 Cromer et al.
6694380 February 2004 Wolrich et al.
6697379 February 2004 Jacquet et al.
6721325 April 2004 Duckering et al.
6724767 April 2004 Chong et al.
6728845 April 2004 Adiletta
6732187 May 2004 Lougheed et al.
6754211 June 2004 Brown
6754222 June 2004 Joung et al.
6768717 July 2004 Reynolds et al.
6775284 August 2004 Calvignac et al.
6792488 September 2004 Wolrich et al.
6798744 September 2004 Bradshaw et al.
6826615 November 2004 Barrall et al.
6834053 December 2004 Stacey et al.
6850521 February 2005 Kadambi et al.
6856622 February 2005 Calamvokis et al.
6873618 March 2005 Weaver
6876561 April 2005 Adiletta et al.
6895457 May 2005 Wolrich et al.
6925637 August 2005 Thomas et al.
6931641 August 2005 Davis et al.
6934780 August 2005 Modelski et al.
6934951 August 2005 Wilkinson et al.
6938147 August 2005 Joy et al.
6944850 September 2005 Hooper et al.
6947425 September 2005 Hooper et al.
6952824 October 2005 Hooper et al.
6959002 October 2005 Wynne et al.
6967963 November 2005 Houh et al.
6976095 December 2005 Wolrich et al.
6981077 December 2005 Modelski et al.
6983350 January 2006 Wheeler et al.
7006495 February 2006 Hooper
7065569 June 2006 Teraslinna
7069548 June 2006 Kushlis
7096277 August 2006 Hooper
7100102 August 2006 Hooper et al.
7111072 September 2006 Matthews et al.
7111296 September 2006 Wolrich et al.
7124196 October 2006 Hooper
7126952 October 2006 Hooper et al.
7149786 December 2006 Bohringer et al.
7181742 February 2007 Hooper
7191321 March 2007 Bernstein et al.
7206858 April 2007 Hooper et al.
7248584 July 2007 Hooper
7305500 December 2007 Adiletta et al.
7328289 February 2008 Wolrich et al.
7352769 April 2008 Hooper et al.
2001/0023487 September 2001 Kawamoto
2002/0027448 March 2002 Bacigalupo
2002/0041520 April 2002 Wolrich et al.
2002/0075878 June 2002 Lee et al.
2002/0118692 August 2002 Oberman et al.
2002/0150047 October 2002 Knight et al.
2002/0181194 December 2002 Ho et al.
2003/0043803 March 2003 Hooper
2003/0067934 April 2003 Hooper et al.
2003/0086434 May 2003 Kloth
2003/0105917 June 2003 Ostler et al.
2003/0110166 June 2003 Wolrich et al.
2003/0115347 June 2003 Wolrich et al.
2003/0115426 June 2003 Rosenbluth et al.
2003/0131198 July 2003 Wolrich et al.
2003/0140196 July 2003 Wolrich et al.
2003/0145159 July 2003 Adiletta et al.
2003/0147409 August 2003 Wolrich et al.
2003/0161303 August 2003 Mehrvar et al.
2003/0161337 August 2003 Weinman
2003/0196012 October 2003 Wolrich et al.
2003/0210574 November 2003 Wolrich et al.
2003/0231635 December 2003 Kalkunte et al.
2004/0039895 February 2004 Wolrich et al.
2004/0052269 March 2004 Hooper et al.
2004/0054880 March 2004 Bernstein et al.
2004/0059828 March 2004 Hooper et al.
2004/0071152 April 2004 Wolrich et al.
2004/0073728 April 2004 Wolrich et al.
2004/0073778 April 2004 Adiletta et al.
2004/0085901 May 2004 Hooper et al.
2004/0098496 May 2004 Wolrich et al.
2004/0109369 June 2004 Wolrich et al.
2004/0148382 July 2004 Narad et al.
2004/0162933 August 2004 Adiletta et al.
2004/0252686 December 2004 Hooper et al.
2005/0033884 February 2005 Wolrich et al.
2005/0149665 July 2005 Wolrich et al.
2006/0007871 January 2006 Welin
2006/0069882 March 2006 Wheeler et al.
2006/0156303 July 2006 Hooper et al.
Foreign Patent Documents
0 379 709 Aug 1990 EP
0 464 715 Jan 1992 EP
0 633 678 Jan 1995 EP
0 745 933 Dec 1996 EP
0 773 648 May 1997 EP
0 809 180 Nov 1997 EP
0 959 602 Nov 1999 EP
59-111533 Jun 1984 JP
WO 94/15287 Jul 1994 WO
WO 97/38372 Oct 1994 WO
WO 98/20647 May 1998 WO
WO 00/38376 Jun 2000 WO
WO 00/56024 Sep 2000 WO
WO 01/16718 Mar 2001 WO
WO 01/16769 Mar 2001 WO
WO 01/16770 Mar 2001 WO
WO 01/16782 Mar 2001 WO
WO 01/17179 Mar 2001 WO
WO 01/31856 May 2001 WO
WO 01/48596 Jul 2001 WO
WO 01/48606 Jul 2001 WO
WO 01/48619 Jul 2001 WO
WO 01/50247 Jul 2001 WO
WO 01/50679 Jul 2001 WO
WO 03/030461 Apr 2003 WO

Other References

"Performance modeling and architecture exploration of network processors" by Govind et al. (abstract only) Publication Date: Sep. 19-22, 2005. cited by examiner .
"10-/100-Mbps Ethernet Media Access Controller (MAC) Core", NEC, 1988, pp. 1-5. cited by other .
"Enterprise Hardware, Intel Expected to Unveil New Networking Chip," News.Com, Aug. 26, 1999, <http://new.com.com/Intel+expected+to+unveil+new+networking+chip/2100-- 1001_3230315.html> (accessed on Aug. 23, 2005), pp. 1-5. cited by other .
"The ATM Forum Technical Committee Traffic Management Specification Version 4.1", The ATM Forum (Mar. 1999). cited by other .
Beckerle, M.J., "Overview of the START (*T) multithreaded computer" (abstract only), Publication Date: Feb. 22-26, 1993. cited by other .
Byrd et al., "Multithread Processor Architectures," IEEE Spectrum, 32(8):38-46, New York, Aug. 1995. cited by other .
Chandranmenon, G.P., et al., "Trading Packet Headers for Packet Processing" IEEE/ACM Transactions on Networking, 4(2):141-152, Apr. 1996. cited by other .
Dictionary of Computer Words: An A to Z Guide to Today's Computers, Revised Edition, Houghton Mifflin Company: Boston, Massachusetts, pp. 220, (1995). cited by other .
Digital Semiconductor 21140A PCI Fast Ethernet LAN Controller, Hardware Reference Manual, Digital Equipment Corporation, pp. i-x, 1-1 through 1-5, 2-1 throught 2-12, 3-1 through 3-38, 4-31 through 5-2, 6-1 through 6-24, (Mar. 1998). cited by other .
Doyle et al., Microsoft Press Computer Dictionary, 2.sup.nd ed., Microsoft Press, Redmond, Washington, USA, p. 326, (1994). cited by other .
Fillo et al., "The M-Machine Multicomputer," IEEE Proceedings of MICRO-28, pp. 146-156, (1995). cited by other .
Frazier, Howard, "Gigabit Ethernet: From 100 to 1,000 Mbps", IEEE Internet Computing, pp. 24-31, (1999). cited by other .
Frazier, Howard, "The 802.3z Gigabit Ethernet: Standard", IEEE Network, pp. 6-7, (1998). cited by other .
Giroux, N., et al., "Queuing and Scheduling: Quality of Service in ATM Networks, Chapter 5", Quality of Service in ATM Networks: State-of-the-Art Traffic Management, pp. 96-121 (1998). cited by other .
Gomez et al., "Efficient Multithreaded User-Space Transport for Network Computing: Design and Test of the TRAP Protocol," Journal of Parallel and Distributed Computing, Academic Press, Duluth, Minnesota, USA, 40(1):103-117, Jan. 1997. cited by other .
Haug et al., "Reconfigurable hardware as shared resource for parallel threads," IEEE Symposium on FPGAs for Custom Computing Machines, 2 pages, (1998). cited by other .
Hauser et al., "Garp: a MIPS processor with a reconfigurable coprocessor," Proceedings of the 5.sup.th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 12-21, (1997). cited by other .
Hyde, R., "Overview of Memory Management," Byte, 13(4):219-225, (1988). cited by other .
Ippoliti, A., et al., "Parallel Media Access Controller for Packet Communications at Gb/s Rates", IEEE, pp. 991-996, (1990). cited by other .
Jenks, S., et al., "Nomadic Threads: A migrating multithread approach to remote memory accesses in multiprocessors" (abstract only), Publication Date: Oct. 20-23, 1996. cited by other .
Kaiserswerth, M., "The parallel Protocol Engine", IEEE/ACM Transactions on Networking, 1(6):650-663, Dec. 1993. cited by other .
Khailany, B., et al., "Imagine: Media Processing with Streams," IEEE Micro, Mar.-Apr. 2001, pp. 35-46. cited by other .
Leon-Garcia, A., Communication Networks: Fundamental Concepts and Key Architectures, McGraw-Hill Higher Education, Copyright 2000, pp. 195-198, 215-219, & 380-385. cited by other .
Lim, A., et al., "Improving Performance of Adaptive Media Access Control Protocols for High-Density Wireless Networks", Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 'pp) , pp. 316-321, Jun. 1999. cited by other .
Litch et al., "StrongARMing Portable Communications," IEEE Micro, 18(2):48-55, Mar. 1998. cited by other .
Mollenauer, J.F., et al., "An Efficient Media Access Control Protocol for Broadband Wireless Access Systems" IEEE Standard, IEEE 802.16 Broadband Wireless Access Working Group, 19 pages, Oct. 1999. cited by other .
Ocheltree, K.B., et al., "A Comparison of fibre channel and 802 MAC services", Proceedings of 18th Conference on Local Computer Networks, abstract only, 1 page, Sep. 1993. cited by other .
Schmidt et al., "The Performance of Alternative Threading Architectures for Parallel Communication Subsystems," Internet Document, Online!, Nov. 13, 1998, pp. 1-19. cited by other .
Shaw, M.C., et al., UNIX Internals: A Systems Operations Handbook, Windcrest Books, pp. 30-37, 1987. cited by other .
Thistle et al., "A Processor Architecture for Horizon," IEEE Proc. Supercomputing '88, pp. 35-41, Nov. 1988. cited by other .
Todorova, P., et al., "Quality-of-Service-Oriented Media Access Control for Advanced Mobile Multimedia Satellite Systems", Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03), 8 pages, Jan. 2003. cited by other .
Tremblay et al., "A Three Dimensional Register File for Superscalar Processors," IEEE Proceedings of the 28th Annual Hawaii International Conference on System Sciences, pp. 191-201, (1995). cited by other .
Trimberger et al, "A time-multiplexed FPGA," Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 22-28, (1997). cited by other .
Turner et al., "Design of a High Performance Active Router," Internet Document, Online!, 20 pages, Mar. 18, 1999. cited by other .
Vibhatavanij et al., "Simultaneous Multithreading-Based Routers," Proceedings of the 2000 International Conference of Parallel Processing, Toronto, Ontario, Canada, Aug. 21-24, 2000, pp. 362-369. cited by other .
Vuppala, V., et al., "Layer-3 switching using virtual network ports", IEEE Proc. Computer Communications and Networks, pp. 642-648, 1999. cited by other .
Wazlowski et al., "PRSIM-II computer and architecture," IEEE Proceedings, Workshop on FPGAs for Custom Computing Machines, pp. 9-16, (1993). cited by other .
Wikipedia entry, "Media Access Control", retrieved from http://en.wikipedia.org/wiki/Media_access_control, 2 pages, Jul. 31, 2007. cited by other .
U.S. Appl. No. 09/473,571, filed Dec. 28, 1999, Wolrich et al. cited by other .
U.S. Appl. No. 09/475,614, filed Dec. 30, 1999, Wolrich et al. cited by other .
Agarwal et al., "April: A Processor Architecture for Multiprocessing", Laboratory for Computer Science, MIT, 1990 IEEE, pp. 104-114. cited by other .
Chappell et al., "Simultaneous Subordinate Microthreading (SSMT)", 1999 IEEE, pp. 186-195. cited by other .
Farrens et al., "Strategies for Achieving Improved Processor Throughput," 1991 ACM, pp. 362-369. cited by other.

Primary Examiner: Auve; Glenn A
Attorney, Agent or Firm: Blakely, Sokoloff, Taylor & Zafman LLP

Parent Case Text



This application is a continuation of U.S. application Ser. No. 09/470,541 filed on Dec. 22, 1999, now U.S. Pat. No. 6,532,509.
Claims



What is claimed is:

1. A method for using a parallel, multi-threaded processor system comprising: processing threads with a plurality of microengines, at least one microengine capable of processing at least two independent threads; processing commands issued by the microengines using a plurality of system resource interface units that each include at least one commands queue; and utilizing a global command arbiter including a pointer to store the identity of .[.the.]. .Iadd.a .Iaddend.last agent that had a request granted to determine whether a particular microengine command request should be granted.

2. The method of claim 1 wherein each microengine utilizes a FIFO commands register.

3. The method of claim 1 wherein the system resource units include at least one of a core controller, a SDRAM controller, a SRAM controller, a PCI bus interface and an FBUS interface.

4. The method of claim 3 wherein in at least one of the SDRAM controller, the SRAM controller and the FBUS interface utilize three command queues.

5. The method of claim 3 wherein in at least one of the SDRAM controller and the SRAM controller utilize a high priority queue.

6. The method of claim 3 wherein the SRAM controller utilizes a read lock fail queue.

7. The method of claim 3 wherein the PCI bus interface utilizes a single command register.

8. The method of claim 1, wherein the agent comprises at least one of the following: a microengine and a microengine thread.

9. The method of claim 1, wherein the threads comprise at least one thread that operates on a packet.

10. A communications system comprising: at least one Ethernet medium access controller (MAC); a multithreaded processor, the processor including: a plurality of microengines for processing a plurality of hardware threads; at least one of an ASB translator, a PCI bus interface, a SDRAM controller, a SRAM controller, and an bus interface to the Ethernet MAC; and a global command arbiter including a pointer to store the identity of .[.the.]. .Iadd.a .Iaddend.last agent that had a request granted to determine whether a particular command request should be granted.

11. The system of claim 10 further comprising a FIFO commands register for each microengine.

12. The system of claim 10 wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface includes three command queues.

13. The system of claim 10 wherein at least one of the SDRAM controller and the SRAM controller includes a high priority queue.

14. The system of claim 10 wherein the SRAM controller includes a read lock fail queue.

15. The system of claim 10 wherein the PCI bus interface includes a single command register.

16. The .[.method.]. .Iadd.system .Iaddend.of claim 10, wherein the agent comprises at least one of the following: a microengine and a microengine thread.

17. The .[.method.]. .Iadd.system .Iaddend.of claim 10, wherein the threads comprise at least one thread that operates on a packet received via the at least one Ethernet MAC.

.Iadd.18. A method comprising: identifying a last programmable unit of a plurality of multiple multi-threaded programmable units within an integrated circuit to have a request granted; and based, at least in part, on the identifying of the last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted, selecting a different one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted..Iaddend.

.Iadd.19. The method of claim 18, wherein the plurality of multiple multi-threaded programmable units within the integrated circuit are associated with a sequence of the multiple multi-threaded programmable units within the integrated circuit; and wherein selecting the one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted comprises selecting a next one of the multiple multi-threaded programmable units within the integrated circuit in the sequence..Iaddend.

.Iadd.20. The method of claim 18, further comprising: selecting a memory access operation issued by the selected one of the multiple multi-threaded programmable units within the integrated circuit..Iaddend.

.Iadd.21. An integrated circuit, comprising: multiple multi-threaded programmable units in the integrated circuit; and logic, communicatively coupled to the multiple multi-threaded programmable units, to: identify a last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted; and based, at least in part, on the identified last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted, select a one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted..Iaddend.

.Iadd.22. The integrated circuit of claim 21, wherein the plurality of multiple multi-threaded programmable units within the integrated circuit are associated with a sequence of the multiple multi-threaded programmable units; and wherein the logic to select the one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted comprises logic to select a next one of the multiple multi-threaded programmable units in the sequence..Iaddend.

.Iadd.23. The integrated circuit of claim 21, wherein the logic comprises an arbiter coupled to the multiple multi-threaded programmable units and to a memory controller to a memory shared by the multiple multi-threaded programmable units..Iaddend.

.Iadd.24. The integrated circuit of claim 21, wherein the logic further comprises logic to: select a memory access operation issued by the selected one of the multiple multi-threaded programmable units within the integrated circuit..Iaddend.

.Iadd.25. A method for using a parallel, multi-threaded processor system comprising: processing threads with a plurality of microengines, at least one microengine capable of processing at least two independent threads; processing commands issued by the microengines using a plurality of system resource interface units that each include at least one commands queue; and storing an identity of a last agent that had a request granted to determine whether a particular microengine command request should be granted, wherein a pointer is included to store the identity..Iaddend.

.Iadd.26. The method of claim 25, wherein each microengine utilizes a FIFO commands register..Iaddend.

.Iadd.27. The method of claim 25, wherein the system resource units include at least one of a core controller, a SDRAM controller, a SRAM controller, a PCI bus interface and an FBUS interface..Iaddend.

.Iadd.28. The method of claim 27, wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface utilize three command queues..Iaddend.

.Iadd.29. The method of claim 27, wherein in at least one of the SDRAM controller and the SRAM controller utilize a high priority queue..Iaddend.

.Iadd.30. The method of claim 27, wherein the SRAM controller utilizes a read lock fail queue..Iaddend.

.Iadd.31. The method of claim 27, wherein the PCI bus interface utilizes a single command register..Iaddend.

.Iadd.32. The method of claim 25, wherein the agent comprises at least one of the following: a microengine and a microengine thread..Iaddend.

.Iadd.33. The method of claim 25, wherein the threads comprise at least one thread that operates on a packet..Iaddend.

.Iadd.34. A communications system comprising: at least one Ethernet medium access controller (MAC); a multithreaded processor, the processor including: a plurality of microengines for processing a plurality of hardware threads; at least one of an ASB translator, a PCI bus interface, a SDRAM controller, a SRAM controller, and an bus interface to the Ethernet MAC; and a pointer to store an identity of a last agent that had a request granted, the system configured to determine whether a particular command request should be granted..Iaddend.

.Iadd.35. The system of claim 34 further comprising a FIFO commands register for each microengine..Iaddend.

.Iadd.36. The system of claim 34 wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface includes three command queues..Iaddend.

.Iadd.37. The system of claim 34 wherein at least one of the SDRAM controller and the SRAM controller includes a high priority queue..Iaddend.

.Iadd.38. The system of claim 34 wherein the SRAM controller includes a read lock fail queue..Iaddend.

.Iadd.39. The system of claim 34 wherein the PCI bus interface includes a single command register..Iaddend.

.Iadd.40. The system of claim 34, wherein the agent comprises at least one of the following: a microengine and a microengine thread..Iaddend.

.Iadd.41. The system of claim 34, wherein the threads comprise at least one thread that operates on a packet received via the at least one Ethernet MAC..Iaddend.
Description



BACKGROUND OF THE INVENTION

This invention relates to a protocol for providing parallel, multi-threaded processors with high bandwidth access to shared resources.

Parallel processing is an efficient form of computer information processing of concurrent events. Certain problems may be solved by applying parallel computer processing, which demands concurrent execution of many programs to do more than one thing at the same time. Unlike a serial paradigm where all tasks are performed sequentially at a single station, or a pipelined machine where tasks are performed at specialized stations, parallel processing requires that a plurality of stations have the capability to perform all tasks. In general, all or a plurality of the stations work simultaneously and independently on the same or common elements of a problem.

Types of computer processing include single instruction stream, single data stream, which is the conventional serial von Neumann computer that includes a single stream of instructions. A second processing type is the single instruction stream, multiple data streams process (SIMD). This processing scheme may include multiple arithmetic-logic processors and a single control processor. Each of the arithmetic-logic processors performs operations on the data in lock step and are synchronized by the control processor. A third type is multiple instruction streams, single data stream (MISD) processing which involves processing the same data stream flows through a linear array of processors executing different instruction streams. A fourth processing type is multiple instruction streams, multiple data streams (MIMD) processing which uses multiple processors, each executing its own instruction stream to process a data stream fed to each of the processors. MIMD processors may have several instruction processing units and therefore several data streams.

SUMMARY OF THE INVENTION

According to an aspect of the present invention, a parallel, hardware-based, multi-threaded processor includes a global command arbiter for determining the allocation of access to system resources. The multi-threaded processor system includes a plurality of microengines, a plurality of shared system resources and a global command arbiter. The global command arbiter uses a command request protocol based on the shared system resources and command type to grant or deny a microengine command request for a shared resource. The processor system may be advantageously realized on an integrated circuit chip with minimal wiring and buffer storage elements.

The technique according to the invention provides each microengine with fair access to the shared system resources based on command priority and resource utilization. Consequently, the microengines have high bandwidth access to the shared system resources.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a communication system employing a hardware-based multithreaded processor.

FIG. 2 is a simplified block diagram of a global arbitration system for a multithreaded process according to the invention.

FIGS. 3A and 3B illustrate a flow chart of an implementation of a global command arbitration process according to the invention.

DESCRIPTION

FIG. 1 illustrates a communication system 10 that includes a parallel, hardware-based multithreaded processor 12. The system 10 is especially useful for tasks that can be broken into parallel subtasks or functions, and the hardware-based multithreaded processor 12 is particularly useful for tasks that are bandwidth oriented rather than latency oriented.

The hardware-based multithreaded processor 12 may be an integrated circuit, and may be coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18. In the illustrated implementation, the hardware-based multi-threaded processor 12 has multiple microengines 22a to 22f that each includes multiple hardware-controlled threads that can be simultaneously active and that may independently work on a task. The multithreaded processor 12 also includes a central or core controller 20 that assists in loading microcode control for other resources and performs other general purpose computer-type functions such as handling protocols, handling exceptions, and providing extra support for packet processing, which may occur if the microengines pass the packets off for more detailed processing. In one embodiment, the core controller 20 is a Strong Arm.RTM. (Arm is a trademark of ARM Limited, United Kingdom) based architecture embedded general-purpose microprocessor, which includes an operating system. The operating system enables the core processor 20 to call functions to operate on the microengines 22a-22f. The core processor 20 can use any supported operating system but preferably utilizes a real time operating system. Suitable operating systems for a core processor implemented as a Strong Arm architecture microprocessor may include Microsoft NT real-time, VXWorks and .mu.CUS, which is a freeware operating system available over the Internet.

The plurality of functional microengines 22a-22f each maintain a plurality of program counters in hardware, and maintain states associated with the program counters. Each of the six microengines 22a-22f is capable of processing four independent hardware threads. Such processing allows one thread to start executing just after another thread issues a memory reference and then waits until that reference completes before doing more work. This behavior is critical to maintaining efficient hardware execution of the microegines because memory latency may be significant. Stated differently, if only a single thread execution was supported, the microengines would sit idle for a significant number of cycles waiting for references to return and thereby reduce overall computational throughput. Multi-threaded execution allows the microengines to mask memory latency by performing useful independent work across several threads. Effectively, a corresponding plurality of sets of threads can be simultaneously active on each of the microengines 22a-22f while only one is actually operating at any one time.

The six microengines 22a-22f operate with shared system resources including the memory system 16, the PCI bus 14 and the FBUS 18. The memory system 16 may be accessed via a Synchronous Dynamic Random Access Memory (SDRAM) controller 26a and a Static Random Access Memory (SRAM) controller 26b. SDRAM memory 16a and SDRAM controller 26a may be typically used for processing large volumes of data or high bandwidth data, such as processing network payloads from network packets. The SRAM controller 26b and SRAM memory 16b may be used in a networking implementation for low latency, fast access tasks or low bandwidth data, such as accessing look-up tables, memory for the core processor 20, and so forth.

The six microengines 22a-22f access either the SDRAM 16a or SRAM 16b based on characteristics of the data. Low latency, low bandwidth data is stored in and fetched from SRAM 16b, whereas higher bandwidth data for which latency is not as important is stored in and fetched from SDRAM 16a. The microengines 22a-22f can execute memory reference instructions to either the SDRAM controller 26a or SRAM controller 26b.

Advantages of hardware multithreading can be explained in the context of SRAM or SDRAM memory accesses. For example, an SRAM access requested by a Thread_0 from a microengine will cause the SRAM controller 26b to initiate an access to the SRAM memory 16b. The SRAM controller 26b controls arbitration for the SRAM bus 15, accesses the SRAM 16b, fetches the data from the SRAM 16b, and returns data to a requesting microengine 22a-22b. During a SRAM access, if the microengine 22a had only a single thread that could operate, that microengine would be dormant until data was returned from the SRAM. By employing hardware context swapping within each of the microengines 22a-22f, another thread such as Thread_1 can function while the first thread, Thread_0, is awaiting the read data to return. Hardware context swapping enables other contexts with unique program counters to execute in that same microengine. Continuing the example, during execution Thread_1 may access the SDRAM memory 16a. While Thread_1 operates on the SDRAM unit, and Thread_0 is operating on the SRAM unit, a new thread such as Thread_2 can now operate in the microengine 22a. Thread_2 can operate for a certain amount of time until it needs to access memory or perform some other long latency operation, such as making an access to a bus interface. Therefore, the processor 12 can simultaneously perform a bus operation, SRAM operation and SDRAM operation with all being completed or operated upon by one microengine 22a, which microengine 22a has one more thread available to process more work in the data path.

The hardware context swapping also synchronizes completion of tasks. For example, it is possible that two threads could hit the same-shared resource such as the SRAM 16b. Each one of the separate functional units, such as the interface 28, the SRAM controller 26a, and the SDRAM controller 26b, reports back a flag signaling completion of an operation when a requested task from one of the microengine thread contexts is completed. When the flag is received by the microengine, the microengine can determine which thread to turn on.

The processor 12 includes a bus interface 28 that couples the processor to a second bus 18. In an implementation, an FBUS interface 28 couples the processor 12 to the so-called FBUS 18 (FIFO bus). The FBUS is a 64-bit wide FIFO bus, used to interface to Media Access Controller (MAC) devices. The FBUS interface 28 is responsible for controlling and interfacing the processor 12 to the FBUS 18.

The processor 12 also includes a PCI bus interface 24 that couples other system components that reside on the PCI bus 14 to the processor 12. The PCI bus interface 24 also provides a high-speed data path 24a to the SDRAM memory 16a. The data path 24a permits data to be moved quickly from the SDRAM 16a to the PCI bus 14, via direct memory access (DMA) transfers. The hardware based multithreaded processor 12 can employ a plurality of DMA channels so if one target of a DMA transfer is busy, another one of the DMA channels can take over the PCI bus 14 to deliver information to another target to maintain high processor 12 efficiency. The PCI bus interface 24 supports image transfers, target operations and master operations. Target operations are operations where slave devices on bus 14 access the SDRAM through reads and writes that are serviced as a slave to target operation. In master operations, the processor core 20 sends data directly to or receives data directly from the PCI interface 24.

Each of the functional units of the processor 12 are coupled to one or more internal buses. In an implementation, the internal buses are dual 32-bit buses (i.e., one bus for read and one for write). The multithreaded processor 12 also is constructed such that the sum of the bandwidths of the internal buses exceeds the bandwidth of external buses coupled to the processor 12. The internal core processor bus 32 may be an Advanced System Bus (ASB bus) that couples the processor core 20 to the memory controllers 26a and 26b and to an ASB translator 30. The ASB bus is a subset of an "AMBA" bus that is used with the Strong Arm processor core. The processor 12 also includes a private bus 34 that couples the microengine units to SRAM controller 26b, ASB translator 30 and FBUS interface 28. A memory bus 38 couples the SDRAM controller 26a, the PCI bus interface 24, the FBUS interface 28 and memory system 16 together, including Flash ROM 16c which is used for boot operations and the like.

The hardware-based multithreaded processor 12 may be utilized as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a media access controller (MAC) device such as a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device 13b. In general, the hardware-based multi-threaded processor 12 can interface to any type of communication device or interface that receives/sends large amount of data. The communication system 10 functioning in a networking application could receive a plurality of network packets from the devices 13a, 13b and process each of those packets independently in a parallel manner.

The processor 12 may also be utilized as a print engine for a postscript processor, as a processor for a storage subsystem such as RAID disk storage, or as a matching engine. In the securities industry for example, the advent of electronic trading requires the use of electronic matching engines to match orders between buyers and sellers. These and other parallel types of tasks can be accomplished on the system 10.

FIG. 2 shows a global arbitration system 40 for use with the multithreaded processor 12 of FIG. 1. A global command arbiter 42 is connected to each of the microengines 22a-22f, to the SDRAM controller 26a, to the SRAM controller 26b, to the interface 28 and to the PCI interface 24. The global command arbiter 42 functions to provide high bandwidth access to the shared system resources utilizing a minimal amount of buffer storage elements and minimal wiring. The global command arbiter provides each microengine 22a-22f with fair access to the common system resources of the SDRAM, SRAM, PCI interface registers and FBUS interface registers based on command priority and resource utilization, which is explained below.

In an implementation, each microengine 22a-22f has a two-command deep first-in, first-out (FIFO) register for issuing command requests for SDRAM 16a and SRAM 16b memory access, and for issuing command requests for access to registers in the PCI interface 24 and FBUS interface 28. The SDRAM controller 26a queues commands from the microengines in one of four FIFO command queue structures: an eight-entry high-priority queue 44, a sixteen-entry odd bank queue 46, a sixteen-entry even bank queue 48, and a twenty-four entry maintain order queue 50. A single physical random access memory (RAM) structure with four input pointers and four output pointers may be used to implement the SDRAM queues 44, 46, 48, 50. A reference request from a microengine may include a bit set called the "optimized MEM bit" which will be sorted into either the odd bank queue 46 or the even bank queue 48. If the memory reference request does not have a memory optimization bit set, the default will be to go into the order queue 50. The order queue 50 maintains the order of reference requests from the microengines 22a-22f. With a series of odd and even banks references it may be required that a signal is returned to both the odd and even banks. If the microengine 22f sorts the memory references into odd bank and even bank references and one of the banks, for example the even bank, is drained of memory references before the odd bank but the signal is asserted on the last even reference, the SDRAM controller 26a could conceivably signal back to a microengine that the memory request had completed, even though the odd bank reference had not been serviced. This occurrence could cause a coherency problem. The situation is avoided by providing the order queue 50 which permits a microengine to have multiple memory references outstanding, of which only its last memory reference needs to signal a completion.

The SDRAM controller 26a also included a high priority queue 44. If an incoming memory reference from one of the microengines goes directly to the high priority queue then it is operated upon at a higher priority than other memory references in the other queues.

A feature of the SDRAM controller 26a is that when a memory reference is stored in the queues, in addition to the optimized MEM bit that may be set, a "chaining bit" may be set to require special handling of contiguous memory references. A microengine context may issue chained memory references when the second and/or third reference of the chain must be scheduled by the SDRAM controller 26a immediately after the initial chained memory request. The global command arbiter 42 must ensure that chained references are delivered to consecutive locations of the same SDRAM controller queue.

The SRAM controller 26b also has four command queues: an eight-entry high priority queue 62, a sixteen-entry read queue 64, a sixteen-entry write order queue 66 and a twenty-four entry read-lock fail queue 68. A single physical RAM structure may be used to implement the four queues. The SRAM controller 26b is optimized based on the type of memory operation; i.e., a read or a write operation, and the predominant function that the SRAM performs is read operations.

The read lock fail queue 68 is used to hold read memory reference requests that fail because of a lock existing on a portion of memory. That is, one of the microengines issues a memory request that has a read lock request that is processed in an address and control queue. The memory request will operate on either the write order queue 66 or the read queue 64 and will recognize it as a read lock request. The SRAM controller 26b will access a lock lookup device to determine whether this memory location is already locked. If this memory location is locked from any prior read lock request, then this memory lock request will fail and will be stored in the read lock fail queue 68. If it is unlocked or if the lock lookup device shows no lock on that address, then the address of that memory reference will be used by the SRAM interface 26b to perform a traditional SRAM address read/write request to SRAM memory 16b. A command controller and address generator will also enter the lock into the lock look up device so that subsequent read lock requests will find the memory location locked. A memory location is unlocked by clearing a valid bit in a content addressable memory (CAM) of the SRAM controller. After an unlock, the read lock fail queue 68 becomes the highest priority queue giving all queued read lock misses a chance to issue a memory lock request. The read-lock miss queue is loaded by the SRAM controller itself and not directly from a microengine output buffer. The global arbiter 42 ensures that a command from a microengine to a SRAM queue is not selected on the same cycle that the SRAM controller must write a read-lock miss entry.

The FBUS interface 28 includes three command queues: an eight-entry push queue 72, an eight-entry pull queue 74 and an eight-entry hash queue 76. The pull queue is used when data is moved from a microengine to an FBUS interface resource, the push queue is used for reading data from the FBUS interface to a microengine, and the hash queue is used for sending from one to three hash arguments to a polynomial hash unit within the FBUS interface and for getting the hash result returned. The FBUS interface 28 in a network application can perform header processing of incoming packets from the FBUS 18. A key function performed by the FBUS interface 28 is extraction of packet headers, and a hashed lookup of microprogrammable source/destination/protocol in SRAM memory 16b. If the hash does not successfully resolve, then the packet header is subjected to more sophisticated processing.

The PCI bus interface 24 includes a single, two-entry direct memory access (DMA) command register 78. The DMA register provides a completion signal to the initiating microengine thread.

The global command arbiter 42 operates to select commands from the two-deep output command queues of each microengine for transmission to a destination queue in one of the functional units. The functional units include the core controller 20, the PCI interface 24, the SDRAM controller 26a, the SRAM controller 26b, the FBUS interface 28 and the microengines 22a to 22f. Each microengine request to the global command arbiter 42 is a three-bit encoded field that specifies the command type and destination. Each microengine global command arbiter request is serviced with the following priority:

TABLE-US-00001 1. SDRAM chained commands 2. SRAM 3. SDRAM 4. FBUS 5. PCI bus

The global arbiter maintains a pointer that indicates the last microengine request granted. If more than one request is present at the same priority, the global command arbiter selects the next higher numbered microengine (with a wrap-around feature). For example, the microengines 22a to 22f may be numbered from 1 to 6 in an implementation so that if a request from microengine 6 was the last one granted, then when priority is not an issue a request from microengine 1 is next up for consideration.

The three SRAM controller command queues 62, 64 and 66 are loaded directly from microengine commands. Since an SRAM command could be granted every cycle, it is possible that up to 6 additional SRAM commands will be granted and are in the pipeline, all of which could be destined for the same SRAM queue before a signal indicating that the queue is full is received by the global command arbiter. Thus, the SRAM controller asserts an SRAM_queue_full signal to the global command arbiter 42 if there is less than seven (7) empty entries in any SRAM command queue loaded from the microengines. For example, if the high priority queue has two entries filled then the SRAM_queue_full signal is asserted (because eight entries minus two entries is six). Similarly, if the read queue or the order queue contains ten entries then the SRAM_queue_full signal is asserted. This protocol is followed because a six cycle minimum latency exists from the assertion of a command request from a microengine and the command actually being stored in a destination queue.

The following diagram illustrates the timing of a request for a command destined for a queue in a system resource:

TABLE-US-00002 1 2 3 4 5 6 7 8 9 Req arb gat bus cmd rcv full arb NOGNT req arb gnt bus cmd rcv full arb req arb gnt bus cmd rcv full req arb gat bus cmd rcv req arb gnt bus cmd req arb gnt bus req arb NOGNT

Where: req=bus request from the microengine; arb=arbitrate requests; gnt=drive grant to appropriate microengine; bus=enable tri-state bus driver; cmd=drive command onto fx_cmd_bus; rcv=receiving box queues command; full=full_status_que signal driven if necessary; nognt=a grant is not sent to queues that sent "full" by cycle 7.

Referring to the above timing diagram, in the first cycle, a request is sent to the global command arbiter. In cycle two, arbitration is performed and in cycle three the request is granted to the requesting microengine. In cycle four, a bus is enabled and in cycle five the command is driven onto the bus. In cycle six the receiving unit (SDRAM controller, SRAM controller, PCI bus interface or FBUS interface) queues the command. In cycle seven a full_status_que command is driven if necessary (e.g. that queue contains less than a minimum number of available entry spaces). In cycle eight, the global command arbiter is deciding whether another request should be granted to that system resource, but sees that the full_status_queue signal was generated. The arbiter then acts to deny requests (nognt) to the queue which sent a full signal by the seventh cycle.

The FBUS interface 28 has 3 command queues (pull, hash, push) which all contain eight (8) entries. Commands to the FBUS interface are not granted in consecutive cycles. Thus, when any of the 3 FBUS interface queues reaches four (4) entries (instead of the two discussed above for an eight entry queue) a FBUS_queue_full signal is sent to the global command arbiter since only a maximum of 3 commands can be in transit to the FBUS interface queues prior to the global arbiter detecting FBUS_queue_full.

The SDRAM controller 26a has 4 command queues (high=8, even=16, odd=16, order=24). The threshold for asserting SDRAM_queue_full is the same as for the SRAM, i.e. less than 7 entries available in any queue. However, commands to the SDRAM controller are not granted on consecutive cycles. This insures queue entry space for any SDRAM chained commands from a particular microengine, which must be granted, even after SDRAM_queue_full asserts. It is necessary to always transfer SDRAM chained commands to avoid a live-lock condition, in which the SDRAM controller is waiting for the chained command in one queue while the command is "stuck" in a microengine because the global arbiter is no longer granting SDRAM commands since a different SDRAM queue is "full". A limit is placed on the chain length of SDRAM commands to three as a coding restriction. In addition, when a chained SDRAM command is granted to a microengine, the next SDRAM command to be granted must also come from the same microengine so that the paired commands arrive in the selected SDRAM queue contiguously.

The restrictions of not sending commands to the FBUS on consecutive cycles, and not sending commands to the SDRAM on consecutive cycles do not degrade system performance since each command requires many cycles to actually execute. The restriction is not placed on SRAM commands since the SRAM queue sizing is more than adequate, and more SRAM references requiring fewer cycles with lower latency are issued in most applications.

FIGS. 3A and 3B illustrate an implementation of a global command arbiter protocol process 100. The global command arbiter reviews 102 the command requests in the FIFO registers of the microengines 22a-22f. If all of the requests have the same priority 104, a pointer is checked 106 to determine the identity of the last microengine that had a request granted, and then the request of the next higher microengine is considered. Before granting the command request, the arbiter checks 108 to see if a queue_full_signal has been asserted. If so, the command request is denied 110 and the pointer is incremented 111 so that the next microengine's request will be considered. However, if no queue_full_signal has been asserted, then the command request is granted 112 and the flow returns to 102.

Referring again to step 104 of FIG. 3A, if the command requests in the microengines 22a to 22f have different priorities, then the global command arbiter checks 114 to see if a SDRAM request with a chained bit set has been granted previously. If so, then the SDRAM request from the same microengine that sent the previous SDRAM request with a chained bit is granted 116. Next, the SDRAM queues are checked 118 to determine if any contain less than "N" empty entries, where N is equal to the number of microengines plus one. In the implementation described above, the SDRAM_queue_full signal will be asserted 120 if any SDRAM queue contains less than seven (7) empty entries and then the flow returns to 102. If checking the queues 118 determines that the SDRAM queues have space for seven or more entries, then the flow returns to 102.

If there was no history of an SDRAM command request with a chained bit set 114, the global command arbiter determines 122 if there is a SRAM command request. If there is a SRAM request, the SRAM queues are checked 124 to see if any SRAM queue contains less than N empty entries. If so, then a SRAM_queue_full signal is asserted 126, the command request is denied and the flow moves to 134 where the arbiter determines if a SDRAM request has been made. However, if the answer 124 is no, then the arbiter checks 128 to see if the SRAM controller 26b needs to write a read_lock_miss entry. If so, then the command request is denied in step 130 and the flow moves to 134; if not, then the command request is granted 132 and the flow returns to 102.

If the answer was no at 122, then the arbiter checks 134 (see FIG. 3B) to see if a SDRAM request is being made. If so, the arbiter determines 136 if the last granted request was also a SDRAM command request. If it was, then the request is denied 138 and the flow goes to 146 where the arbiter determines if an FBUS command request has been made. Commands are not granted to the SDRAM controller in consecutive cycles to ensure that there is adequate queue entry space for a SDRAM chained command which is always granted when it occurs (even after a SDRAM_queue_full signal has been asserted). If the last granted command request was not an SDRAM command the SDRAM queues are checked 140 to see if any contains less than N entries. If so, then an SDRAM_queue_full signal is asserted 142, access is denied 138 and the flow moves to 146. If the SDRAM queues have adequate entry space, then the command request is granted 144 and the flow returns to 102.

If a SDRAM request is not being made 134, then the arbiter checks 146 to see if an FBUS command request has been made. If so, the arbiter checks 148 to see if the last granted request was a FBUS request. If so, then the request is denied 150 and the flow moves to 160 where the arbiter determines if a PCI command request has been made. Command requests to the FBUS are not granted in consecutive cycles to improve processing efficiency of the system. If the last granted request was not an FBUS command request 148, then the FBUS queues are checked 152 to see if any contain less than "F" empty entries. For the example discussed above where there are six microengines and each of the FBUS command queues (pull, hash, push) contains eight entries, F equals five (5) since only a maximum of three (3) commands can be in transit to the FBI queues. Thus, if four or fewer entries are available in any FBUS queue, then the FBUS_queue_full signal is asserted 154, the command is denied 150 and the flow moves to 160. However, if the FBUS queues have adequate space, the request is granted 156 and the flow returns to 102.

If an FBUS request is not made 146, a PCI command request has been asserted 160. Direct memory access is granted and a completion signal is sent, then the flow returns to 102.

It is to be understood that while implementations of the invention have been described, the foregoing description is intended to illustrate and not limit the invention, which is defined by the scope of the appended claims. For example, the flow chart depicted in FIGS. 3A and 3B could be modified to accommodate more, less or different system resources. Other aspects, advantages, and modifications are within the scope of the following claims.

* * * * *

References


uspto.report is an independent third-party trademark research tool that is not affiliated, endorsed, or sponsored by the United States Patent and Trademark Office (USPTO) or any other governmental organization. The information provided by uspto.report is based on publicly available data at the time of writing and is intended for informational purposes only.

While we strive to provide accurate and up-to-date information, we do not guarantee the accuracy, completeness, reliability, or suitability of the information displayed on this site. The use of this site is at your own risk. Any reliance you place on such information is therefore strictly at your own risk.

All official trademark data, including owner information, should be verified by visiting the official USPTO website at www.uspto.gov. This site is not intended to replace professional legal advice and should not be used as a substitute for consulting with a legal professional who is knowledgeable about trademark law.

© 2024 USPTO.report | Privacy Policy | Resources | RSS Feed of Trademarks | Trademark Filings Twitter Feed