A method for synchronizing a service clock at a destination node with a service clock at a source node is provided. The method includes receiving data packets from a source node at at least one port of the destination node. At the destination node, the method determines control values for a numerically controlled oscillator for a plurality of time periods. The method selectively uses the control values to set the frequency of a service clock at the destination node for use in receiving data packets.
Jonathan Belk - Richardson TX, US Richard Nichols - Richardson TX, US
Assignee:
ADC Telecommunications, Inc. - Eden Prairie MN
International Classification:
H04J 3/06
US Classification:
370516000
Abstract:
A method for controlling a local clock in a node coupled to a packet network is disclosed. The method involves generating a first control signal based on RTS values received during a first period of time and generating at least one additional control signal based on RTS values received during at least one additional period of time. The method further involves selecting one of the first and at least one additional control signals to control the frequency of a local clock.
Adaptive Clock Recovery For Circuit Emulation Service
Richard A. Nichols - Richardson TX Jonathan R. Belk - Richardson TX
Assignee:
ADC Telecommunications, Inc. - Eden Prairie MN
International Classification:
H04L 1228
US Classification:
37039562, 370518, 370503, 370474
Abstract:
The present invention includes a method for clock recovery in a packet network. The method includes a network which receives data packets at a destination node. Then the data packets are stored in a buffer. The data packets are read out of the buffer by using a locally generated clock. The fill level of the buffer is monitored over a first period of time. A relative maximum fill level for the buffer is identified during the first period of time. Further, the relative maximum fill level is used to control the frequency of the locally generated clock so as to control the rate at which data is read out of the buffer.
- Redmond WA, US Mattheus C. HEDDES - Woodinville WA, US Deepak GOEL - San Jose CA, US Jonathan R. BELK - McKinney TX, US
International Classification:
G06N 3/08 G06N 20/00 G06F 9/38 H04L 29/08
Abstract:
Embodiments of the present disclosure include techniques for processing neural networks. Various forms of parallelism may be implemented using topology that combines sequences of processors. In one embodiment, the present disclosure includes a computer system comprising a plurality of processor groups, the processor groups each comprising a plurality of processors. A plurality of network switches are coupled to subsets of the plurality of processor groups. A subset of the processors in the processor groups may be configurable to form sequences, and the network switches are configurable to form at least one sequence across one or more of the plurality of processor groups to perform neural network computations. Various alternative configurations for creating Hamiltonian cycles are disclosed to support data parallelism, pipeline parallelism, layer parallelism, or combinations thereof.
- Redmond WA, US Mattheus C. HEDDES - Woodinville WA, US Jonathan R. BELK - McKinney TX, US
International Classification:
H04Q 11/00 G06N 3/02
Abstract:
Embodiments of the present disclosure include techniques for processing neural networks. Various forms of parallelism may be implemented using topology that combines sequences of processors. In one embodiment, the present disclosure includes a computer system comprising one or more processor groups, the processor groups each comprising a plurality of processors. A plurality of network switches are coupled to subsets of the plurality of processor groups. In one embodiment, the switches may be optical network switches. Processors in the processor groups may be configurable to form sequences, and the network switches are configurable to form at least one sequence across one or more of the plurality of processor groups to perform neural network computations. Various alternative configurations for creating Hamiltonian cycles are disclosed to support data parallelism, pipeline parallelism, layer parallelism, or combinations thereof.
Nov 2011 to Present Alliance Driver ManagerFFE Transportation Lancaster, TX Apr 2011 to Oct 2011 Driver ManagerClay Cooley Nissan Dallas, TX Jan 2010 to Apr 2011 Internet Sales ManagerWerner Enterprises Omaha, NE Apr 2004 to Aug 2009 Freight Transport Specialist
Education:
Tarrant County Community College Arlington, TX May 2012 AAS in Business ManagementHarker Heights High School Harker Heights, TX 2001
Skills:
Microsoft Office, Microsoft Excel, AS 400, Peoplenet, Qualcomm, and Driver Management
Youtube
The Dark Trinity in America EXPOSED // Jonath...
Is it possible that behind what is taking place in America and the wor...
Duration:
57m 59s
Jonathan Cahn: The Mysteries of God & His Wil...
Jonathan Cahn sits down with Matt and Laurie Crouch on TBN's praise. I...
Duration:
44m 7s
Fundraiser for 18-year Tampa Police veteran
Corporal Jonathan Belk works in Tampa Police Department's District Thr...
Duration:
1m 38s
What Has Possessed America? Rabbi Jonathan Ca...
Over the past 60 years, we've witnessed a perpetual decline of moral a...
Duration:
28m 54s
Real Estate Cash Flow and Tax Tips w/Josh Belk
Real Estate Cash Flow and Tax Tips w/Josh Belk and Jim Ingersoll. Are ...
Duration:
31m 47s
Prophetic Warnings | Rabbi Jonathan Cahn
How do current events warn of a judgment to come? Rabbi Jonathan Cahn ...