Multiple plane network-on-chip with master/slave inter-relationships
US-2015381707-A1 · Dec 31, 2015 · US
Deadlock prevention in direct networks of arbitrary topology
US8964559B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8964559-B2 |
| Application number | US-201313872450-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 29, 2013 |
| Priority date | Dec 21, 2009 |
| Publication date | Feb 24, 2015 |
| Grant date | Feb 24, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Aspects of the invention pertain to routing packets in a computer system while avoiding deadlock. A turn rule is set according to unique identifiers associated with switches in the system. Numeric values of switches in possible turns are compared to determine whether a turn is permissible. The rule applies to all nodes in the system. The rule may be violated when using virtual channels. Here, a violation is permissible when using monotonically increasing virtual channel numbers or monotonically decreasing virtual channel numbers. Alternatively, the violations of the turn rule may be allowed if they force a packet to change to a later virtual channel in some fixed ordering of virtual channels. Deadlock can thus be avoided in many different types of architectures, including mesh, torus, butterfly and flattened butterfly configurations.
First claim
Opening claim text (preview).
The invention claimed is: 1. A method of routing packets in a computer network to avoid deadlock, the method comprising: setting a turn rule for routing packets across the computer network, the turn rule prohibiting sending packets from a first switch (A) to a second switch (C) via an intermediate switch (B) given a value of a distinct identifier of the intermediate switch B in relation to values of distinct identifiers of both first switch A and second switch C; and providing t…
Assignees
Inventors
Classifications
Electricity · mapped topic
- H04L45/06Primary
Electricity · mapped topic
Electricity · mapped topic
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US8964559B2 cover?
- Aspects of the invention pertain to routing packets in a computer system while avoiding deadlock. A turn rule is set according to unique identifiers associated with switches in the system. Numeric values of switches in possible turns are compared to determine whether a turn is permissible. The rule applies to all nodes in the system. The rule may be violated when using virtual channels. Here, a…
- Who is the assignee on this patent?
- Google Inc
- What technology area does this patent fall under?
- Primary CPC classification H04L45/06. Mapped technology areas include Electricity.
- When was this patent published?
- Publication date Tue Feb 24 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).