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: EP3343392

EP3343392 - HARDWARE ACCELERATOR ARCHITECTURE AND TEMPLATE FOR WEB-SCALE K-MEANS CLUSTERING [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  16.09.2022
Database last updated on 25.09.2024
FormerThe patent has been granted
Status updated on  08.10.2021
FormerGrant of patent is intended
Status updated on  06.06.2021
FormerRequest for examination was made
Status updated on  18.01.2019
FormerThe application has been published
Status updated on  01.06.2018
Most recent event   Tooltip06.09.2024Lapse of the patent in a contracting state
New state(s): MT		published on 09.10.2024 [2024/41]
Applicant(s)For all designated states
INTEL Corporation
2200 Mission College Blvd.
Santa Clara, CA 95054 / US
[2018/27]
Inventor(s)01 / NURVITADHI, Eriko
Intel Jones Farm Campus (JF2, pole J2)
2111 NE 25th Ave
Hillsboro, OR 97124 / US
02 / VENKATESH, Ganesh
1685 Sandyrock CT
San Jose, CA 95125-4538 / US
03 / KRISHNAN, Srivatsan
Intel Jones Farm-5
Hillsboro, OR 97124 / US
04 / SUBHASCHANDRA, Suchit
3049 NW Chapin Dr
Portland, OR 97229 / US
05 / MARR, Deborah
2564 NW Pettygrove St
Portland, OR 97210 / US
 [2018/27]
Representative(s)Samson & Partner Patentanwälte mbB
Widenmayerstraße 6
80538 München / DE
[2018/27]
Application number, filing date17207532.714.12.2017
[2018/27]
Priority number, dateUS20161539651531.12.2016         Original published format: US201615396515
[2018/27]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report 
No.:EP3343392
Date:04.07.2018
Language:EN
[2018/27]
Type: B1 Patent specification 
No.:EP3343392
Date:10.11.2021
Language:EN
[2021/45]
Search report(s)(Supplementary) European search report - dispatched on:EP29.05.2018
ClassificationIPC:G06F17/16, G06F16/22, G06F16/28, G06N20/00
[2021/26]
CPC:
G06N20/00 (EP,US); G06F9/5027 (CN); G06F16/2237 (EP,US);
G06F16/285 (EP,US); G06F17/16 (EP,US); G06F18/23213 (CN);
G06F9/5072 (CN) (-)
Former IPC [2018/27]G06F17/16
Designated contracting statesAL,   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,   RS,   SE,   SI,   SK,   SM,   TR [2019/08]
Former [2018/27]AL,  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,  RS,  SE,  SI,  SK,  SM,  TR 
TitleGerman:HARDWARE-BESCHLEUNIGER-ARCHITEKTUR UND -TEMPLATE ZUM K-MEANS-CLUSTERING AUF WEBEBENE[2018/27]
English:HARDWARE ACCELERATOR ARCHITECTURE AND TEMPLATE FOR WEB-SCALE K-MEANS CLUSTERING[2018/27]
French:ARCHITECTURE D'ACCÉLÉRATEUR MATÉRIEL ET GABARIT POUR ALGORITHME DES K-MOYENNES À L'ÉCHELLE DU WEB[2018/27]
Examination procedure02.01.2019Amendment by applicant (claims and/or description)
02.01.2019Examination requested  [2019/08]
02.01.2019Date on which the examining division has become responsible
07.06.2021Communication of intention to grant the patent
29.09.2021Fee for grant paid
29.09.2021Fee for publishing/printing paid
29.09.2021Receipt of the translation of the claim(s)
Opposition(s)11.08.2022No opposition filed within time limit [2022/42]
Fees paidRenewal fee
13.12.2019Renewal fee patent year 03
30.09.2020Renewal fee patent year 04
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  TooltipHU14.12.2017
AL10.11.2021
AT10.11.2021
CY10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
IT10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
MK10.11.2021
MT10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
TR10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
[2024/41]
Former [2024/29]HU14.12.2017
AL10.11.2021
AT10.11.2021
CY10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
IT10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
MK10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
TR10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2024/22]HU14.12.2017
AL10.11.2021
AT10.11.2021
CY10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
IT10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
MK10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2023/30]HU14.12.2017
AL10.11.2021
AT10.11.2021
CY10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
IT10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2023/27]HU14.12.2017
AL10.11.2021
AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
IT10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2023/03]AL10.11.2021
AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
CH31.12.2021
LI31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2023/01]AL10.11.2021
AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SI10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BE31.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/49]AL10.11.2021
AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/48]AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SK10.11.2021
SM10.11.2021
IE14.12.2021
LU14.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/46]AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SK10.11.2021
SM10.11.2021
LU14.12.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/39]AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
MC10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SK10.11.2021
SM10.11.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/35]AT10.11.2021
CZ10.11.2021
DK10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SK10.11.2021
SM10.11.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/34]AT10.11.2021
EE10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RO10.11.2021
RS10.11.2021
SE10.11.2021
SM10.11.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/33]AT10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RS10.11.2021
SE10.11.2021
SM10.11.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/25]AT10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RS10.11.2021
SE10.11.2021
BG10.02.2022
NO10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/24]AT10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RS10.11.2021
SE10.11.2021
BG10.02.2022
GR11.02.2022
IS10.03.2022
PT10.03.2022
Former [2022/23]AT10.11.2021
ES10.11.2021
FI10.11.2021
HR10.11.2021
LT10.11.2021
LV10.11.2021
PL10.11.2021
RS10.11.2021
BG10.02.2022
PT10.03.2022
Former [2022/22]AT10.11.2021
FI10.11.2021
LT10.11.2021
RS10.11.2021
BG10.02.2022
Former [2022/21]AT10.11.2021
RS10.11.2021
BG10.02.2022
Former [2022/19]BG10.02.2022
Documents cited:Search[XI]  - NURVITADHI ERIKO ET AL, "A sparse matrix vector multiply accelerator for support vector machine", 2015 INTERNATIONAL CONFERENCE ON COMPILERS, ARCHITECTURE AND SYNTHESIS FOR EMBEDDED SYSTEMS (CASES), IEEE, (20151004), doi:10.1109/CASES.2015.7324551, pages 109 - 116, XP032809059 [X] 1 * the whole document * [I] 2-15

DOI:   http://dx.doi.org/10.1109/CASES.2015.7324551
 [A]  - ERIKO NURVITADHI ET AL, "Hardware accelerator for analytics of sparse data", DESIGN, AUTOMATION & TEST IN EUROPE, EDA CONSORTIUM, 111 WEST SAINT JOHN STREET, SUITE 220 SAN JOSE CA 95113 USA, (20160314), ISBN 978-3-9815370-6-2, pages 1616 - 1621, XP058279566 [A] 1-15 * the whole document *
 [A]  - YAVITS L ET AL, "Sparse Matrix Multiplication On An Associative Processor", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, IEEE SERVICE CENTER, LOS ALAMITOS, CA, US, vol. 26, no. 11, doi:10.1109/TPDS.2014.2370055, ISSN 1045-9219, (20151101), pages 3175 - 3183, (20151007), XP011586282 [A] 1-15 * sections 1-4 *

DOI:   http://dx.doi.org/10.1109/TPDS.2014.2370055
 [A]  - Anonymous (joe K), "High throughput vs low latency in HDFS", (20130523), URL: https://stackoverflow.com/questions/16718095/high-throughput-vs-low-latency-in-hdfs, (20180514), XP055474703 [A] 1-15 * the whole document *
 [A]  - Erik Saule ET AL, "Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi", Medical image computing and computer-assisted intervention - MICCAI 2015 : 18th international conference, Munich, Germany, October 5-9, 2015; proceedings, Cham, Springer International Publishing, (20130205), vol. 8384, pages 559 - 570, 032548, doi:10.1007/978-3-642-55224-3_52, ISSN 0302-9743, ISBN 978-3-319-69952-3, XP055476927 [A] 1-15 * abstract * * sections 1, 2.1, 3-4 *

DOI:   http://dx.doi.org/10.1007/978-3-642-55224-3_52
 [A]  - Sander Lijbrink, "Irregular algorithms on the Xeon Phi", (20150617), URL: http://esc.fnwi.uva.nl/thesis/centraal/files/f1908787907.pdf, (20180518), XP055476934 [A] 1-15 * Chapter 1-3 *
 [A]  - Aydin Buluç ET AL, "Highly Parallel Sparse Matrix-Matrix Multiplication", (20100610), URL: https://arxiv.org/ftp/arxiv/papers/1006/1006.2183.pdf, (20180518), XP055476942 [A] 1-15 * the whole document *
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.