Michael B Macpherson

US Patent:

6772175, Aug 3, 2004

Filed:

May 31, 2001

Appl. No.:

09/872278

Inventors:

Michael B. MacPherson - Portland OR

Assignee:

Intel Corporation - Santa Clara CA

International Classification:

G06F 700

US Classification:

7071041, 707102

Abstract:

A database includes a vertex array that contains coordinates of a three-dimensional mesh, a face array that contains pointers to target coordinates in the vertex array, the target coordinates defining a polygon in the three-dimensional mesh, a free vertex container that identifies elements in the vertex array that do not contain vertices, and a free face container that identifies elements in the face array that do not contain pointers.

US Patent:

20080066066, Mar 13, 2008

Filed:

Sep 8, 2006

Appl. No.:

11/518296

Inventors:

Michael B. MacPherson - Portland OR, US

International Classification:

G06F 9/46

US Classification:

718100

Abstract:

A processing system includes a task queue to serve as a circular buffer. Each record in the queue may include a status field and a task field. A producer thread in the processing system may determine whether the queue is full, based on the status field in the record at the tail of the queue. The producer may add a task to the queue in response to determining that the status field in the record at the tail of the queue marks that record as empty. A consumer thread may determine whether the queue is empty, based on the status field in the record at the head of the queue. The consumer may execute a pending task identified by the record at the head of the queue, in response to determining that the status field in the head record marks that record as full. Other embodiments are described and claimed.

US Patent:

6515660, Feb 4, 2003

Filed:

Dec 14, 1999

Appl. No.:

09/459903

Inventors:

Carl S. Marshall - Portland OR
Michael S. MacPherson - Portland OR

Assignee:

Intel Corporation - Santa Clara CA

International Classification:

G06T 1700

US Classification:

345420, 345423, 345428

Abstract:

An apparatus and method is provided for creating a neighbor mesh from a multi-resolution mesh (MRM) representation of a triangulated model. The apparatus and method include computing neighbor data for the neighbor mesh at the highest resolution of the MRM, and creating the neighbor mesh using the computed neighbor data. The apparatus and method further include changing the resolution of the MRM and re-computing the neighbor data at the changed resolution of the MRM, and computing an updated neighbor mesh from the re-computed neighbor data.

US Patent:

20210303481, Sep 30, 2021

Filed:

Mar 25, 2021

Appl. No.:

17/212503

Inventors:

- Santa Clara CA, US
Altug Koker - El Dorado Hills CA, US
Michael Macpherson - Portland OR, US
Aravindh V. Anantaraman - Folsom CA, US
Vasanth Ranganathan - El Dorado Hills CA, US
Lakshminarayanan Striramassarma - Folsom CA, US
Varghese George - Folsom CA, US
Abhishek Appu - El Dorado Hills CA, US
Prasoonkumar Surti - Folsom CA, US

Assignee:

Intel Corporation - Santa Clara CA

International Classification:

G06F 13/16
G06F 9/50
G06F 9/38
G06F 9/30
G06T 1/20
G06T 1/60

Abstract:

An apparatus to facilitate efficient data sharing for graphics data processing operations is disclosed. The apparatus includes a processing resource to generate a stream of instructions, an L1 cache communicably coupled to the processing resource and comprising an on-page detector circuit to determine that a set of memory requests in the stream of instructions access a same memory page; and set a marker in a first request of the set of memory requests; and arbitration circuitry communicably coupled to the L1 cache, the arbitration circuitry to route the set of memory requests to memory comprising the memory page and to, in response to receiving the first request with the marker set, remain with the processing resource to process the set of memory requests.