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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,b7ec49c4bcff25e9 X-Google-Attributes: gid103376,public From: "Arthur Schwarz" Subject: Re: Bus Schedules Date: 2000/01/17 Message-ID: #1/1 X-Deja-AN: 574049094 References: <85vaqu$b2a$1@nnrp1.deja.com> X-Priority: 3 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600 X-Complaints-To: newsabuse@supernews.com Organization: Posted via Supernews, http://www.supernews.com X-MSMail-Priority: Normal Newsgroups: comp.lang.ada Date: 2000-01-17T00:00:00+00:00 List-Id: "Ted Dennison" wrote in message news:85vaqu$b2a$1@nnrp1.deja.com... > In article , > "Arthur Schwarz" wrote: > > Anyone know any Ada software which can calculate a > > bus schedule? This includes major/minor frame calculations > > and so on. > > That sounds like it would make a really good programming assignment for > students. > > -- > T.E.D. > > http://www.telepath.com/~dennison/Ted/TED.html > Your probably right. I just happen to be the student :-( I've seen 1553-bus I/F source code on one of the public sites (PAL?) and thought to save some work by getting software for fixed scheduling. Maybe not. Well, maybe you can help me with the algorithm. Some of the requirements (or objectives) are listed below. I've thought about using dynamic programming (for some), maybe Integer programming, and certainly a branch and bound algorithm should work since the simplist form of the problem is the same as the 0-1 knapsack. Any ideas? The objectives are (in what I think is increasing difficulty): [1] Variable size Minor/Major Frames. All messages are untagged, message slots within a Minor Frame are fixed, and Minor Frames dense (no slack bits). n-Minor Frames / Major Frame. [2] Fixed sized Minor Frames. Packing to achieve message repetition rates, Minor Frame size optimized for throughput. All Minor Frames fixed size and slack bits minimized. [3] Tagged messages. Minor Frames contain a fixed number of messages slots of fixed size. Each message slot in a Minor Frame has a set of possible messages which can 'fit'. Each message distinguished by their tag. The constituent message sets and message set distributions per Major Frame needs to be defined. [4] System performance optimization. Given a command (out message) and a response (in message) place responses in in-messages in such a way that total system latency is reduced. And of course there are binary channels, and turn-around latency issues, inter-frame latencies, error frames, and a host of other issues TBD after the above. Any ideas? Thanks Ted. art schwarza@gdls.com