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

EP3008597 - METHOD FOR THE CONTINUOUS PROCESSING OF TWO-LEVEL DATA ON A SYSTEM WITH A PLURALITY OF NODES [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  04.02.2022
Database last updated on 02.11.2024
FormerThe patent has been granted
Status updated on  19.02.2021
FormerGrant of patent is intended
Status updated on  06.10.2020
FormerExamination is in progress
Status updated on  30.06.2017
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
NEC Corporation
7-1, Shiba 5-chome
Minato-ku, Tokyo 108-8001 / JP
[2021/12]
Former [2018/02]For all designated states
NEC Laboratories Europe GmbH
Kurfuersten-Anlage 36
69115 Heidelberg / DE
Former [2016/16]For all designated states
NEC Europe Ltd.
Kurfürsten-Anlage 36
69115 Heidelberg / DE
Inventor(s)01 / ALESIANI, Francesco
Mönchhofstraße 11
69120 Heidelberg / DE
02 / MASLEKAR, Nitin
Steinhofweg 112
69123 Heidelberg / DE
 [2016/16]
Representative(s)Ullrich & Naumann PartG mbB
Schneidmühlstrasse 21
69115 Heidelberg / DE
[N/P]
Former [2021/12]Patent- und Rechtsanwälte Ullrich & Naumann
PartG mbB
Schneidmühlstrasse 21
69115 Heidelberg / DE
Former [2016/16]Patent- und Rechtsanwälte Ullrich & Naumann
PartG mbB
Schneidmuehlstrasse 21
69115 Heidelberg / DE
Application number, filing date14736308.913.06.2014
[2016/16]
WO2014EP62451
Priority number, dateEP2013017211214.06.2013         Original published format: EP 13172112
[2016/16]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2014198937
Date:18.12.2014
Language:EN
[2014/51]
Type: A1 Application with search report 
No.:EP3008597
Date:20.04.2016
Language:EN
The application published by WIPO in one of the EPO official languages on 18.12.2014 takes the place of the publication of the European patent application.
[2016/16]
Type: B1 Patent specification 
No.:EP3008597
Date:24.03.2021
Language:EN
[2021/12]
Search report(s)International search report - published on:EP18.12.2014
ClassificationIPC:G06F9/50
[2016/16]
CPC:
G06F9/5033 (EP,US); G06F16/29 (US); G06F16/24568 (EP,US);
G06F16/285 (EP,US)
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 [2016/16]
Extension statesBANot yet paid
MENot yet paid
TitleGerman:VERFAHREN ZUR KONTINUIERLICHEN VERARBEITUNG VON DATEN AUF ZWEI EBENEN IN EINEM SYSTEM MIT MEHREREN KNOTEN[2016/16]
English:METHOD FOR THE CONTINUOUS PROCESSING OF TWO-LEVEL DATA ON A SYSTEM WITH A PLURALITY OF NODES[2016/16]
French:PROCÉDÉ DE TRAITEMENT CONTINU DE DONNÉES À DEUX NIVEAUX DANS UN SYSTÈME COMPORTANT PLUSIEURS NOEUDS[2016/16]
Entry into regional phase20.11.2015National basic fee paid 
20.11.2015Designation fee(s) paid 
20.11.2015Examination fee paid 
Examination procedure20.11.2015Examination requested  [2016/16]
12.07.2016Amendment by applicant (claims and/or description)
03.07.2017Despatch of a communication from the examining division (Time limit: M04)
13.11.2017Reply to a communication from the examining division
30.04.2020Despatch of a communication from the examining division (Time limit: M02)
23.06.2020Reply to a communication from the examining division
07.10.2020Communication of intention to grant the patent
10.02.2021Fee for grant paid
10.02.2021Fee for publishing/printing paid
10.02.2021Receipt of the translation of the claim(s)
Opposition(s)04.01.2022No opposition filed within time limit [2022/10]
Fees paidRenewal fee
27.06.2016Renewal fee patent year 03
27.06.2017Renewal fee patent year 04
27.06.2018Renewal fee patent year 05
25.06.2019Renewal fee patent year 06
31.03.2020Renewal fee patent year 07
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  TooltipHU13.06.2014
AL24.03.2021
AT24.03.2021
CY24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
IT24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
MK24.03.2021
MT24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
[2024/41]
Former [2024/22]HU13.06.2014
AL24.03.2021
AT24.03.2021
CY24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
IT24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
MK24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2023/30]HU13.06.2014
AL24.03.2021
AT24.03.2021
CY24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
IT24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2023/29]HU13.06.2014
AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
IT24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2023/10]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
IT24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2022/34]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
BE30.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2022/23]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
CH30.06.2021
FR30.06.2021
LI30.06.2021
IS24.07.2021
PT26.07.2021
Former [2022/22]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
GB24.06.2021
NO24.06.2021
GR25.06.2021
CH30.06.2021
LI30.06.2021
PT26.07.2021
IS24.12.2021
Former [2022/21]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
IE13.06.2021
LU13.06.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
CH30.06.2021
LI30.06.2021
PT26.07.2021
IS24.12.2021
Former [2022/18]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
LU13.06.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
PT26.07.2021
IS24.12.2021
Former [2022/13]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SI24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
PT26.07.2021
IS24.12.2021
Former [2022/10]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
PT26.07.2021
IS24.12.2021
Former [2022/08]AL24.03.2021
AT24.03.2021
CZ24.03.2021
DK24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
IS24.07.2021
PT26.07.2021
Former [2022/07]AL24.03.2021
AT24.03.2021
CZ24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
MC24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
IS24.07.2021
PT26.07.2021
Former [2021/52]AT24.03.2021
CZ24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
NL24.03.2021
PL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
IS24.07.2021
PT26.07.2021
Former [2021/51]AT24.03.2021
CZ24.03.2021
EE24.03.2021
ES24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
NL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
IS24.07.2021
PT26.07.2021
Former [2021/50]AT24.03.2021
CZ24.03.2021
EE24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
NL24.03.2021
RO24.03.2021
RS24.03.2021
SE24.03.2021
SK24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
PT26.07.2021
Former [2021/48]AT24.03.2021
CZ24.03.2021
EE24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
NL24.03.2021
RS24.03.2021
SE24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/46]AT24.03.2021
FI24.03.2021
HR24.03.2021
LT24.03.2021
LV24.03.2021
NL24.03.2021
RS24.03.2021
SE24.03.2021
SM24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/43]FI24.03.2021
HR24.03.2021
LV24.03.2021
NL24.03.2021
RS24.03.2021
SE24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/38]FI24.03.2021
HR24.03.2021
LV24.03.2021
RS24.03.2021
SE24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/37]FI24.03.2021
HR24.03.2021
LV24.03.2021
RS24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/36]FI24.03.2021
HR24.03.2021
BG24.06.2021
NO24.06.2021
GR25.06.2021
Former [2021/35]FI24.03.2021
HR24.03.2021
NO24.06.2021
Former [2021/33]FI24.03.2021
NO24.06.2021
Cited inInternational search[I]  - MARKATOS E P ET AL, "USING PROCESSOR AFFINITY IN LOOP SCHEDULING ON SHARED-MEMORY MULTIPROCESSORS", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, IEEE SERVICE CENTER, LOS ALAMITOS, CA, US, (19940401), vol. 5, no. 4, doi:10.1109/71.273046, ISSN 1045-9219, pages 379 - 400, XP000439635 [I] 1-15 * abstract * * From section I. A. Rationale; page 380, column r - page 381, column l, line 23 * * page 382, column l, line 11 - column r, line 14; figure 1 * * Section A. Scheduling Algorithms and section B. Applications; page 385, column l - page 386, column l *

DOI:   http://dx.doi.org/10.1109/71.273046
 [I]  - SUBRAMANIAM S ET AL, "Affinity scheduling of unbalanced workloads", SUPERCOMPUTING '94., PROCEEDINGS WASHINGTON, DC, USA 14-18 NOV. 1994, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, (19941114), ISBN 978-0-8186-6605-6, pages 214 - 226, XP010100480 [I] 1-15 * abstract * * page 215, column l, line 28 - line 44 * * page 216, line 13 - column r, line 11 *
 [I]  - CHANDRA R ET AL, "COOL: AN OBJECT-BASED LANGUAGE FOR PARALLEL PROGRAMMING", COMPUTER, IEEE, US, (19940801), vol. 27, no. 8, doi:10.1109/2.303616, ISSN 0018-9162, pages 13 - 26, XP000469771 [I] 1-15 * page 21, column l, line 21 - page 22, column l, line l; figures 6, 7; table 2 *

DOI:   http://dx.doi.org/10.1109/2.303616
 [A]  - "DATA-DEPENDENT WORKLOAD BALANCING", IBM TECHNICAL DISCLOSURE BULLETIN, INTERNATIONAL BUSINESS MACHINES CORP. (THORNWOOD), US, (19960101), vol. 39, no. 1, ISSN 0018-8689, pages 65 - 68, XP000556323 [A] 1-15 * page 67, line 6 *
 [AD]  - W. LU; W. WAND; K. KIMITA; T. YOKOTA, "Decreasing FCD processing delay by deploying distributed processing system", ITS TELECOMMUNICATIONS PROCEEDINGS, 2006 6TH INTERNATIONAL CONFERENCE ON IEEE, (2006), pages 206 - 209, XP031012398 [AD] 1-15 * abstract * * page 206, column r - page 207, column r *
 [AD]  - Z. XIAO; H. CHEN; B. ZANG, "A hierarchical approach to maximizing mapreduce efficiency", PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT), 2011 INTERNATIONAL CONFERENCE ON IEEE, (2011), pages 167 - 168, XP032083298 [AD] 1-15 * Sections I. and II.; page 167, column l - page 168, column l *

DOI:   http://dx.doi.org/10.1109/PACT.2011.22
by applicantUS2013024479
 US8386715
    - RONG CHEN; HAIBO CHEN; BINYU ZANG, "Tiledmapreduce: optimizing resource usages of data-parallel applications on multicore with tiling", PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PACT, (2010), vol. 10, pages 523 - 534, XP033066726
    - SHIN-GYU KIM; HYUCK HAN; HYUNGSOO JUNG; HYEONSANG EOM; HEON Y YEOM, "Improving mapreduce performance by exploiting input redundancy", JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, (2011), vol. 27, no. 3, pages 1137 - 1152
    - Z. XIAO; H. CHEN; B. ZANG, "A hierarchical approach to maximizing mapreduce efficiency", PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT), 2011 INTERNATIONAL CONFERENCE ON IEEE, (2011), doi:doi:10.1109/PACT.2011.22, pages 167 - 168, XP032083298

DOI:   http://dx.doi.org/10.1109/PACT.2011.22
    - W. LU; W. WAND; K. KIMITA; T. YOKOTA, "Decreasing FCD processing delay by deploying distributed processing system", ITS TELECOMMUNICATIONS PROCEEDINGS, 2006 6TH INTERNATIONAL CONFERENCE ON IEEE, (2006), doi:doi:10.1109/ITST.2006.288835, pages 206 - 209, XP002732240

DOI:   http://dx.doi.org/10.1109/ITST.2006.288835
    - Q. LI; T. ZHANG; Y. YU, "Using cloud computing to process intensive floating car data for urban traffic surveillance", INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, (2011), vol. 25, no. 8, pages 1303 - 1322
    - F. CHEN; M. SHEN; Y. TANG, "Local path searching based map matching algorithm for floating car data", PROCEDIA ENVIRONMENTAL SCIENCES, (2011), vol. 10, doi:doi:10.1016/j.proenv.2011.09.093, pages 576 - 582, XP028343422

DOI:   http://dx.doi.org/10.1016/j.proenv.2011.09.093
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.