DEVELOPMENT AND COMPARISON OF PARALLEL ALGORITHMS FOR SOLVING LINEAR SYSTEMS
Abstract
THE OBJECTIVE OF THE THESIS IS THE DEVELOPMENT AND COMPARISON OF PARALLEL ALGORITHMS FOR THE SOLUTION OF LINEAR SYSTEMS ON MIMD MACHINES. SPECIFICALLY THE IMPLEMENTATION OF THE CLASSIC DIRECT METHODS GAUSSIAN ELIMINATION (GE), GAUSS-JORDAN (GJ) AND HUARD (HU) AS WELL AS THE FACTORIZATION METHODS LU AND WZ ARECONSIDERED FOR SHARED MEMORY MIMD MACHINES. BY CONSIDERED LOOP UNROLLING TECHNIQUES, DIFFERENT VERSIONS OF THE SAME SEQUENTIAL ALGORITHM ARE PRODUCED AND ARE STUDIED IN DETAIL. MOTIVATED BY THE FACT OF REVEALING THE HIGHEST DEGREE OFPARALLELISM WHICH MIGHT EXIST IN A CERTAIN ALGORITHM WE ATTEMPT DIFFERENT SELECTION STRATEGIES FOR SPECIFYING THE INDEPENDENT TASKS IN THE ABOVE ALGORITHMSNEXT, THE TASK GRAPH IS FORMED WHICH IS DERIVED BY THE PRECEDENCE CONSTRAINTSIMPOSED BY THE FLOW OF THE SEQUENTIAL ALGORITHMS. THE DEVELOPMENT OF GOOD HEURISTIC (OR OPTIMAL) SCHEDULING ALGORITHMS RESPECTING THE PRECEDENCE CONSTRAINTS OF THE TASK GRAPH IS ALSO CONSIDERED. FOR THE DIFFERENT ...
show more
This thesis is not yet available online |
|
Usage statistics
VIEWS
Concern the unique Ph.D. Thesis' views for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
ONLINE READER
Concern the online reader's opening for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
DOWNLOADS
Concern all downloads of this Ph.D. Thesis' digital file.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.
USERS
Concern all registered users of National Archive of Ph.D. Theses who have interacted with this Ph.D. Thesis. Mostly, it concerns downloads.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.