Home
Browse All
DRL Collection Development Policy
Links to non-OHSU Collections
OHSU Campus Building Names
Digital Collections Blog
Log in
|
Help
Search
Advanced Search
Find results with:
error div
Add another field
Search by date
from
after
before
on
to
Searching collections:
Student Scholar Archive
Add or remove collections
Home
Automatic program restructuring for distributed memory multicomputers
Reference URL
To link to this object, paste this link in email, IM or document
To embed this object, paste this HTML in website
Automatic program restructuring for distributed memory multicomputers
View Description
Download
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
2344821542007_199204.ikei.mitsuru.pdf
Description
Rights
http://www.ohsu.edu/xd/education/library/services/theses-dissertations/rights-statement.cfm
Title
Automatic
program
restructuring
for
distributed
memory
multicomputers
Creator.PersonalName
Ikei
,
Mitsuru
Thesis.Degree
M.S.
Thesis.Major
Computer Science and Engineering
Thesis.DateDegreeAwarded
April
1992
Institution
Oregon Graduate Institute of Science & Technology
Department
Dept. of Computer Science and Engineering
Thesis.Advisor/Mentor
Wolfe, Michael J.
Thesis.Committee
Otto, Steve W.
Li, Jingke
Subject.LCSH
Electronic data processing -- Distributed processing
Multiprocessors
Parallel computers
Call Number
Q183.5.OGI I434 1992
Description.Abstract
To
compile
a
Single
Program
Multiple
Data
(SPMD)
program
for a
Distributed
Memory
Multicomputer
(DMMC)
,
we
need
to
find
data
that
can
be
processed
in
parallel
in the
program
and
we
need
to
distribute
the
data
among
processors
such
that the
interprocessor
communication
becomes
reasonably
small
.
Loop
restructuring
is
needed
for
finding
parallelism
in
imperative
programs
and
array
alignment
is
one
effective
step
to
reduce
interprocessor
communication
caused
by
array
references
.
Automatic
conversion
of
imperative
programs
using
these
two
program
restructuring
steps
has been
implemented
in the
Tiny
loop
restructuring
tool
. The
restructuring
strategy
is
derived
by
translating
the
way
that the
compiler
uses
for the
functional
language
Crystal
, to the
imperative
language
Tiny
.
Although
an
imperative
language
can
have
more
varied
loop
structures
than a
functional
language
and
it
is
more
difficult
to
select
the
optimal
one
,
we
can
get
a
loop
structure
which
is
comparable
to
Crystal
.
We
also
can
find
array
alignment
preference
(temporal
+
spatial)
relations
in a
Tiny
source
program
and
add
a
new
construct
, the
align
statement
, to
Tiny
to
express
the
array
alignment
preferences
. In this
thesis
,
we
discuss
these
program
restructuring
strategies
which
we
used
for
Tiny
by
comparison
with
Crystal
.
Language
eng
Type
Text
Format.Use
Needs Adobe Acrobat Reader to view.
Format.FileType
pdf
Format.FileSize
1727.155 KB
OCLC number
26037681
you wish to report:
Your comment:
Your Name:
Submit
Cancel
...
Back to top
Select the collections to add or remove from your search
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Select All Collections
B
Beauty of the PNW Collection
C
Campus Collection
Classic Article Collection
Clinical Outcomes Research Initiative (CORI)
CSETech
F
FDA Drug Approval Documents
N
Naturopathic Medicine Historical Collection
O
OHSU Historical Collections & Archives
OHSU Oral History Collection
S
Student Scholar Archive
500
You have selected:
1
OK
Cancel