blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2202635

EP2202635 - System and method for a multi-schema branch predictor [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  13.09.2019
Database last updated on 25.09.2024
FormerThe patent has been granted
Status updated on  05.10.2018
FormerGrant of patent is intended
Status updated on  04.05.2018
FormerExamination is in progress
Status updated on  26.03.2018
FormerGrant of patent is intended
Status updated on  13.11.2017
FormerExamination is in progress
Status updated on  11.11.2016
Most recent event   Tooltip03.07.2020Lapse of the patent in a contracting state
New state(s): CY, MK		published on 05.08.2020  [2020/32]
Applicant(s)For all designated states
STMicroelectronics (Beijing) R&D Co. Ltd.
12B/F Yin Gu Building No 9 Northwest the Fourth Ring Road Hai Dian District
Beijing 100080 / CN
[2010/26]
Inventor(s)01 / Wang, Kai-Feng
c/o STMicroelectronics (Beijing) R&D Co. Ltd.
12B/F Yin Gu Building
No 9 Northwest the Fourth Ring Road
Hai Dian District Beijing, 100080 / CN
02 / Sun, Hong-Xia
c/o STMicroelectronics (Beijing) R&D Co. Ltd.
12B/F Yin Gu Building
No 9 Northwest the Fourth Ring Road
Hai Dian District Beijing, 100080 / CN
 [2018/45]
Former [2010/26]01 / Wang, Kai-Feng
c/o STMicroelectronics (Beijing) R&D Co. Ltd 12B/F Yin Gu Building No 9 Northwest the Fourth Ring Road
Hai Dian District Beijing, 100080 / CN
02 / Sun, Hong-Xia
c/o STMicroelectronics (Beijing) R&D Co. Ltd 12B/F Yin Gu Building No 9 Northwest the Fourth Ring Road
Hai Dian District Beijing, 100080 / CN
Representative(s)Style, Kelda Camilla Karen
Page White & Farrer Limited
Bedford House
21A John Street
London WC1N 2BF / GB
[N/P]
Former [2018/45]Style, Kelda Camilla Karen
Page White & Farrer
Bedford House
John Street
London, WC1N 2BF / GB
Former [2010/26]Style, Kelda Camilla Karen
Page White & Farrer Bedford House John Street
London, Greater London WC1N 2BF / GB
Application number, filing date09180315.522.12.2009
[2010/26]
Priority number, dateCN20081019096425.12.2008         Original published format: CN200810190964
[2010/26]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report 
No.:EP2202635
Date:30.06.2010
Language:EN
[2010/26]
Type: B1 Patent specification 
No.:EP2202635
Date:07.11.2018
Language:EN
[2018/45]
Search report(s)(Supplementary) European search report - dispatched on:EP05.03.2010
ClassificationIPC:G06F9/38
[2010/26]
CPC:
G06F9/3806 (EP,US); G06F9/3848 (EP,US)
Designated contracting statesAT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MK,   MT,   NL,   NO,   PL,   PT,   RO,   SE,   SI,   SK,   SM,   TR [2018/45]
Former [2010/26]AT,  BE,  BG,  CH,  CY,  CZ,  DE,  DK,  EE,  ES,  FI,  FR,  GB,  GR,  HR,  HU,  IE,  IS,  IT,  LI,  LT,  LU,  LV,  MC,  MK,  MT,  NL,  NO,  PL,  PT,  RO,  SE,  SI,  SK,  SM,  TR 
TitleGerman:System und Verfahren für einen Mehrfachschemenverzweigungsprädikator[2010/26]
English:System and method for a multi-schema branch predictor[2010/26]
French:Système et procédé pour prédicateur de branche multi-schéma[2010/26]
Examination procedure23.12.2010Examination requested  [2011/06]
14.01.2011Despatch of a communication from the examining division (Time limit: M06)
20.06.2011Reply to a communication from the examining division
27.10.2011Despatch of a communication from the examining division (Time limit: M04)
29.02.2012Reply to a communication from the examining division
27.06.2014Despatch of a communication from the examining division (Time limit: M04)
28.10.2014Reply to a communication from the examining division
03.11.2016Despatch of a communication from the examining division (Time limit: M04)
04.01.2017Reply to a communication from the examining division
14.11.2017Communication of intention to grant the patent
23.03.2018Disapproval of the communication of intention to grant the patent by the applicant or resumption of examination proceedings by the EPO
23.03.2018Fee for grant paid
23.03.2018Fee for publishing/printing paid
15.05.2018Communication of intention to grant the patent
25.09.2018Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  14.01.2011
Opposition(s)08.08.2019No opposition filed within time limit [2019/42]
Fees paidRenewal fee
27.12.2011Renewal fee patent year 03
26.12.2012Renewal fee patent year 04
25.12.2013Renewal fee patent year 05
22.12.2014Renewal fee patent year 06
23.12.2015Renewal fee patent year 07
22.12.2016Renewal fee patent year 08
21.12.2017Renewal fee patent year 09
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU22.12.2009
AT07.11.2018
CY07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
MK07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
TR07.11.2018
IE22.12.2018
LU22.12.2018
MT22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
GB07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
[2020/31]
Former [2020/30]HU22.12.2009
AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
TR07.11.2018
IE22.12.2018
LU22.12.2018
MT22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
GB07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2020/17]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
TR07.11.2018
IE22.12.2018
LU22.12.2018
MT22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
GB07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2020/11]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
MT22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
GB07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2020/08]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
MT22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2020/04]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
FR07.01.2019
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/51]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
BE31.12.2018
FR07.01.2019
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/49]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SI07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
FR07.01.2019
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/48]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SK07.11.2018
SM07.11.2018
IE22.12.2018
LU22.12.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/40]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
MC07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SK07.11.2018
SM07.11.2018
LU22.12.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/39]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SK07.11.2018
SM07.11.2018
LU22.12.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/37]AT07.11.2018
CZ07.11.2018
DK07.11.2018
EE07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
PL07.11.2018
RO07.11.2018
SE07.11.2018
SM07.11.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/35]AT07.11.2018
CZ07.11.2018
DK07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
PL07.11.2018
SE07.11.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/34]AT07.11.2018
DK07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
IT07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
SE07.11.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/26]AT07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
SE07.11.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
PT07.03.2019
Former [2019/24]AT07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
SE07.11.2018
BG07.02.2019
NO07.02.2019
GR08.02.2019
IS07.03.2019
Former [2019/23]AT07.11.2018
ES07.11.2018
FI07.11.2018
HR07.11.2018
LT07.11.2018
LV07.11.2018
NL07.11.2018
BG07.02.2019
NO07.02.2019
IS07.03.2019
Former [2019/22]FI07.11.2018
LT07.11.2018
BG07.02.2019
NO07.02.2019
IS07.03.2019
Former [2019/21]FI07.11.2018
LT07.11.2018
NO07.02.2019
IS07.03.2019
Former [2019/20]LT07.11.2018
NO07.02.2019
Documents cited:Search[XI]US2005066154  (CHUNG SUNG-WOO [KR]) [X] 16 * paragraphs [0019] , [0020] , [0046] - [0059]; figures 1,2,5,6B * [I] 1-15,17-18;
 [I]US2005114637  (JOHN LIZY K [US], et al) [I] 1-9 * paragraph [0033] - paragraph [0039]; figures 1A,1B *;
 [A]  - CHEN J B ET AL, "An Analysis of Dynamic Branch Prediction Schemes on System Workloads", PROCEEDINGS OF THE 23RD. ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE. PHILADELPHIA, MAY 22 - 24, 1996; [PROCEEDINGS OF THE ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE], NEW YORK, ACM/IEEE, US, (19960522), vol. SYMP. 23, ISBN 978-0-89791-786-5, pages 12 - 12, XP010868065 [A] 1-18 * Pages 13-14, paragraph 2 "Understanding Branch Prediction Schemes"; Figure 2 *
ExaminationUS6550004
 US5758142
 US2002194463
    - MATTEO MONCHIERO ET AL, The Combined Perceptron Branch Predictor, EURO-PAR 2005 - PARALLEL PROCESSING : 11TH INTERNATIONAL EURO-PAR CONFERENCE LISBON, PORTUGAL, AUGUST 30 - SEPTEMBER 2, 2005 ; PROCEEDINGS; [LECTURE NOTES IN COMPUTER SCIENCE;;LNCS], SPRINGER-VERLAG, BERLIN/HEIDELBERG, PAGE(S) 487 - 496, (20050804), ISBN 978-3-540-28700-1, XP019014855

DOI:   http://dx.doi.org/10.1007/11549468_56
by applicantUS2005066154
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.