TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
Bob Collins <[log in to unmask]>
Reply To:
Bob Collins <[log in to unmask]>
Date:
Sun, 19 Nov 2000 09:21:46 -0500
Content-Type:
text/plain
Parts/Attachments:
text/plain (17 lines)
I wrote a brief article in Ada Letters (Volume XVIII,
Number 4 [July/August 1998], pages 107-110) that
describes a tasking/protected object solution to
the sieve problem. Each prime number was a task
ands the integers being examined were a protected
array. The purpose of the implementation was to
introduce graduate students to a real high-level
multi-processing programming language. They also
had to implement the sieve in John Backus's FP as
well as Prolog.

Tasks were originally used for the sieve to test
dynamic loading of large-scale multi-processing
computers.

                                    Bob Collins

ATOM RSS1 RSS2