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,1356f4179c1e4ef4 X-Google-Attributes: gid103376,public From: brashear@ns1.sw-eng.falls-church.va.us (Philip Brashear) Subject: Re: ADA task Date: 1996/09/12 Message-ID: <518ucf$jsu@ns1.sw-eng.falls-church.va.us>#1/1 X-Deja-AN: 180141280 references: <5174qu$o1p@nr1.ottawa.istar.net> organization: CTA INCORPORATED newsgroups: comp.lang.ada Date: 1996-09-12T00:00:00+00:00 List-Id: In article <5174qu$o1p@nr1.ottawa.istar.net>, Roumen Roupski 2. What is overhead of running an ADA task, memory usage, task creation >time, and task-switching overhead? Is there any practical limit for maximum >number of simultaneously running tasks? Answers to this sort of question are completely dependent on the compiler, hardware, OS, etc. (the "implementation"). The best measuring device available for general use is the Ada Compiler Evaluation System (ACES), freely available via anonymous FTP at sw-eng.falls-church.va.us, directory public/AdaIC/testing/aces or by WWW at http://sw-eng.falls-church.va.us/AdaIC/testing/aces/ My group can provide consultation and ACES-related services, if desired. Sincerely, Phil Brashear CTA INCORPORATED 5100 Springfield Pike, Suite 100 Dayton, OH 45431 (513) 258-0831 brashear.cta@juno.com brashear@sw-eng.falls-church.va.us