Deutsch English Français

Contact

EP2761435

European procedure

Quick help

Maintenance news

Scheduled maintenance

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

Other outages
Availability
Register Forum

2022.02.11

More...

News flashes

News flashes

New version of the European Patent Register - SPC information for Unitary Patents.

2024-03-06

More...

Extract from the Register of European Patents

EP About this file: EP2761435

EP2761435 - CACHE AND/OR SOCKET SENSITIVE MULTI-PROCESSOR CORES BREADTH-FIRST TRAVERSAL [Right-click to bookmark this link]
Status	The application is deemed to be withdrawn Status updated on 10.01.2020 Database last updated on 20.07.2024
Former	Grant of patent is intended Status updated on 03.04.2019
Former	Examination is in progress Status updated on 20.01.2017
Former	Request for examination was made Status updated on 16.12.2016
Most recent event Tooltip	10.01.2020	Application deemed to be withdrawn	published on 12.02.2020 [2020/07]
Applicant(s)	For all designated states Intel Corporation 2200 Mission College Boulevard Santa Clara, CA 95054 / US
	[N/P]
Former [2014/32]	For all designated states Intel Corporation 2200 Mission College Boulevard Santa Clara, CA 95052 / US
Inventor(s)	01 / SATISH, Nadathur Rajagopalan 700 Agnew Road Apt. 219 Santa Clara, California 95054-4217 / US
	02 / KIM, Changkyu 185 Estancia Drive Unit 433 San Jose, California 95134 / US
	03 / CHHUGANI, Jatin 550 Moreland Way Apt. 5303 Santa Clara, California 95054-5118 / US
	04 / SEWALL, Jason D. 3600 Juliette Lane Santa Clara, California 95054 / US
	[2014/32]
Representative(s)	Goddar, Heinz J. Boehmert & Boehmert Anwaltspartnerschaft mbB Pettenkoferstrasse 22 80336 München / DE
	[N/P]
Former [2014/32]	Goddar, Heinz J. Boehmert & Boehmert Pettenkoferstrasse 20-22 80336 München / DE
Application number, filing date	11873205.6	29.09.2011
	WO2011US54016
Filing language	EN
Procedural language	EN
Publication	Type:	A1 Application with search report
	No.:	WO2013048413
	Date:	04.04.2013
	Language:	EN
	[2013/14]
	Type:	A1 Application with search report
	No.:	EP2761435
	Date:	06.08.2014
	Language:	EN
	The application published by WIPO in one of the EPO official languages on 04.04.2013 takes the place of the publication of the European patent application.
	[2014/32]
Search report(s)	International search report - published on:	KR	04.04.2013
	(Supplementary) European search report - dispatched on:	EP	14.09.2015
Classification	IPC:	G06F9/38, G06F9/06, G06F15/80, G06F13/14, G06F17/10, G06F9/52	[2015/42]
	CPC:	G06F9/52 (EP,US); G06F9/38 (KR); G06F13/14 (KR); G06F9/06 (KR)
	Former IPC [2014/32]	G06F9/38, G06F9/06, G06F15/80, G06F13/14
Designated contracting states	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 [2014/32]
Title	German:	CACHE- UND/ODER SOCKELEMPFINDLICHE MULTIPROZESSORKERN-BREITENSUCHE	[2014/32]
	English:	CACHE AND/OR SOCKET SENSITIVE MULTI-PROCESSOR CORES BREADTH-FIRST TRAVERSAL	[2014/32]
	French:	PARCOURS EN LARGEUR D'ABORD DE MULTIPLES COEURS DE PROCESSEUR SENSIBLE AU CACHE ET/OU À LA PRISE	[2019/18]
	Former [2014/32]	PARCOURS EN LARGEUR D'ABORD DE MULTIPLES C URS DE PROCESSEUR SENSIBLE AU CACHE ET/OU À LA PRISE
Entry into regional phase	20.02.2014	National basic fee paid
	20.02.2014	Search fee paid
	20.02.2014	Designation fee(s) paid
	20.02.2014	Examination fee paid
Examination procedure	20.02.2014	Examination requested [2014/32]
	11.04.2016	Amendment by applicant (claims and/or description)
	19.01.2017	Despatch of a communication from the examining division (Time limit: M06)
	28.07.2017	Reply to a communication from the examining division
	28.02.2018	Despatch of a communication from the examining division (Time limit: M04)
	10.07.2018	Reply to a communication from the examining division
	04.04.2019	Communication of intention to grant the patent
	15.08.2019	Application deemed to be withdrawn, date of legal effect [2020/07]
	20.09.2019	Despatch of communication that the application is deemed to be withdrawn, reason: fee for grant / fee for printing not paid in time [2020/07]
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 19.01.2017
Fees paid	Renewal fee
	20.02.2014	Renewal fee patent year 03
	12.09.2014	Renewal fee patent year 04
	11.09.2015	Renewal fee patent year 05
	13.09.2016	Renewal fee patent year 06
	12.09.2017	Renewal fee patent year 07
	11.09.2018	Renewal fee patent year 08
	Penalty fee
	Additional fee for renewal fee
	30.09.2019	09 M06 Not yet paid
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.
Documents cited:	Search	[IA] - VIRAT AGARWAL ET AL, "Scalable Graph Exploration on Multicore Processors", 2010 ACM/IEEE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS; 13-19 NOV. 2010; NEW ORLEANS, LA, USA, IEEE, PISCATAWAY, NJ, USA, (20101113), ISBN 978-1-4244-7557-5, pages 1 - 11, XP031807797 [I] 1-11 * pages 2-6 * [A] 12-15
		[I] - Aydin Buluc ET AL, "Parallel Breadth-First Search on Distributed Memory Systems", (20110422), URL: http://arxiv.org/abs/1104.4518, (20150902), XP055210793 [I] 12-15 * pages 5-7 * * algorithm 2 *
		[A] - Yinglong Xia ET AL, "TOPOLOGICALLY ADAPTIVE PARALLEL BREADTH-FIRST SEARCH ON MULTICORE PROCESSORS", (20091104), URL: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.154.1740&rep=rep1&type=pdf, (20150901), XP055210527 [A] 1-15 * pages 4-5 * * algorithm 1 *
		[A] - "Intel 64 and IA-32 Architectures Software Developer?s Manual Volume 3 (3A & 3B): System Programming Guide - Chapter 8-1", Intel 64 and IA-32 Architectures Software Developer?s Manual Volume 3 (3A & 3B): System Programming Guide - Chapter 8-1, Intel Corporation, (20110501), XP055210578 [A] 1-15 * section 8.1.1 *
		[AP] - JATIN CHHUGANI ET AL, "Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency", 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, (20120501), doi:10.1109/IPDPS.2012.43, ISSN 1530-2075, ISBN 978-0-76-954675-9, pages 378 - 389, XP055210455 [AP] 1-15 * the whole document * DOI: http://dx.doi.org/10.1109/IPDPS.2012.43
	International search	[A]US2008040553 (ASH KEVIN J [US], et al);
		[A]US7647585 (SUN MINGQIU [US]);
		[A]US7827182 (PANIGRAHY RINA [US])
		[A] - AGARWAL, V. ET AL., "Scalable Graph Exploration on Multicore Processors", 2 010 INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STO RAGE AND ANALYSIS (SC), 13-19 NOVEMBER 2010, (20101113), XP031807797
	by applicant	- AYDIN BULUC ET AL., PARALLEL BREADTH-FIRST SEARCH ON DISTRIBUTED MEMORY SYSTEMS, (2011), URL: http://arxiv.org/abs/1104.4518

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.

Legal notice
Terms of use
24.2.25; 35p