1. Field of the Invention
The field of the invention is data processing, or, more specifically apparatus and methods for data processing with a network on chip (‘NOC’).
2. Description of Related Art
There are two widely used paradigms of data processing; multiple instructions, multiple data (‘MIMD’) and single instruction, multiple data (‘SIMD’). In MIMD processing, a computer program is typically characterized as one or more threads of execution operating more or less independently, each requiring fast random access to large quantities of shared memory. MIMD is a data processing paradigm optimized for the particular classes of programs that fit it, including, for example, word processors, spreadsheets, database managers, many forms of telecommunications such as browsers, for example, and so on.
SIMD is characterized by a single program running simultaneously in parallel on many processors, each instance of the program operating in the same way but on separate items of data. SIMD is a data processing paradigm that is optimized for the particular classes of applications that fit it, including, for example, many forms of digital signal processing, vector processing, and so on.
There is another class of applications, however, including many real-world simulation programs, for example, for which neither pure SIMD nor pure MIMD data processing is optimized. That class of applications includes applications that benefit from parallel processing and also require fast random access to shared memory. For that class of programs, a pure MIMD system will not provide a high degree of parallelism and a pure SIMD system will not provide fast random access to main memory stores.
A methods and apparatus for data processing on a network on chip (‘NOC’) that includes integrated processor (‘IP’) blocks, routers, memory communications controllers, and network interface controllers; each IP block adapted to a router through a memory communications controller and a network interface controller; each memory communications controller controlling communications between an IP block and memory; each network interface controller controlling inter-IP block communications through routers; and at least one IP block also including a computer processor and an L1, write-through data cache comprising high speed local memory on the IP block, the cache controlled by a cache controller having a cache line replacement policy, the cache controller configured to lock segments of the cache, the computer processor configured to store thread-private data in main memory off the IP block, the computer processor further configured to store thread-private data on a segment of the L1 data cache, the segment locked against replacement upon cache misses under the cache controller's replacement policy, the segment further locked against write-through to main memory.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.
Exemplary apparatus and methods for data processing with a NOC in accordance with the present invention are described with reference to the accompanying drawings, beginning with
Stored in RAM (168) is an application program (184), a module of user-level computer program instructions for carrying out particular data processing tasks such as, for example, word processing, spreadsheets, database operations, video gaming, stock market simulations, atomic quantum process simulations, or other user-level applications. Also stored in RAM (168) is an operating system (154). Operating systems useful data processing with a NOC according to embodiments of the present invention include UNIX™, Linux™, Microsoft XP™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art. The operating system (154) and the application (184) in the example of
The example computer (152) includes two example NOCs according to embodiments of the present invention: a video adapter (209) and a coprocessor (157). The video adapter (209) is an example of an I/O adapter specially designed for graphic output to a display device (180) such as a display screen or computer monitor. Video adapter (209) is connected to processor (156) through a high speed video bus (164), bus adapter (158), and the front side bus (162), which is also a high speed bus. The example NOC coprocessor (157) is connected to processor (156) through bus adapter (158), and front side buses (162 and 163), which is also a high speed bus. The NOC coprocessor of
The example NOC video adapter (209) and NOC coprocessor (157) of
The computer (152) of
The example computer (152) of
The exemplary computer (152) of
For further explanation,
In the NOC (102) of
One way to describe IP blocks by analogy is that IP blocks are for NOC design what a library is for computer programming or a discrete integrated circuit component is for printed circuit board design. In NOCs according to embodiments of the present invention, IP blocks may be implemented as generic gate netlists, as complete special purpose or general purpose microprocessors, or in other ways as may occur to those of skill in the art. A netlist is a Boolean-algebra representation (gates, standard cells) of an IP block's logical-function, analogous to an assembly-code listing for a high-level program application. NOCs also may be implemented, for example, in synthesizable form, described in a hardware description language such as Verilog or VHDL. In addition to netlist and synthesizable implementation, NOCs also may be delivered in lower-level, physical descriptions. Analog IP block elements such as SERDES, PLL, DAC, ADC, and so on, may be distributed in a transistor-layout format such as GDSII. Digital elements of IP blocks are sometimes offered in layout format as well.
Each IP block (104) in the example of
Each IP block (104) in the example of
Each IP block (104) in the example of
Each memory communications controller (106) in the example of
The example NOC includes two memory management units (‘MMUs’) (107, 109), illustrating two alternative memory architectures for NOCs according to embodiments of the present invention. MMU (107) is implemented with an IP block, allowing a processor within the IP block to operate in virtual memory while allowing the entire remaining architecture of the NOC to operate in a physical memory address space. The MMU (109) is implemented off-chip, connected to the NOC through a data communications port (116). The port (116) includes the pins and other interconnections required to conduct signals between the NOC and the MMU, as well as sufficient intelligence to convert message packets from the NOC packet format to the bus format required by the external MMU (109). The external location of the MMU means that all processors in all IP blocks of the NOC can operate in virtual memory address space, with all conversions to physical addresses of the off-chip memory handled by the off-chip MMU (109).
In addition to the two memory architectures illustrated by use of the MMUs (107, 109), data communications port (118) illustrates a third memory architecture useful in NOCs according to embodiments of the present invention. Port (118) provides a direct connection between an IP block (104) of the NOC (102) and off-chip memory (112). With no MMU in the processing path, this architecture provides utilization of a physical address space by all the IP blocks of the NOC. In sharing the address space bi-directionally, all the IP blocks of the NOC can access memory in the address space by memory-addressed messages, including loads and stores, directed through the IP block connected directly to the port (118). The port (118) includes the pins and other interconnections required to conduct signals between the NOC and the off-chip memory (112), as well as sufficient intelligence to convert message packets from the NOC packet format to the bus format required by the off-chip memory (112).
In the example of
For further explanation,
In the example of
The computer processor (126) of
In addition to storing thread-private data in main memory (128) off the IP block (104), the computer processor (126) in the example of
In a typical write-through cache in prior art every write to the cache causes a write to main memory. In the example of
Some computer architectures define one or more caches designated for storage of specific types of data. The processor and cache in the example of
Storing, by the processor (126), thread-private data on a segment (528) of the L1 data cache may include storing the thread-private data on at least one way of an N-way set-associative L1 data cache, where the value of N is at least two. That is, the L1 data cache may be fully associative, direct mapped, or set associative according to embodiments of the present invention. The L1 data cache (111) in the example of
The cache (111) in the example of
A least recently used type (‘LRU-type’) replacement policy is an algorithm that identifies the first information in a cache to evict as the least recently used information. This type of algorithm tracks when cache lines are accessed. Some implementations of LRU-type replacement policies track when cache lines are accessed by maintaining ‘age bits,’ depicted in the cache directory (514) of
In the example of
In the example of
In the NOC (102) of
The example NOC (102) of
When virtual address translation is required, in contrast to processing a load of a real memory address, the cache controller may lock a cache line upon a first load of the cache line from a page of memory containing thread-private data by determining from the page lock field (510) in the page table (504) that the cache line in the page table is locked and set a cache line lock attribute (520) for the cache line in the cache directory (514) to represent that the cache line is locked, such as for example, setting a cache line lock bit high.
In the NOC of
Between locking a segment of cache and releasing such a lock, many modifications may be made to the cache line in the segment of cache, not one of which will be reflected in main memory as write-through to main memory for that cache line is locked. In some embodiments of the present invention the cache controller may track whether a locked cache line is ‘dirty’ such that, immediately upon release of the lock on the cache line, the cache line in main memory may be updated to reflect the current state of the cache line in the previously locked segment of cache. Tracking whether a cache line is ‘dirty’ may be carried out by determining, from the cache line lock attribute (520) for the cache line, whether the cache line is locked and if the cache line is locked, setting a dirty bit for the cache line in the cache directory high upon a modification of the cache line.
In the NOC (102) of
Each memory communications execution engine (140) is enabled to execute a complete memory communications instruction separately and in parallel with other memory communications execution engines. The memory communications execution engines implement a scalable memory transaction processor optimized for concurrent throughput of memory communications instructions. The memory communications controller (106) supports multiple memory communications execution engines (140) all of which run concurrently for simultaneous execution of multiple memory communications instructions. A new memory communications instruction is allocated by the memory communications controller (106) to a memory communications engine (140) and the memory communications execution engines (140) can accept multiple response events simultaneously. In this example, all of the memory communications execution engines (140) are identical. Scaling the number of memory communications instructions that can be handled simultaneously by a memory communications controller (106), therefore, is implemented by scaling the number of memory communications execution engines (140).
In the NOC (102) of
In the NOC (102) of
Many memory-address-based communications are executed with message traffic, because any memory to be accessed may be located anywhere in the physical memory address space, on-chip or off-chip, directly attached to any memory communications controller in the NOC, or ultimately accessed through any IP block of the NOC—regardless of which IP block originated any particular memory-address-based communication. All memory-address-based communication that are executed with message traffic are passed from the memory communications controller to an associated network interface controller for conversion (136) from command format to packet format and transmission through the network in a message. In converting to packet format, the network interface controller also identifies a network address for the packet in dependence upon the memory address or addresses to be accessed by a memory-address-based communication. Memory address based messages are addressed with memory addresses. Each memory address is mapped by the network interface controllers to a network address, typically the network location of a memory communications controller responsible for some range of physical memory addresses. The network location of a memory communication controller (106) is naturally also the network location of that memory communication controller's associated router (110), network interface controller (108), and IP block (104). The instruction conversion logic (136) within each network interface controller is capable of converting memory addresses to network addresses for purposes of transmitting memory-address-based communications through routers of a NOC.
Upon receiving message traffic from routers (110) of the network, each network interface controller (108) inspects each packet for memory instructions. Each packet containing a memory instruction is handed to the memory communications controller (106) associated with the receiving network interface controller, which executes the memory instruction before sending the remaining payload of the packet to the IP block for further processing. In this way, memory contents are always prepared to support data processing by an IP block before the IP block begins execution of instructions from a message that depend upon particular memory content.
In the NOC (102) of
Each network interface controller (108) in the example of
Each router (110) in the example of
In describing memory-address-based communications above, each memory address was described as mapped by network interface controllers to a network address, a network location of a memory communications controller. The network location of a memory communication controller (106) is naturally also the network location of that memory communication controller's associated router (110), network interface controller (108), and IP block (104). In inter-IP block, or network-address-based communications, therefore, it is also typical for application-level data processing to view network addresses as location of IP block within the network formed by the routers, links, and bus wires of the NOC.
In the NOC (102) of
Each virtual channel buffer (134) has finite storage space. When many packets are received in a short period of time, a virtual channel buffer can fill up—so that no more packets can be put in the buffer. In other protocols, packets arriving on a virtual channel whose buffer is full would be dropped. Each virtual channel buffer (134) in this example, however, is enabled with control signals of the bus wires to advise surrounding routers through the virtual channel control logic to suspend transmission in a virtual channel, that is, suspend transmission of packets of a particular communications type. When one virtual channel is so suspended, all other virtual channels are unaffected—and can continue to operate at full capacity. The control signals are wired all the way back through each router to each router's associated network interface controller (108). Each network interface controller is configured to, upon receipt of such a signal, refuse to accept, from its associated memory communications controller (106) or from its associated IP block (104), communications instructions for the suspended virtual channel. In this way, suspension of a virtual channel affects all the hardware that implements the virtual channel, all the way back up to the originating IP blocks.
One effect of suspending packet transmissions in a virtual channel is that no packets are ever dropped in the architecture of
For further explanation,
The method of
The method of
The method of
The method of
In the method of
The method of
The method of
Exemplary embodiments of the present invention are described largely in the context of a fully functional computer system for data processing with a NOC. Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed on signal bearing media for use with any suitable data processing system. Such signal bearing media may be transmission media or recordable media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of recordable media include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Examples of transmission media include telephone networks for voice communications and digital data communications networks such as, for example, Ethernets™ and networks that communicate with the Internet Protocol and the World Wide Web as well as wireless transmission media such as, for example, networks implemented according to the IEEE 802.11 family of specifications. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a program product. Persons skilled in the art will recognize immediately that, although some of the exemplary embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware or as hardware are well within the scope of the present invention.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4813037 | Debuysscher et al. | Mar 1989 | A |
4951195 | Fogg et al. | Aug 1990 | A |
5167023 | De Nicolas et al. | Nov 1992 | A |
5301302 | Blackard et al. | Apr 1994 | A |
5442797 | Casavant et al. | Aug 1995 | A |
5590308 | Shih | Dec 1996 | A |
5761516 | Rostoker et al. | Jun 1998 | A |
5784706 | Oberlin et al. | Jul 1998 | A |
5870479 | Feiken et al. | Feb 1999 | A |
5872963 | Bitar et al. | Feb 1999 | A |
5884060 | Vegesna et al. | Mar 1999 | A |
5887166 | Mallick et al. | Mar 1999 | A |
5974498 | Hopkins | Oct 1999 | A |
6021470 | Frank et al. | Feb 2000 | A |
6044478 | Green | Mar 2000 | A |
6047122 | Spiller | Apr 2000 | A |
6049866 | Earl | Apr 2000 | A |
6085296 | Karkhanis et al. | Jul 2000 | A |
6085315 | Fleck et al. | Jul 2000 | A |
6092159 | Ekner et al. | Jul 2000 | A |
6101599 | Wright et al. | Aug 2000 | A |
6105119 | Kerr et al. | Aug 2000 | A |
6119215 | Key et al. | Sep 2000 | A |
6145072 | Shams et al. | Nov 2000 | A |
6151668 | Pechanek et al. | Nov 2000 | A |
6164841 | Mattson et al. | Dec 2000 | A |
6272598 | Arlitt et al. | Aug 2001 | B1 |
6292888 | Nemirovsky et al. | Sep 2001 | B1 |
6370622 | Chiou et al. | Apr 2002 | B1 |
6385695 | Arimilli et al. | May 2002 | B1 |
6434669 | Arimilli et al. | Aug 2002 | B1 |
6446171 | Henriksen | Sep 2002 | B1 |
6493817 | Renstrom | Dec 2002 | B1 |
6519605 | Gilgen et al. | Feb 2003 | B1 |
6567895 | Scales | May 2003 | B2 |
6591347 | Tischler et al. | Jul 2003 | B2 |
6625662 | Satoh et al. | Sep 2003 | B1 |
6668307 | Damron | Dec 2003 | B1 |
6668308 | Barroso et al. | Dec 2003 | B2 |
6675284 | Warren | Jan 2004 | B1 |
6697932 | Yoaz et al. | Feb 2004 | B1 |
6725317 | Bouchier et al. | Apr 2004 | B1 |
6823429 | Olnowich | Nov 2004 | B1 |
6832184 | Bleier et al. | Dec 2004 | B1 |
6877086 | Boggs et al. | Apr 2005 | B1 |
6891828 | Ngai | May 2005 | B2 |
6898791 | Chandy et al. | May 2005 | B1 |
6915402 | Wilson et al. | Jul 2005 | B2 |
6938253 | Kim | Aug 2005 | B2 |
6950438 | Owen et al. | Sep 2005 | B1 |
6973032 | Casley et al. | Dec 2005 | B1 |
6988149 | Odenwald | Jan 2006 | B2 |
7010580 | Fu et al. | Mar 2006 | B1 |
7015909 | Morgan, III et al. | Mar 2006 | B1 |
7072996 | Adusumilli et al. | Jul 2006 | B2 |
7162560 | Taylor et al. | Jan 2007 | B2 |
7376789 | Halleck et al. | May 2008 | B2 |
7394288 | Agarwal | Jul 2008 | B1 |
7398374 | DeLano | Jul 2008 | B2 |
7464197 | Ganapathy et al. | Dec 2008 | B2 |
7478225 | Brooks et al. | Jan 2009 | B1 |
7493474 | Pechanek et al. | Feb 2009 | B1 |
7500060 | Anderson et al. | Mar 2009 | B1 |
7502378 | Lajolo et al. | Mar 2009 | B2 |
7521961 | Anderson et al. | Apr 2009 | B1 |
7533154 | Chen et al. | May 2009 | B1 |
7539124 | Rhim et al. | May 2009 | B2 |
7546444 | Wolrich et al. | Jun 2009 | B1 |
7568064 | Reblewski et al. | Jul 2009 | B2 |
7590774 | Johns et al. | Sep 2009 | B2 |
7613882 | Akkawi et al. | Nov 2009 | B1 |
7664108 | Bahattab | Feb 2010 | B2 |
7689738 | Williams et al. | Mar 2010 | B1 |
7701252 | Chow et al. | Apr 2010 | B1 |
7861065 | Heil et al. | Dec 2010 | B2 |
7882307 | Wentzlaff et al. | Feb 2011 | B1 |
7886084 | Chen et al. | Feb 2011 | B2 |
7913010 | Hoover et al. | Mar 2011 | B2 |
7917703 | Comparan et al. | Mar 2011 | B2 |
7958340 | Hoover et al. | Jun 2011 | B2 |
7991978 | Kuesel et al. | Aug 2011 | B2 |
8010750 | Comparan et al. | Aug 2011 | B2 |
8018466 | Hoover et al. | Sep 2011 | B2 |
8020168 | Hoover et al. | Sep 2011 | B2 |
8040799 | Hoover et al. | Oct 2011 | B2 |
20020099833 | Steely et al. | Jul 2002 | A1 |
20020178337 | Wilson et al. | Nov 2002 | A1 |
20030065890 | Lyon | Apr 2003 | A1 |
20040037313 | Gulati et al. | Feb 2004 | A1 |
20040083341 | Robinson et al. | Apr 2004 | A1 |
20040088487 | Barroso et al. | May 2004 | A1 |
20040111422 | Devarakonda et al. | Jun 2004 | A1 |
20040151197 | Hui | Aug 2004 | A1 |
20040153579 | Shih et al. | Aug 2004 | A1 |
20040216105 | Burky et al. | Oct 2004 | A1 |
20040250046 | Gonzalez et al. | Dec 2004 | A1 |
20040260906 | Landin et al. | Dec 2004 | A1 |
20050044319 | Olukotun | Feb 2005 | A1 |
20050086435 | Todoroki | Apr 2005 | A1 |
20050097184 | Brown et al. | May 2005 | A1 |
20050149689 | Sodani et al. | Jul 2005 | A1 |
20050160209 | Van Doren et al. | Jul 2005 | A1 |
20050166205 | Oskin et al. | Jul 2005 | A1 |
20050198442 | Mandler | Sep 2005 | A1 |
20050203988 | Nolle et al. | Sep 2005 | A1 |
20050228952 | Mayhew et al. | Oct 2005 | A1 |
20050238035 | Riley | Oct 2005 | A1 |
20060095920 | Goossens | May 2006 | A1 |
20060101249 | Bacon et al. | May 2006 | A1 |
20060203825 | Beigne et al. | Sep 2006 | A1 |
20060209846 | Clermidy et al. | Sep 2006 | A1 |
20060242393 | Park et al. | Oct 2006 | A1 |
20070055826 | Morton et al. | Mar 2007 | A1 |
20070055961 | Callister et al. | Mar 2007 | A1 |
20070074191 | Geisinger | Mar 2007 | A1 |
20070076739 | Manjeshwar et al. | Apr 2007 | A1 |
20070180310 | Johnson et al. | Aug 2007 | A1 |
20070226407 | Radulescu et al. | Sep 2007 | A1 |
20070271557 | Geisinger | Nov 2007 | A1 |
20070283324 | Geisinger | Dec 2007 | A1 |
20080028401 | Geisinger | Jan 2008 | A1 |
20080133885 | Glew | Jun 2008 | A1 |
20080134191 | Warrier et al. | Jun 2008 | A1 |
20080181115 | Soulie et al. | Jul 2008 | A1 |
20080186998 | Rijpkema | Aug 2008 | A1 |
20080205432 | Gangwal | Aug 2008 | A1 |
20080216073 | Yates et al. | Sep 2008 | A1 |
20080307422 | Kurland et al. | Dec 2008 | A1 |
20080320235 | Beckmann et al. | Dec 2008 | A1 |
20090019190 | Blocksome | Jan 2009 | A1 |
20090083263 | Felch et al. | Mar 2009 | A1 |
20090122703 | Gangwal et al. | May 2009 | A1 |
20090125574 | Mejdrich et al. | May 2009 | A1 |
20090125703 | Mejdrich et al. | May 2009 | A1 |
20090125706 | Hoover et al. | May 2009 | A1 |
20090135739 | Hoover et al. | May 2009 | A1 |
20090213863 | Denteneer et al. | Aug 2009 | A1 |
20090231349 | Mejdrich et al. | Sep 2009 | A1 |
20090260013 | Heil et al. | Oct 2009 | A1 |
20090282222 | Hoover et al. | Nov 2009 | A1 |
Number | Date | Country |
---|---|---|
1599471 | Mar 2005 | CN |
Entry |
---|
Office Action Dated Jan. 29, 2010 in U.S. Appl. No. 11/945,396. |
Final Office Action Dated Jan. 15, 2010 in U.S. Appl. No. 12/031,733. |
Steve Furber, Future Trends in SOC Interconnect, Aug. 2000. |
Bolotin, et al., The Power of Priority:NoC based Distributed Cache Coherency, May 21, 2007, IEEE, pp. 117-126. |
Mereu, Gianni. “Conception, Analysis, Design and Realization of a Multi-socket Network-on-Chip Architecture and of the Binary Translation support for VLIW core targeted to Systems-on-Chip”, Mar. 2007, 145 pages, accessible at http://www.diee.unica.it/driei/tesi/19—mereu.pdf. |
Huneycutt et al. “Software Caching using Dynamic Binary Rewriting for Embedded Devices”, 2001, Proceedings of the International Conference on Parallel Processing, 10 pages. |
Cifuentes et al. “Walkabout—A Retargetable Dynamic Binary Translation Framework”, Sun Microsystems Laboratories, Jan. 2002, 13 pages. |
Issenin et al.; (Date Reuse Driven Memory and network-on-Chip Co-Synthesis); NSF; pp. 1-7. |
Kavaldijev et al. (“Providing QOS Guaranteed in a NOC by Virtual Channel Reservation”); 2006; pp. 1-12. |
Monchiero (“Exploration of Distributed Shared Memory Architecture of NOC-Based Microprocessors”, 2007) pp. 1-8. |
Al-Hashimi; (“System-on-Chip—Net Generation Electronics”, “Asynchronous on-chip networks”2006); Chapter 18 p. 1-32. |
Final Office Action, U.S. Appl. No. 11/926,212, Aug. 23, 2010. |
Final Office Action, U.S. Appl. No. 11/955,553, Sep. 13, 2010. |
Final Office Action, U.S. Appl. No. 12,031,733, Aug. 19, 2010. |
Notice of Allowance, U.S. Appl. No. 12/118,298, Aug. 18, 2010. |
Office Action, U.S. Appl. No. 11/972,753, Oct. 4, 2010. |
Office Action, U.S. Appl. No. 12/015,975, Jul. 22, 2010. |
Office Action, U.S. Appl. No. 11/937,579, Sep. 16, 2010. |
Office Action, U.S. Appl. No. 12/118,059, Sep. 1, 2010. |
Office Action, U.S. Appl. No. 12/121,168, Oct. 5, 2010. |
David Taylor, et al. “System on Chip Packet Processor for an Experimental Network Service Platform”. 2003. |
Office Action Dated Mar. 30, 2010 in U.S. Appl. No. 11/926,212. |
Final Office Action Dated May 19, 2010 in U.S. Appl. No. 11/945,396. |
Intel, E8870 Chipset, Intel, Jun. 2002, pp. 1-10. |
Office Action Dated Apr. 2, 2010 in U.S. Appl. No. 11/955,553. |
Kumar, et al. “A Network on Chip Architecture and Design Methodology”. Published 2002, pp. 1-8, ISBN 0-7695-1486-03/02 by IEEE. |
Bolotin, et al. “The Power of Priority: NoC based Distributed Cache Coherency”. Published May 21, 2007, pp. 117-126, ISBN 0-7695-2773-06/07 by IEEE. |
Office Action Dated Mar. 24, 2010 in U.S. Appl. No. 12/031,733. |
Virtanen, et al. “NoC Interface for a Protocol Processor”. University of Turku. |
Walter, et al., “BENoC: A Bus-Enhanced Network on-Chip”. Dec. 2007, Technion, Israel Institute of Technology, Haifa, Israel. |
Office Action Dated Jun. 8, 2010 in U.S. Appl. No. 12/118,298. |
Office Action Dated May 26, 2010 in U.S. Appl. No. 12/117,875. |
U.S. Appl. No. 12/117,897, filed May 9, 2008, Hoover, et al. |
U.S. Appl. No. 12/031,733, filed Feb. 15, 2008, Hoover, et al. |
U.S. Appl. No. 12/108,846, filed Apr. 24, 2008, Kuesel, et al. |
U.S. Appl. No. 12/108,770, filed Apr. 24, 2008, Mejdrich, et al. |
U.S. Appl. No. 12/029,647, filed Feb. 12, 2008, Hoover, et al. |
U.S. Appl. No. 12/118,017, filed May 9, 2008, Comparan, et al. |
U.S. Appl. No. 12/118,059, filed May 9, 2008, Mejdrich, et al. |
U.S. Appl. No. 12/117,875, filed May 9, 2008, Hoover, et al. |
U.S. Appl. No. 12/121,222, filed May 15, 2008, Kriegel, et al. |
U.S. Appl. No. 11/936,873, filed Nov. 8, 2007 Hoover, et al. |
U.S. Appl. No. 12/135,364, filed Jun. 9, 2008, Hoover, et al. |
U.S. Appl. No. 11/937,579, filed Nov. 9, 2007, Mejdrich, et al. |
U.S. Appl. No. 12/102,033, filed Apr. 14, 2008, Heil, et al. |
U.S. Appl. No. 12/118,272, filed May 9, 2008, Kuesel, et al. |
U.S. Appl. No. 12/118,039, filed May 9, 2008 Hoover, et al. |
U.S. Appl. No. 11/945,396, filed Nov. 27, 2007, Hoover, et al. |
U.S. Appl. No. 12/015,975, filed Jan. 17, 2008, Comparan, et al. |
U.S. Appl. No. 12/117,906, filed May 9, 2008, Hoover, et al. |
U.S. Appl. No. 12/233,180, filed Sep. 18, 2008, Hoover, et al. |
U.S. Appl. No. 12/113,286, filed May 1, 2008, Heil, et al. |
U.S. Appl. No. 11/955,553, filed Dec. 13, 2007, Comparan, et al. |
U.S. Appl. No. 12/031,738, filed Feb. 15, 2008, Hoover, et al. |
U.S. Appl. No. 11/972,753, filed Jan. 11, 2008, Mejdrich, et al. |
U.S. Appl. No. 12/060,559, filed Apr. 1, 2008, Comparan, et al. |
U.S. Appl. No. 11/926,212, filed Oct. 29, 2007, Hoover, et al. |
U.S. Appl. No. 12/118,298, filed May 9, 2008, Heil, et al. |
U.S. Appl. No. 12/118,315, filed May 9, 2008, Mejdrich, et al. |
U.S. Appl. No. 11/938,376, filed Nov. 12, 2007, Mejdrich, et al. |
U.S. Appl. No. 12/121,168, filed May 15, 2008, Hoover, et al. |
Office Action Dated Jul. 20, 2009 in U.S. Appl. No. 12/031,733. |
Kuskin, et al.; The Stanford Flash Multiprocessor; Jun. 6, 1996; Stanford University. |
Nikolay Kvaldjiev et al., A Virtual Channel Network-on-chip for GT and BE traffic, Apr. 2006, IEEE Emerging VLSI Technologies and Architectures. |
Office Action, U.S. Appl. No. 11/926,212, Dec. 7, 2010. |
Office Action, U.S. Appl. No. 11/945,396, Dec. 9, 2010. |
Notice of Allowance, U.S. Appl. No. 11/955,553, Nov. 22, 2010. |
Notice of Allowance, U.S. Appl. No. 12/031,733, Nov. 16, 2010. |
Office Action, U.S. Appl. No. 12/118,017, Dec. 8, 2010. |
Office Action, U.S. Appl. No. 12/118,272, Dec. 2, 2010. |
Office Action, U.S. Appl. No. 12/108,846, Dec. 2, 2010. |
Final Office Action, U.S. Appl. No. 12/117,875, Nov. 10, 2010. |
Office Action, U.S. Appl. No. 12/117,906, May 9, 2008. |
Office Action, U.S. Appl. No. 12/060,559, Nov. 3, 2010. |
Advisory Action, U.S. Appl. No. 11/926,212, Nov. 2, 2010. |
Master Dissertation, University of Electronic Science and Technology of China, pp. 0-35 and pp. 36-81 (includes English abstract). |
1994-2010 China Academic Journal Electronic Publishing House, pp. 0-30 and pp. 31-66 (includes English abstract). |
Final Office Action, U.S. Appl. No. 11/972,753, Feb. 18, 2011. |
Final Office Action, U.S. Appl. No. 12/015,975, Jan. 7, 2011. |
Final Office Action, U.S. Appl. No. 12/108,846, Feb. 17, 2011. |
Final Office Action, U.S. Appl. No. 12/113,286, Feb. 18, 2011. |
Final Office Action, U.S. Appl. No. 12,118,059, Feb. 17, 2011. |
Advisory Action U.S. Appl. No. 11/945,396, Mar. 21, 2012. |
RCE, U.S. Appl. No. 11/936,873, Mar. 16, 2012. |
Advisory Action, U.S. Appl. No. 12/118,315, Mar. 27, 2012. |
Office Action, U.S. Appl. No. 11/972,753, Jan. 19, 2012. |
Final Office Action, U.S. Appl. No. 12/135,364, Jan. 26, 2012. |
Final Office Action U.S. Appl. No. 11/937,579, Jan. 19, 2012. |
Notice of Allowance U.S. Appl. No. 12/233,180, Feb. 3, 2012. |
Notice of Allowance U.S. Appl. No. 12/121,222, Feb. 3, 2012. |
Notice of Allowance, U.S. Appl. No. 12/118,039, Feb. 23, 2012. |
Office Action, U.S. Appl. No. 12/113,286, Feb. 17, 2012. |
Nollet, V., et al., “Centralized Run-Time Resource Management in a Network-on-Chip Containing Reconfigurable Hardware Tiles” [online]. 2005 [retrieved Jul. 15, 2011], Retrieved from Internet: http://portal.acm.org/ft—gateway.cfm?id=1049106&type=pdf&CFID=32720390&CFTOKEN=986277114, pp. 1-6. |
Office Action, U.S. Appl. No. 11/936,873, Jul. 21, 2011. |
Office Action, U.S. Appl. No. 12,031,738, Jul. 11, 2011. |
Final Office Action, U.S. Appl. No. 12/060,559, Jul. 8, 2011. |
Hansson et al. “Avoiding Message-Dependent Deadlock in Network-Based Systems on Chip”, Jan. 6-10, 2007, vol. 2007, 10 pages. |
Notice of Allowance, U.S. Appl. No. 11/972,753, Sep. 28, 2012. |
Office Action, U.S. Appl. No. 12/031,738, Aug. 20, 2012. |
Office Action, U.S. Appl. No. 12/118,059, Aug. 14, 2012. |
Kumar et al.; “A Network on Chip Architecture and Design Methodology”;2002; IEEE. |
Final Office Action, U.S. Appl. No. 11/945,396, Sep. 1, 2011. |
Final Office Action, U.S. Appl. No. 11/972,753, Sep. 7, 2011. |
Office Action, U.S. Appl. No. 12/135,364, Aug. 5, 2011. |
Office Action, U.S. Appl. No. 12/102,033, Oct. 7, 2011. |
Office Action, U.S. Appl. No. 11/937,579, Aug. 15, 2011. |
Office Action, U.S. Appl. No. 12/233,180, Oct. 6, 2011. |
Office Action, U.S. Appl. No. 12/121,222, Sep. 20, 2011. |
Final Office Action, U.S. Appl. No. 12/108,770, Sep. 30, 2011. |
Final Office Action, U.S. Appl. No. 11/926,212, May 17, 2011. |
Nollet, et al., “Centralized Run-Time Resource Management in a Network-on-Chip Containing Reconfigurable Hardware Tiles” [online]. 2005 [retrieved Jul. 15, 2011], Retrieved from Internet: http://portal.acm.org/ft—gateway.cfm?id=1049106&type=pdf&CFID=32720390&CFTOKEN=986277114, pp. 1-6. |
Wikipedia, “Parallel Computing”, Wikipedia [online], URL: http://en.wikipedia.org/wiki/Parallel—computing, Jan. 19, 2007, pp. 1-6, USA. |
Pande et al., “Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures”, IEEE Transactions on Computers, vol. 54, No. 8, Aug. 2005, pp. 1025-1040, IEEE Computer Society, USA. |
Radulescu et al., “An Efficient On-Chip Network Interface Offering Guaranteed Services, Shared-Memory Abstraction, and Flexible Network Configuration”, from Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (Date'04), held in Paris, France Feb. 2004, pp. 878-883, vol. 2, IEEE Computer Society, USA. |
Samman et al., “Networks-On-Chip Based on Dynamic Wormhole Packet Identity Mapping Management”, VLSI Design, Aug. 7, 2008, 15 pp., vol. 2009, Article ID 941701, Hindawi Publishing Corporation, USA. |
Final Office Action, U.S. Appl. No. 11/936,873, Dec. 30, 2011, pp. 1-42. |
Notice of Allowance, U.S. Appl. No. 12/029,647, Feb. 25, 2011, pp. 1-17. |
Office Action, U.S. Appl. No. 12/118,315, Jul. 26, 2011, pp. 1-43. |
Final Office Action, U.S. Appl. No. 12/031,738, Dec. 22, 2011, pp. 1-32. |
Notice of Allowance, U.S. Appl. No. 12/015,975, Apr. 15, 2011, pp. 1-14. |
Notice of Allowance, U.S. Appl. No. 12/118,272, Mar. 22, 2011, pp. 1-14. |
Office Action, U.S. Appl. No. 11/938,376, Oct. 18, 2011, pp. 1-44. |
Notice of Allowance, U.S. Appl. No. 12/108,846, May 13, 2011, pp. 1-12. |
Notice of Allowance, U.S. Appl. No. 12/117,875, Jan. 27, 2011, pp. 1-10. |
Notice of Allowance, U.S. Appl. No. 12/117,897, May 4, 2011, pp. 1-21. |
Office Action, U.S. Appl. No. 12/113,286, Oct. 14, 2010, pp. 1-18. |
Notice of Allowance, U.S. Appl. No. 12/121,168, Mar. 22, 2011, pp. 1-16. |
Notice of Allowance, U.S. Appl. No. 12/121,168, Sep. 9, 2011, pp. 1-7. |
Final Office Action, U.S. Appl. No. 11/945,396, Jul. 19, 2012. |
Final Office Action, U.S. Appl. No. 12/972,753, Jul. 22, 2012. |
RCE, U.S. Appl. No. 12/102,033, Jun. 21, 2012. |
Office Action, U.S. Appl. No. 12/113,286, Jul. 19, 2012. |
Office Action, U.S. Appl. No. 11/945,396, Mar. 3, 2011. |
Final Office Action, U.S. Appl. No. 12/118,017, Mar. 28, 2011. |
Final Office Action, U.S. Appl. No. 11/937,579, Feb. 23, 2011. |
Office Action, U.S. Appl. No. 12/108,770, Apr. 12, 2011. |
Final Office Action, U.S. Appl. No. 12/117,906, Mar. 28, 2011. |
Office Action, U.S. Appl. No. 12/060,559, Apr. 1, 2011. |
Number | Date | Country | |
---|---|---|---|
20090282197 A1 | Nov 2009 | US |