Patent US2014147A successfully refreshed from Google Patents.
Patent US4875207A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4875207A Expired / Lapsed US ⏱️ 0.0 years remaining

A data processing network with chordal ring factor network

Assignee: US Philips Corp
•
Filing: 1987-01-27
•
Granted: 1989-10-17
•
Expires: 2007-01-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A description is given of a data processing network that is constructed as a product network of two or more factor networks. At least one of the factor networks is a chordal ring of at least five stations, or a generalized chordal ring. A generalized chordal ring is formed by dividing each of the stations in a chordal ring (124, 130, 136) into a number of sub-stations. The sub-stations within a station constitute a homogeneous network. The external connections of a station are divided over the relevant sub-stations. In this way an optimum value for the degree (G) and diameter (D) of the network can be chosen on the basis of a selection strategy.

Inventors

  • 👤 Robert A. H. Van Twist
  • 👤 Franciscus P. M. Hopmans
  • 👤 Eddy A. M. Odijk

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 14:43
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 91 words
A data processing network of degree G≧4 comprising: at least 32 data processing stations, each station connected by bidirectional communications lines to a maximum of G other stations in order to exchange information; said stations arranged as a product network of at least two factor networks; a first one of said factor networks arranged as a chordal ring of degree 4 including at least N≧5 of said stations and characterized by a step size S such that 2≦S≦(N-1)/2; and a second one of said factor networks comprising at least two stations.
Claim 2
Dependent Claim 91 words
A data processing network of degree G≧4 comprising: at least 32 data processing stations, each station connected by bidirectional communications lines to a maximum of G other stations in order to exchange information; said stations arranged as a product network of at least two factor networks; a first one of said factor networks arranged as a chordal ring of degree 4 including at least N≧5 of said stations and characterized by a step size S such that 2≦S≦(N-1)/2; and a second one of said factor networks comprising at least two stations.
Claim 3
Dependent Claim 31 words
A data processing network according to claim 1, comprising means for connecting each of the stations within said chordal ring to a further station within said ring in a homogeneous manner.
Claim 4
Dependent Claim 23 words
A data processing network according to claim 2 in which the second one of said factor networks is constructed as a chordal ring.
Claim 5
Dependent Claim 23 words
A data processing network according to claim 2, comprising at least one further factor network that is constructed as a completely connected network.
Claim 6
Dependent Claim 27 words
A data processing network according to claim 2 comprising at least one other factor network that is built up as a ring of at least four stations.
Claim 7
Dependent Claim 44 words
A data processing network according to any of claims 1 to 4 wherein each station within said first one of said factor networks comprises P interconnected sub-stations and each sub-station is connected to sub-stations within the same station and further sub-stations by R≧2 lines.
Claim 8
Dependent Claim 20 words
A data processing network according to claim 6, wherein within said first one of said factor networks P=2 and R=3.
Claim 9
Dependent Claim 30 words
The data processing network of claim 1 wherein said chordal ring comprises at least N≧6 stations and the degree of said chordal ring is less than or equal to N-2.

References Cited (Backward Citations)

US4466064A Cited
US4644496A Cited
US4580215A Cited
US4672373A Cited
US4742511A Cited
US4736465A Cited
US4720780A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-10-16 1993-04-17 1993-10-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-10-16 1997-04-17 1997-10-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-10-16 2001-04-17 2001-10-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag