Bryan Black
Intel
33 Papers
827 Citations
Bryan Black is an academic researcher from Intel. The author has contributed to research in topics: Cache & Instruction register. The author has an hindex of 16, co-authored 33 publications.
Chat about Author
Papers
Die Stacking (3D) Microarchitecture
Bryan Black,Murali Annavaram,Ned Brekelbaum,John P. Devale,Lei Jiang,Gabriel H. Loh,Don McCaule,Pat Morrow,Donald W. Nelson,Daniel Pantuso,Paul Reed,Jeff Rupley,Sadasivan Shankar,John Paul Shen,Clair C. Webb +14 more
- 09 Dec 2006
TL;DR: This research study the performance advantages and thermal challenges of two forms of die stacking: Stacking a large DRAM or SRAM cache on a microprocessor and dividing a traditional micro architecture between two die in a stack.
684
Processor Design in 3D Die-Stacking Technologies
TL;DR: This article provides a technical introduction to three-dimensional integration and its impact on processor design, and most of the observations and conclusions apply to other microprocessor market segments.
353
3D processing technology and its impact on iA32 microprocessors
Bryan Black,Donald W. Nelson,Clair C. Webb,N. Samra +3 more
- 11 Oct 2004
TL;DR: In this initial study, it is shown that a 3D implementation can potentially improve the performance by 15% while improving power by 15%.
Hierarchical scheduling windows
Edward A. Brekelbaum,Jeff Rupley,Christopher B. Wilkerson,Bryan Black +3 more
- 18 Nov 2002
TL;DR: Hierarchical Scheduling Windows is introduced, which exploits latency tolerant instructions in order to reduce implementation complexity and yields a very large instruction window that tolerates wakeup, select, and bypass latency, while extracting significant far-flung ILP.
Patent
Efficient bloom filter
Mauricio Breternitz,Youfeng Wu,Peter G. Sassone,II Jeffrey P. Rupley,Wesley Attrot,Bryan Black +5 more
- 19 Dec 2006
TL;DR: In this article, the Bloom filter using multiple single-ported memory slices is described, where a control value is combined with a hashed address value such that the resultant address value has the property that one, and only one, of the k memories or slices is selected for a given input value, a, for each bank.
75