DR. MARK GABRIEL DAVIS, ND
Dietitian and Nutritionist at Maryland Ave, Portland, OR

7243219, Jul 10, 2007

Dec 24, 2003

10/743711

Stephan J. Jourdan - Portland OR, US
Mark C. Davis - Portland OR, US
Pierre Michaud - Bruz, FR

Intel Corporation - Santa Clara CA

G06F 7/38, G06F 9/00, G06F 15/00, G06F 9/44

712239

Systems and methods of processing branch instructions provide for a bimodal predictor and a plurality of global predictors. The bimodal predictor is coupled to a prediction selector, where the bimodal predictor generates a bimodal prediction for branch instructions. The plurality of global predictors is coupled to the prediction selector, where each global predictor generates a corresponding global prediction for a branch instruction using different history or stew lengths. The prediction selector selects branch predictions from the bimodal prediction and the global predictions in order to arbitrate between predictors. The arbitration, update, and allocation schemes are designed to choose the most accurate predictor for each branch. Lower level predictors are used as filters to increase effective predictor capacity. Allocate and update schemes minimize aliasing between predictors.

8504807, Aug 6, 2013

Dec 26, 2009

12/655213

Vinodh Gopal - Westborough MA, US
James D. Guilford - Northborough MA, US
Gilbert M. Wolrich - Framingham MA, US
Wajdi K. Feghali - Boston MA, US
Erdinc Ozturk - Marlborough MA, US
Martin G. Dixon - Portland OR, US
Sean P. Mirkes - Beaverton OR, US
Bret L. Toll - Hillsboro OR, US
Maxim Loktyukhin - Folsom CA, US
Mark C. Davis - Portland OR, US
Alexandre J. Farcy - Hillsboro OR, US

Intel Corporation - Santa Clara CA

G06F 9/00

712223, 712221

A method of one aspect may include receiving a rotate instruction. The rotate instruction may indicate a source operand and a rotate amount. A result may be stored in a destination operand indicated by the rotate instruction. The result may have the source operand rotated by the rotate amount. Execution of the rotate instruction may complete without reading a carry flag.

2008007, Mar 20, 2008

Sep 14, 2006

11/521015

Mark C. Davis - Portland OR, US
Robert Hinton - Hillsboro OR, US
Boyd Phelps - Hillsboro OR, US

G06F 9/00

712239

Methods and apparatus to perform efficient branch prediction operations are described. In one embodiment, branch prediction may be performed by utilizing a combination of a bimodal predictor, a plurality of global predictors, and a loop predictor. Other embodiments are also described.

2011015, Jun 23, 2011

Dec 22, 2009

12/645383

Vinodh Gopal - Westborough MA, US
James D. Guilford - Northborough MA, US
Wajdi K. Feghali - Boston MA, US
Erdinc Ozturk - Marlborough MA, US
Gilbert M. Wolrich - Framingham MA, US
Martin G. Dixon - Portland OR, US
Mark C. Davis - Portland OR, US
Sean P. Mirkes - Beaverton OR, US
Alexandre Farcy - Hillsboro OR, US
Bret L. Toll - Hillsboro OR, US
Maxim Loktyukhin - Folsom CA, US

G06F 9/302

712221, 712E09017

A method in one aspect may include receiving a multiply instruction. The multiply instruction may indicate a first source operand and a second source operand. A product of the first and second source operands may be stored in one or more destination operands indicated by the multiply instruction. Execution of the multiply instruction may complete without writing a carry flag. Other methods are also disclosed, as are apparatus, systems, and instructions on machine-readable medium.