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.4 required=5.0 tests=BAYES_00,FORGED_MUA_MOZILLA
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,d8f1b8cc3ae401ff,start
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.238.198 with SMTP id vm6mr6237401pbc.3.1328984231733;
        Sat, 11 Feb 2012 10:17:11 -0800 (PST)
Path: 
 wr5ni13155pbc.0!nntp.google.com!news2.google.com!npeer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!post01.iad.highwinds-media.com!newsfe07.iad.POSTED!00000000!not-for-mail
From: Brad Moore <brad.moore@shaw.ca>
User-Agent: Mozilla/5.0 (Windows NT 6.1;
 rv:9.0) Gecko/20111222 Thunderbird/9.0.1
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: ANN: Paraffin 2.4
Message-ID: <HgyZq.14862$DZ1.801@newsfe07.iad>
NNTP-Posting-Host: 184.64.75.84
X-Complaints-To: internet.abuse@sjrb.ca
X-Trace: newsfe07.iad 1328984231 184.64.75.84 (Sat, 11 Feb 2012 18:17:11 UTC)
NNTP-Posting-Date: Sat, 11 Feb 2012 18:17:11 UTC
Date: Sat, 11 Feb 2012 11:17:21 -0700
X-Received-Bytes: 2744
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Date: 2012-02-11T11:17:21-07:00
List-Id: <comp.lang.ada>

Paraffin is a set of Ada 2005 generics that may be used to add
parallelism to iterative loops and recursive code.

Paraffin also includes a suit of useful parallel utilities that
utilize the Paraffin generics. These include generics for;
    1) generic to integrating a function in parallel
    2) generic to apply quicksort algorithm in parallel to an array
    3) generic to apply fast fourier transform to an array of data.
    4) generic Red-Black tree container that performs some operations
       in parallel.
    5) function to solve matrices using Gauss-Jordan Elimination

Paraffin 2.4 modifications include:

-  Added a reusable utility to solve a matrix of linear equations using
    Gauss-Jordan Elimination.
-  Added test_matrix test driver for parallel/sequential matrix solvers
-  Red-Black Tree containers fully implemented now.
      (Delete, and Contains calls work)
-  Split Red-Black Tree container into separate generics
    - Sequential
    - Work sharing
    - Work Seeking
    - Stack Safe Work Seeking
-  The Red Black Tree generic was previously intended mostly as a
    test driver for Paraffin Recursive generics. Now the generic has
    been completed to a state where it can be reused on its own as
    as generic container.
-  Changed use of Unchecked_Conversion for Recurse supprogram access
    to use 'Unrestricted_Access instead. This cleaned the code up
    considerably in this area. One issue to look into, is that
    'Unrestricted_Access is a non-standard attribute. It is supported
    by both GNAT and the ICC compiler however. It may not be supported
    by other Ada 2005 compilers. Unfortunately, Unchecked_Conversion in
    this case is not portable either, and may not even continue to work
    with the existing compilers, so it was thought that using
    'Unrestricted_Access was the best option for now. Will investigate
    to see if there is a possibility for a better solution, or providing
    a portable mechanism in a future version of Ada.