From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=0.6 required=5.0 tests=BAYES_40,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 115aec,5495dac456fa22ef X-Google-Attributes: gid115aec,public X-Google-Thread: 103376,5495dac456fa22ef X-Google-Attributes: gid103376,public From: mok@cs.utexas.edu (Al Mok) Subject: Re: Processor Synchronization Date: 1999/01/22 Message-ID: <78b5g1$ig4$1@dimsum.cs.utexas.edu>#1/1 X-Deja-AN: 435828410 References: <36A509DB.95F62C0B@pwfl.com> X-Complaints-To: usenet@cs.utexas.edu X-Trace: news.cs.utexas.edu 917051714 7376 mok 128.83.120.193 Organization: CS Dept, University of Texas at Austin Newsgroups: comp.lang.ada,comp.realtime Date: 1999-01-22T00:00:00+00:00 List-Id: There is quite a bit on clock synchronization problems in the literature. In my class, I teach Flaviu Cristian's probabilistic algorithm. A reference is: "Probabilistic clock synchronization" in DISTRIBUTED COMPUTING, 3:146-158, 1989. -- Al Mok BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT BEAT THE CENSORBOT In article <36A509DB.95F62C0B@pwfl.com>, Marin David Condic wrote: >I am preparing an in-house class on embedded system executives and I >want to present a comprehensive overview of different designs. One of >the areas I want to cover is processor synchronization. I am looking for >a book or other reference material that discusses techniques for >synchronizing independent processors. Specifically, I am interested in >techniques used when building dual (or multiple) channel systems with >relatively primitive communication between the two channels. (discrete >lines, Manchester data link, etc.) Information pertaining to use of >operating systems (e.g. Unix) and distributed systems may be interesting >but not useful in this case. > >The most general description of the problem domain I can come up with is >this: The problem is at power-up, you have to get both processors >ticking off at the same "heartbeat" so that they have the same frame of >reference. Generally, you're going to have N cycles (frames, slots, >whatever your favorite terminology is) and it is important that both >processors be operating on cycle X at the same time. Once running, the >processors have to detect drift in their cycling and correct for this so >that they continue to both start on the same cycle at the same time. We >have done this sort of thing in-house, but I'm looking for a discussion >of a variety of algorithms and some analysis of the strengths & >weaknesses of each. > >If anybody has a favorite book, article or web-page on this subject, I >would appreciate hearing about it. Thanks. > >MDC >-- >Marin David Condic >Real Time & Embedded Systems, Propulsion Systems Analysis >United Technologies, Pratt & Whitney, Large Military Engines >M/S 731-95, P.O.B. 109600, West Palm Beach, FL, 33410-9600 >Ph: 561.796.8997 Fx: 561.796.4669 >***To reply, remove "bogon" from the domain name.*** > > "Nobody shot me." > > -- Last words of Frank Gusenberg when asked by police who > shot him fourteen times with a machine gun in the Saint > Valentine's Day Massacre. -- Aloysius K. Mok mok@cs.utexas.edu Department of Computer Science University of Texas at Austin "Why?" "Why not?" Austin, Texas 78712 (512)471-9542