The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
May. 26, 2015

Filed:

Jan. 10, 2012
Applicants:

Kenji Funaoka, Kanagawa, JP;

Nobuaki Tojo, Tokyo, JP;

Susumu Takeda, Kanagawa, JP;

Akira Kuroda, Kanagawa, JP;

Hidenori Matsuzaki, Tokyo, JP;

Inventors:

Kenji Funaoka, Kanagawa, JP;

Nobuaki Tojo, Tokyo, JP;

Susumu Takeda, Kanagawa, JP;

Akira Kuroda, Kanagawa, JP;

Hidenori Matsuzaki, Tokyo, JP;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/45 (2006.01);
U.S. Cl.
CPC ...
G06F 8/456 (2013.01);
Abstract

According to an embodiment, based on task border information, and first-type dependency relationship information containing N number of nodes corresponding to data accesses to one set of data, containing edges representing dependency relationship between the nodes, and having at least one node with an access reliability flag indicating reliability/unreliability of corresponding data access; task border edges, of edges extending over task borders, are identified that have an unreliable access node linked to at least one end, and presentation information containing unreliable access nodes is generated. According to dependency existence information input corresponding to the set of data, conversion information indicating absence of data access to the unreliable access nodes is output. According to the conversion information, the first-type dependency relationship information is converted into second-type dependency relationship information containing M number of nodes (0≦M≦N) corresponding to data accesses to the set of data and containing edges representing inter-node dependency relationship.


Find Patent Forward Citations

Loading…