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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.182.246.168 with SMTP id xx8mr3151831obc.24.1432816037495; Thu, 28 May 2015 05:27:17 -0700 (PDT) X-Received: by 10.140.95.135 with SMTP id i7mr33639qge.27.1432816037389; Thu, 28 May 2015 05:27:17 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.glorb.com!peer03.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!m20no659457iga.0!news-out.google.com!4ni85qgh.1!nntp.google.com!z60no4272749qgd.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Thu, 28 May 2015 05:27:17 -0700 (PDT) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=50.111.113.95; posting-account=Ies7ywoAAACcdHZMiIRy0M84lcJvfxwg NNTP-Posting-Host: 50.111.113.95 References: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com> <7d56e720-5e91-4950-b4ae-29d7ddbdc11a@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: longest path through a task From: brbarkstrom@gmail.com Injection-Date: Thu, 28 May 2015 12:27:17 +0000 Content-Type: text/plain; charset=ISO-8859-1 X-Received-Bytes: 2117 X-Received-Body-CRC: 3907312676 Xref: news.eternal-september.org comp.lang.ada:26030 Date: 2015-05-28T05:27:17-07:00 List-Id: There are well-known algorithms for computing schedules. I'd recommend Sedgewick, R. and Wayne, K., 2011: Algorithms, Fourth Edition, Addison- Wesley, Upper Saddle River, NJ. What you want should emerge from a Critical Path Method (or PERT) algorithm as the time on the critical path, which is the longest time through the job network. The classic, single core (non-threaded) algorithm is covered on pp. 574-584. The "parallel precedence- constrained scheduling" algorithm starts on p. 663. The algorithms in this book use Java, but they should be fairly easy to translate to Ada. This book's algorithms are noted for being concise - and even elegant. This approach is probably not quite as easy as trying to find a package that already contains what you're looking for (you hope). However, when you get done, you'll understand the pieces better and know where the weaknesses are. Bruce B.