The present application is related to the following co-assigned U.S. patent applications, which are expressly incorporated by reference herein:
U.S. application Ser. No. 11/412,678, entitled “GRAPHICS SYSTEM WITH CONFIGURABLE CACHES”, filed on Apr. 26, 2006;
U.S. application Ser. No. 11/441,696, entitled “GRAPHICS PROCESSOR WITH ARITHMETIC AND ELEMENTARY FUNCTION UNITS” filed on May 25, 2006.
1. Field
Various embodiments of the invention pertain to processor operation and architectures, and particularly to a multi-threaded processor that internally reorders output threads thereby avoiding the need for an external reorder buffer.
2. Background
Multi-threaded processors are designed to improve processing performance by efficiently executing multiple streams of encoded data (i.e., threads) at once within a single processor. Multiple storage registers are typically used to maintain the state of multiple threads at the same time. Multi-threaded architectures often provide more efficient utilization of various processor resources, and particularly the execution logic or arithmetic logic unit (ALU) within the processor. By feeding multiple threads to the ALU, clock cycles that would otherwise have been idle due to a stall or other delays in the processing of a particular thread may be utilized to service a different thread.
A conventional multi-threaded processor may receive multiple threads and processes each thread so as to maintain the same input thread order at the output stage. This means that the first thread received from a program is the first thread outputted to the program.
Programmable multi-threaded processors often include flow control capabilities. This permits programs to include flow control instructions sent to the programmable multi-threaded processor that may cause threads to be processed out of order. For example, a first input thread may not finish execution first, in some cases, it may finish execution last. However, programs expect to receive outputted threads in the order in which they were sent to the processor.
One approach to maintaining the order of a sequence of threads for a particular program or application is to add a large buffer to reorder the threads. This buffer is typically external to the multi-threaded processor core and requires additional logic to implement. Adding a large external buffer increases the cost of implementing a multi-threaded processor and also takes up much needed space.
Thus, a way is needed to reorder a sequence of threads for a particular program so that they are outputted by a multi-threaded processor in the same order as they are received without the need for an additional reorder buffer.
A multi-threaded processor is provided having (a) a thread scheduler to track a sequence in which a plurality of threads are received from an application, (b) an internal memory buffer to temporarily store the plurality of received threads, and (c) a processing unit coupled to the thread scheduler and internal memory buffer. The processing unit is configured to (1) process the plurality of threads to obtain a plurality of corresponding results, and (2) store the plurality of results in the internal memory buffer. The plurality of threads are processed by the processing unit according to the order defined by flow control instructions associated with the plurality of threads. The flow control instructions may cause the plurality of threads to be processed in a different sequence than they were received. The thread scheduler causes the plurality of stored results to be outputted from the internal memory buffer according to the sequence in which the corresponding threads were received from the application. The memory buffer may include a plurality of input registers to store the plurality of received threads prior to processing and a plurality of output registers to store the plurality of results prior to being outputted. A load controller may be coupled to the thread scheduler and configured to store the plurality of threads in a plurality of input registers in the internal memory buffer under the direction of the thread scheduler. The load controller may also output the results from the internal memory buffer under the direction of the thread scheduler.
A method operational on a multi-thread processor compiler provides for (a) receiving a plurality of instructions to be compiled for operation on a multi-threaded processor; (b) identifying output instructions in the plurality of instructions that direct output results to an external register, (c) converting the identified output instructions to direct the output results to an internal register, and/or (d) compiling the plurality of instructions for processing by the multi-threaded processor. The multi-threaded processor may support flow control instructions that cause threads to be processed in a different order than they are received.
In the following description, specific details are given to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits may not be shown in block diagrams in order not to obscure the embodiments in unnecessary detail.
Also, it is noted that the embodiments may be described as a process that is depicted as a flowchart, a flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination corresponds to a return of the function to the calling function or the main function.
Moreover, a storage medium may represent one or more devices for storing data, including read-only memory (ROM), random access memory (RAM), magnetic disk storage mediums, optical storage mediums, flash memory devices, and/or other machine readable mediums for storing information. The term “machine readable medium” includes, but is not limited to portable or fixed storage devices, optical storage devices, wireless channels, and various other mediums capable of storing, containing, or carrying instruction(s) and/or data.
Furthermore, embodiments may be implemented by hardware, software, firmware, middleware, microcode, or a combination thereof. When implemented in software, firmware, middleware, or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine-readable medium such as a storage medium or other storage means. A processor may perform the necessary tasks. A code segment may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or a combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, and the like, may be passed, forwarded, or transmitted via a suitable means including memory sharing, message passing, token passing, and network transmission, among others.
One feature provides a multi-threaded processor configured to internally reorder output threads, thereby avoiding the need for an external output reorder buffer. The multi-threaded processor writes its thread results to a register bank in an internal memory buffer to guarantee that thread results are outputted in the same order in which the threads are received. A thread scheduler within the multi-threaded processor manages resource allocation, thread arbitration, and thread ordering to avoid the need for an external reorder buffer.
Another aspect of the invention provides a compiler for the multi-threaded processor that converts instructions that would normally send thread results directly to an external reorder buffer so that the thread results are instead sent to internal temporary registers in an internal memory buffer of the multi-threaded processor.
A plurality of threads 104 from one or more processes are received at an input interface (e.g., multiplexer 106) that multiplexes the threads 104 into a thread stream 105. Input threads 104 may include graphics data, such as pixel information, sent by one or more applications or processes. Such pixel information may include position coordinates, color attributes, and/or texture attributes for one or more pixels. Each application or process may have more than one thread. In some implementations, the threads for a particular application or process may have associated flow control instructions that cause the threads 104 to be processed in a different order than they were received from the application or process.
Thread scheduler 108 receives the thread stream 105 and performs various functions to schedule and manage execution of threads 104. For example, thread scheduler 108 may schedule processing of threads 104, determine whether resources needed by a particular thread are available, and move the thread to a memory buffer 118 (e.g., arranged as register file banks) via a load controller 112. Thread scheduler 108 interfaces with load controller 112 in order to synchronize the resources for received threads 104. Thread scheduler 108 may also monitor the order in which threads are received for a particular application or process and cause those threads to be outputted in the same order or sequence as they were received.
Thread scheduler 108 selects active threads for execution, checks for read/write port conflicts among the selected threads and, if there are no conflicts, sends instruction(s) for one thread into an ALU 110 and sends instruction(s) for another thread to load controller 112. At the request of thread scheduler 108, load controller 112 may also be configured to obtain data associated with a thread (from texture engine 126) and instructions associated with the thread from an external source (e.g., global data cache 124 and/or an external memory device, etc.). In addition to issuing fetch requests for missing instructions, load controller 1122 loads thread data into memory buffer 118 and associated instructions into instruction cache 114. Thread scheduler 108 also removes threads that have been processed by ALU 110.
ALU 110 may be a single quad ALU or four scalar ALUs. In one implementation, ALU 110 may perform pixel-parallel processing on one component of an attribute for up to four pixels. Alternatively, ALU 110 may perform component-parallel processing on up to four components of an attribute for a single pixel. ALU 110 fetches data from memory buffer 118 and receives constants from constant RAM 116. Ideally, ALU 110 processes data at every clock cycle so that it is not idle, thereby increasing processing efficiency. ALU 110 may include multiple read and write ports on a bus to memory buffer 118 so that it is able to write out thread results while new thread data is fetched/read on each clock cycle.
Multi-threaded processor 102 may be a programmable processor configured to efficiently process particular types of data (e.g., graphics data). For example, multi-threaded processor 102 may include constant data for efficiently processing multi-media data streams (e.g., video, audio, etc.). For this purpose, a constant RAM 116 may be included in the multi-threaded processor 102 to enable load controller 112, under the direction of thread scheduler 108, to load application-specific constant data to efficiently process particular types of instructions. For instance, an instruction cache 114 stores instructions for the threads to provide instructions to thread scheduler 108. Under the control of thread scheduler 108, load controller 112 loads instruction cache 114 with instructions from global data cache 124 and loads constant RAM 116 and memory buffer 118 with data from global data cache 124 and/or texture engine 126. The instructions indicate specific operations to be performed for each thread. Each operation may be an arithmetic operation, an elementary function, a memory access operation, etc.
Rather than writing out results to an external reorder buffer, ALU 110 uses memory buffer 118 to buffer its results before they are outputted by multi-threaded processor 102. To facilitate this dual use of memory buffer 118, the compiler for multi-threaded processor 102 may be configured to convert direct output register instructions to temporary register and use a global register to define which internal register in the memory buffer 118 should be used for writing results. That is, the compiler converts instructions that would normally send output from the ALU 110 to an external output register (i.e., an external reorder buffer) so that the outputs are instead sent to temporary registers (i.e., memory buffer 118). The compiler may accomplish this by either replacing direct output register instructions or by redirecting such output to temporary registers (i.e., in memory buffer 118). Global registers are used to indicate to ALU 110 which temporary registers (in memory buffer 118) are to be used to output results. In various implementations, the global registers that define the internal registers in memory buffer 118 (to be used to store outputs from ALU 110) may be either internal or external to multi-threaded processor 102.
Once results from ALU 110 are buffered in specified temporary registers in memory buffer 118, thread scheduler 108 directs their output sequence. That is, since thread scheduler 108 knows the order or sequence in which threads for a particular process were received, it directs load controller 112 to send out thread results in a specified sequence (i.e., the order in which the threads where originally received by thread scheduler 108). Since thread scheduler 108 knows which thread is being processed by ALU 110 at each clock cycle, it knows which registers in memory buffer 118 are used to store each ALU result. Thread scheduler 108 then directs load controller 112 to read-out buffered results from memory buffer 118 to an output interface (e.g., demultiplexer 120) so that the thread results 122 are sent to processes in the order or sequence in which the corresponding threads were received.
Rather than outputting processing results to an external reorder buffer, the present invention sends or redirects the thread results (Results 1 through N) to temporary registers in an internal memory buffer 207. The memory buffer 207 may store threads that are fetched by the processing circuits as well as the thread results of the processed threads. Memory buffer 207 may also include a plurality of register file banks 208 in which thread results are stored. Multi-threaded processor 204 may map virtual registers to available registers 208 in internal memory buffer 207 so that thread results can be stored in contiguous and/or non-contiguous memory addresses. Dynamic sizing of the internal registers allows flexible allocation of internal memory buffer 207 depending on the type and size of data in a thread.
Redirecting thread results to temporary registers in internal memory buffer 207 may be accomplished by having the multi-threaded processor compiler convert instructions that would normally send output results to an external output register (i.e., an external reorder buffer) so that the results from processing circuits 206 are instead sent to temporary registers in internal register file banks 208. By using internal register file banks 208 for buffering and reordering output results, an external reorder buffer is not needed thus saving costs and power.
As a result of flow control instructions, Threads 1 through N may be processed out of order, generating the processing output sequence of Result 2 (corresponding to Thread 2), Result 3 (corresponding to Thread 3), etc., Result N (corresponding to Thread N), Result 1 (corresponding to Thread 1), Result N−1 (corresponding to Thread N−1), for example. These results are held/stored in temporary registers in register file banks 208 in memory buffer 207. The processing results are buffered until Results 1 through N 210 can be outputted in the order in which their corresponding threads 202 were received.
In one implementation, graphics processor 402 also includes supporting components, such as a texture engine 410 that performs specific graphic operations such as texture mapping, and a cache memory 412 that is a fast memory that can store data and instructions for multi-threaded processor 404 and texture engine 410. Cache memory 412 may be coupled to an external main memory 414 through which it can receive data and/or instructions for particular threads.
Multi-threaded processor 404 may include an internal memory buffer which is used for temporarily storing threads 406 and/or thread result. For a given process or application, a thread scheduler in the multi-threaded processor causes the thread results to be output in the same order or sequence in which the corresponding threads were originally received.
Graphics processor 402 and/or multi-threaded processor 404 (e.g., shader core) may be implemented in various hardware units, such as application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing device (DSPDs), programmable logic devices (PLDs), field programmable gate array (FPGAs), processors, controllers, micro-controllers, microprocessors, and other electronic units.
Certain portions of graphics processor 402 and/or multi-threaded processor 404 may be implemented in firmware and/or software. For example, a thread scheduler and/or a load control unit (e.g., in multi-threaded processor 404) may be implemented with firmware and/or software code (e.g., procedures, functions, and so on) that perform the functions described herein. The firmware and/or software codes may be stored in a memory (e.g., cache memory 412 or main memory 414) and executed by multi-threaded processor 404.
One or more of the components, steps, and/or functions illustrated in
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.
It should be noted that the foregoing embodiments are merely examples and are not to be construed as limiting the invention. The description of the embodiments is intended to be illustrative, and not to limit the scope of the claims. As such, the present teachings can be readily applied to other types of apparatuses and many alternatives, modifications, and variations will be apparent to those skilled in the art.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3469244 | Perotto | Sep 1969 | A |
| 4079452 | Larson et al. | Mar 1978 | A |
| 4361868 | Kaplinsky | Nov 1982 | A |
| 5517611 | Deering | May 1996 | A |
| 5590326 | Manabe | Dec 1996 | A |
| 5598546 | Blomgren | Jan 1997 | A |
| 5777629 | Baldwin | Jul 1998 | A |
| 5793385 | Nale | Aug 1998 | A |
| 5794016 | Kelleher | Aug 1998 | A |
| 5798770 | Baldwin | Aug 1998 | A |
| 5831640 | Wang et al. | Nov 1998 | A |
| 5870579 | Tan | Feb 1999 | A |
| 5872729 | Deolaliker | Feb 1999 | A |
| 5913059 | Torii | Jun 1999 | A |
| 5913925 | Kahle et al. | Jun 1999 | A |
| 5944816 | Dutton et al. | Aug 1999 | A |
| 5949920 | Jordan et al. | Sep 1999 | A |
| 5958041 | Petolino, Jr. et al. | Sep 1999 | A |
| 5991865 | Longhenry et al. | Nov 1999 | A |
| 6092175 | Levy et al. | Jul 2000 | A |
| 6163839 | Janik et al. | Dec 2000 | A |
| 6188411 | Lai | Feb 2001 | B1 |
| 6219769 | Strongin et al. | Apr 2001 | B1 |
| 6226604 | Ehara et al. | May 2001 | B1 |
| 6279099 | Van Hook et al. | Aug 2001 | B1 |
| 6466221 | Satoh et al. | Oct 2002 | B1 |
| 6480941 | Franke et al. | Nov 2002 | B1 |
| RE37944 | Fielder et al. | Dec 2002 | E |
| 6493741 | Emer et al. | Dec 2002 | B1 |
| 6515443 | Kelly et al. | Feb 2003 | B2 |
| 6516443 | Zook | Feb 2003 | B1 |
| 6549209 | Shinohara et al. | Apr 2003 | B1 |
| 6570570 | Suzuki et al. | May 2003 | B1 |
| 6574725 | Kranich et al. | Jun 2003 | B1 |
| 6577762 | Seeger et al. | Jun 2003 | B1 |
| 6593932 | Porterfield | Jul 2003 | B2 |
| 6614847 | Das et al. | Sep 2003 | B1 |
| 6636214 | Leather et al. | Oct 2003 | B1 |
| 6654428 | Bose et al. | Nov 2003 | B1 |
| 6693719 | Gupta et al. | Feb 2004 | B1 |
| 6697063 | Zhu | Feb 2004 | B1 |
| 6717583 | Shimomura et al. | Apr 2004 | B2 |
| 6734861 | Van Dyke et al. | May 2004 | B1 |
| 6744433 | Bastos et al. | Jun 2004 | B1 |
| 6792575 | Samaniego et al. | Sep 2004 | B1 |
| 6807620 | Suzuoki et al. | Oct 2004 | B1 |
| 6825843 | Allen et al. | Nov 2004 | B2 |
| 6891533 | Alcorn et al. | May 2005 | B1 |
| 6891544 | Oka et al. | May 2005 | B2 |
| 6950927 | Apisdorf et al. | Sep 2005 | B1 |
| 6952213 | Ebihara | Oct 2005 | B2 |
| 6952440 | Underbrink | Oct 2005 | B1 |
| 6958718 | Symes et al. | Oct 2005 | B2 |
| 6964009 | Samaniego et al. | Nov 2005 | B2 |
| 6972769 | Nebeker et al. | Dec 2005 | B1 |
| 6999076 | Morein | Feb 2006 | B2 |
| 7006881 | Hoffberg et al. | Feb 2006 | B1 |
| 7015913 | Lindholm et al. | Mar 2006 | B1 |
| 7015914 | Bastos et al. | Mar 2006 | B1 |
| 7027062 | Lindholm et al. | Apr 2006 | B2 |
| 7027540 | Wilson et al. | Apr 2006 | B2 |
| 7030878 | Xu et al. | Apr 2006 | B2 |
| 7034828 | Drebin et al. | Apr 2006 | B1 |
| 7068272 | Voorhies et al. | Jun 2006 | B1 |
| 7088371 | Lippincott | Aug 2006 | B2 |
| 7098922 | Bastos et al. | Aug 2006 | B1 |
| 7130443 | Werner et al. | Oct 2006 | B1 |
| 7145565 | Everitt et al. | Dec 2006 | B2 |
| 7146486 | Prokopenko et al. | Dec 2006 | B1 |
| 7174224 | Hudson et al. | Feb 2007 | B2 |
| 7196708 | Dorojevets et al. | Mar 2007 | B2 |
| 7239322 | LeFebvre et al. | Jul 2007 | B2 |
| 7239735 | Nozaki | Jul 2007 | B2 |
| 7268785 | Glanville et al. | Sep 2007 | B1 |
| 7339592 | Lindholm et al. | Mar 2008 | B2 |
| 7358502 | Appleby et al. | Apr 2008 | B1 |
| 7372484 | Mouli | May 2008 | B2 |
| 7379067 | Deering et al. | May 2008 | B2 |
| 7388588 | D'Amora et al. | Jun 2008 | B2 |
| 7447873 | Nordquist | Nov 2008 | B1 |
| 7557832 | Lindenstruth et al. | Jul 2009 | B2 |
| 7574042 | Tsuruoka et al. | Aug 2009 | B2 |
| 7583294 | Ray et al. | Sep 2009 | B2 |
| 7612803 | Meitav et al. | Nov 2009 | B2 |
| 7619775 | Kitamura et al. | Nov 2009 | B2 |
| 7633506 | Leather et al. | Dec 2009 | B1 |
| 7673281 | Yamanaka et al. | Mar 2010 | B2 |
| 7683962 | Border et al. | Mar 2010 | B2 |
| 7684079 | Takata et al. | Mar 2010 | B2 |
| 7733392 | Mouli | Jun 2010 | B2 |
| 7738699 | Tsuruoka et al. | Jun 2010 | B2 |
| 7808505 | Deering et al. | Oct 2010 | B2 |
| 7813822 | Hoffberg | Oct 2010 | B1 |
| 7826092 | Ejima et al. | Nov 2010 | B2 |
| 7904187 | Hoffberg et al. | Mar 2011 | B2 |
| 7920204 | Miyanari | Apr 2011 | B2 |
| 7966078 | Hoffberg et al. | Jun 2011 | B2 |
| 7987003 | Hoffberg et al. | Jul 2011 | B2 |
| 8046313 | Hoffberg et al. | Oct 2011 | B2 |
| 8054573 | Mathew et al. | Nov 2011 | B2 |
| 8154818 | Mathew et al. | Apr 2012 | B2 |
| 8165916 | Hoffberg et al. | Apr 2012 | B2 |
| 20020091915 | Parady | Jul 2002 | A1 |
| 20030034975 | Lindholm et al. | Feb 2003 | A1 |
| 20030080959 | Morein | May 2003 | A1 |
| 20030105793 | Guttag et al. | Jun 2003 | A1 |
| 20030167379 | Soltis, Jr. | Sep 2003 | A1 |
| 20030172234 | Soltis, Jr. | Sep 2003 | A1 |
| 20040030845 | DeLano et al. | Feb 2004 | A1 |
| 20040119710 | Piazza et al. | Jun 2004 | A1 |
| 20040130552 | Duluk, Jr. et al. | Jul 2004 | A1 |
| 20040172631 | Howard | Sep 2004 | A1 |
| 20040187119 | Janik et al. | Sep 2004 | A1 |
| 20040246260 | Kim et al. | Dec 2004 | A1 |
| 20050090283 | Rodriquez | Apr 2005 | A1 |
| 20050184994 | Suzuoki et al. | Aug 2005 | A1 |
| 20050195198 | Anderson et al. | Sep 2005 | A1 |
| 20050206647 | Xu et al. | Sep 2005 | A1 |
| 20060004942 | Hetherington et al. | Jan 2006 | A1 |
| 20060020831 | Golla et al. | Jan 2006 | A1 |
| 20060028482 | Donovan et al. | Feb 2006 | A1 |
| 20060033735 | Seiler et al. | Feb 2006 | A1 |
| 20060066611 | Fujiwara et al. | Mar 2006 | A1 |
| 20060136919 | Aingaran et al. | Jun 2006 | A1 |
| 20070030280 | Paltashev et al. | Feb 2007 | A1 |
| 20070070075 | Hsu | Mar 2007 | A1 |
| 20070185953 | Prokopenko et al. | Aug 2007 | A1 |
| 20070236495 | Gruber et al. | Oct 2007 | A1 |
| 20070252843 | Yu et al. | Nov 2007 | A1 |
| 20070257905 | French et al. | Nov 2007 | A1 |
| 20070268289 | Yu et al. | Nov 2007 | A1 |
| 20070273698 | Du et al. | Nov 2007 | A1 |
| 20070292047 | Jiao et al. | Dec 2007 | A1 |
| 20070296729 | Du et al. | Dec 2007 | A1 |
| 20080074433 | Jiao et al. | Mar 2008 | A1 |
| Number | Date | Country |
|---|---|---|
| 0627682 | Dec 1994 | EP |
| 0676691 | Oct 1995 | EP |
| 0917056 | May 1999 | EP |
| 3185521 | Aug 1991 | JP |
| 9062852 | Mar 1997 | JP |
| 9231380 | Sep 1997 | JP |
| 2000057365 | Feb 2000 | JP |
| 2001222712 | Aug 2001 | JP |
| 2001236221 | Aug 2001 | JP |
| 2001357410 | Dec 2001 | JP |
| 2002269583 | Sep 2002 | JP |
| 2002529870 | Sep 2002 | JP |
| 2006099422 | Apr 2006 | JP |
| 2137186 | Sep 1999 | RU |
| 2004109122 | Jun 2007 | RU |
| I230869 | Apr 2005 | TW |
| 0028482 | May 2000 | WO |
| WO0215000 | Feb 2002 | WO |
| WO2005086090 | Sep 2005 | WO |
| Entry |
|---|
| Akkary, H. and Driscoll, M. A. 1998. A dynamic multithreading processor. In Proceedings of the 31st Annual ACM/IEEE international Symposium on Microarchitecture (Dallas, Texas, United States). International Symposium on Microarchitecture. IEEE Computer Society Press, Los Alamitos, CA, 226-236. |
| Kenji Watanabe, Wanming Chu, Yamin Li, “Exploiting Java Instruction/Thread Level Parallelism with Horizontal Multithreading,” Australasian Computer Systems Architecture Conference, p. 122, 6th Australasian Computer Systems Architecture Conference (AustCSAC'01), 2001. |
| Ying Chen, Resit Sendag, David J. Lilja, “Using Incorrect Speculation to Prefetch Data in a Concurrent Multithreaded Processor,” Parallel and Distributed Processing Symposium, International, p. 76b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003. |
| International Search Report, PCT/US07/070004—International Search Authority European Patent Office, Dec. 11, 2007. |
| Bjorke K: “High quality filtering” Chapter 24 in Book ‘GPU Gems’, [Online] 2004, XP002534488 Retrieved from the Internet: URL:http://http.developer.nvidia.com/GPUGems/gpugems—ch24.html> [retrieved on Jun. 29, 2009]. |
| Blamer K et al.: “A Single Chip Multimedia Video Processor,” Custom Integrated Circuits Conference, pp. 91-94, Proceedings of the IEEE (May 1994). |
| Segal, M. at al.: “The OpenGL Graphics System: A Specification.” pp. 1-368, Version 2.0 (Oct. 22, 2004). |
| Waldspurger et al., Register Relocation: Flexible Contexts for Multithreading, International Symposium on Computer Architcture, Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993. |
| Written Opinion, PCT/US07/070004—International Searching Authority—European Patent Office—Dec. 11, 2007. |
| Deering M et al: “The SAGE graphics architecture” Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'02), Jul. 23-26, 2002, San Antonio, Texas, USA, 2002, pp. 683-692, XP002534489. |
| Hadwiger M. et al: “Hardware-accelerated high-quality filtering on PC hardware” Proceedings of 2001 Conference on Vision, Modelling and Visualization, Nov. 21-23, 2001, Stuttgart, Germany, [Online] 2001, XP002534490 Retrieved from the Internet URL:http://wwwvis.informatik.uni-stuttgart.de/vmv01/dl/papers/8.pdf> [retrieved on Jun. 29, 2009]. |
| Hopf MI et al: “Accelerating 3D convolution using graphics hardware” Visualization '99. Proceedings San Francisco, CA, USA Oct. 24-29, 1999, Piscataway, NJ, USA. IEEE, US, Oct. 29, 1999, pp. 471-564, XP031385575 ISBN: 978-0-7803-5897-3. |
| Novasad J: “Advanced high quality filtering” Chapter 27 in Book ‘GPU-Gems 2’, [Online]. 2005, XP002534486 Retrieved from the Internet:. URL:http://http.developer.nvidia.comiGPUGe ms2/gpugems2—chapter27.html> [retrieved on Jun. 29, 2009]. |
| Owens J.D et al: “A survey of general-purpose computation on graphics hardware” Computer Graphics Forum, vol, 26, No. 1, Mar. 2007, pp. 80-113, XP002534491. |
| Sigg C. et al: “Fast third-order texture filtering” Chapter 20 in Book ‘GPU Gems 2’, 084 [Online] 2005, XP002534487 Retrieved from the Internet: URL:http://http.developer.nvidia.corn/GPUGe ms2/gpugems2—chapter20.html> [retrieved on Jun. 29, 2009]. |
| Kilgariff et al.; “Chapter 30, The GeForce 6 Series GPU Architecture;” GPU Gems 2 Copyright 2005, pp. 471-491. |
| Lindholm et al.; “A User-Programmable Vertex Engine;” Aug. 17-21, 2001; ACM SIGGRAPH; pp. 149-158. |
| Wynn, Chris, “nVIDIA OpenGL Vertex Programming on Future-Generation GPUs;” May 8, 2004; Nvidia Corporation; pp. 1-97. |
| Sohn, et al., “A 155-mW 50-Mvertices/s Graphics Processor With Fixed-Point Programmable Vertex Shader for Mobile Applications,” IEEE Journal of Solid-State Circuits, vol. 41, No. 5, May 2006, pp. 1081-1091. |
| Translation of Office Action in Japanese application 2009-511215 corresponding to U.S. Appl. No. 11/435,454, citing WO05086090, US20030080959 and JP2001222712 dated Feb. 22, 2011. |
| Hiroaki Hirata, and 4 others, “An elementary processor Architecture with Parallel Instruction Issuing from Multiple Threads,” Information Processing Society article magazine, Information Processing Society of Japan, 1993, vol. 34, No. 4, pp. 595-605. |
| Onoue, M., et al., “3D Image Handbook”, 1st ed., Asakura Publishing Co., Ltd. (Kunizou Asakura), Feb. 20, 2006, pp. 152-170. |
| Number | Date | Country | |
|---|---|---|---|
| 20070283356 A1 | Dec 2007 | US |