Prototyping parallel algorithms in a set-oriented language:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Hamburg
Kovač
1994
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | VII, 195 Seiten graph. Darst. |
| ISBN: | 3860642022 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009956720 | ||
| 003 | DE-604 | ||
| 005 | 20200504 | ||
| 007 | t | ||
| 008 | 941212s1994 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 942974166 |2 DE-101 | |
| 020 | |a 3860642022 |9 3-86064-202-2 | ||
| 035 | |a (OCoLC)34359037 | ||
| 035 | |a (DE-599)BVBBV009956720 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-188 | ||
| 050 | 0 | |a QA76.642 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Hasselbring, Wilhelm |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Prototyping parallel algorithms in a set-oriented language |c Wilhelm Hasselbring |
| 264 | 1 | |a Hamburg |b Kovač |c 1994 | |
| 300 | |a VII, 195 Seiten |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Dortmund, Univ., Diss. | ||
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Prototyping |0 (DE-588)4205527-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | 1 | |a Prototyping |0 (DE-588)4205527-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006598523&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006598523 | |
Datensatz im Suchindex
| _version_ | 1807502744176558080 |
|---|---|
| adam_text |
CONTENTS
ABSTRACT
VII
1
INTRODUCTION
1
1.1
PROTOTYPING
PARALLEL
ALGORITHMS
.
1
1.2
A
LOOK
AT
SOFTWARE
CONSTRUCTION
.
3
1.2.1
INFORMAL
AND
FORMAL
SPECIFICATIONS
.
3
1.2.2
FORMAL
SPECIFICATIONS
AND
PROTOTYPING
.
6
1.3
OVERVIEW
.
7
1.4
ACKNOWLEDGMENTS
.
7
I
SETTING
9
2
PROTOTYPING
11
2.1
GOALS
OF
PROTOTYPING
.
11
2.2
APPROACHES
TO
PROTOTYPING
.
13
2.3
SUMMARY
.
14
3
PARALLEL
PROGRAMMING
15
3.1
GOALS
OF
PARALLEL
PROGRAMMING
.
15
3.2
APPROACHES
TO
PARALLEL
PROGRAMMING
.
17
3.2.1
DATA
PARALLELISM
.
19
3.2.2
PARALLEL
OBJECT-ORIENTED
PROGRAMMING
.
20
3.2.3
PARALLEL
FUNCTIONAL
PROGRAMMING
.
22
3.2.4
PARALLEL
LOGIC
PROGRAMMING
.
23
3.2.5
UNBOUNDED
NONDETERMINISTIC
ITERATIVE
TRANSFORMATIONS
.
25
3.2.6
MULTISET
TRANSFORMATIONS
.
27
3.2.7
VIRTUAL
SHARED
MEMORY
.
28
3.2.8
THE
SHARED
DATA-OBJECT
MODEL
.
29
3.2.9
GENERATIVE
COMMUNICATION
.
31
3.2.10
EVALUATION
.
35
3.3
SUMMARY
.
40
II
GENERATIVE
COMMUNICATION
IN
SET-ORIENTED
PROTOTYPING
41
4
THE
PROTOTYPING
LANGUAGE
P
RO
S
ET
43
4.1
DATA
STRUCTURES
.
43
4.2
CONTROL
STRUCTURES
.
45
4.3
INTRODUCTORY
EXAMPLES
.
45
4.4
EXCEPTION
HANDLING
.
47
4.5
PERSISTENCE
.
47
4.6
MODULES
.
49
4.7
SUMMARY
.
49
5
INFORMAL
SEMANTICS
OF
PROSST-LINDA
51
5.1
PROCESS
CREATION
.
51
5.2
PROGRAM
AND
PROCESS
TERMINATION
.
53
5.3
HANDLING
MULTIPLE
TUPLE
SPACES
.
54
5.4
TUPLE-SPACE
OPERATIONS
.
55
5.4.1
DEPOSITING
TUPLES
.
55
5.4.2
FETCHING
TUPLES
.
57
5.4.3
MEETING
TUPLES
.
59
5.4.4
NONDETERMINISM
AND
FAIRNESS
WHILE
MATCHING
.
61
5.5
SUMMARY
.
61
6
EXAMPLE
PROGRAMS
63
6.1
A
MASTER-WORKER
APPLICATION
WITH
LIMITED
TUPLE
SPACES
.
63
6.2
THE
QUEENS'
PROBLEM
REVISITED
.
65
6.3
PARALLEL
MATRIX
MULTIPLICATION
.
65
6.4
THE
TRAVELING
SALESMAN
PROBLEM
.
65
6.5
THE
DINMG
PHILOSOPHERS
PROBLEM
.
70
6.6
SUMMARY
.
72
7
DISCUSSION
OF
OTHER
APPROACHES
TO
GENERATIVE
COMMUNICATION
AND
SOME
DESIGN
ALTERNATIVES
73
7.1
SHORTCOMINGS
OF
C-LINDA
.
74
7.2
COMPARISON
OF
P
RO
S
ET
'
S
AND
C-LINDA
'
S
TUPLE-SPACE
OPERATIONS
.
74
7.3
CUSTOMIZED
MATCHING
.
75
7.4
SELECTIVE
MATCHING
.
75
7.5
AGGREGATE
AND
ACCUMULATIVE
MATCHING
.
76
7.6
LIMITED
TUPLE
SPACES
AND
NON-BLOCKING
MATCHING
.
76
7.7
FAIR
MATCHING
.
77
7.8
EXTENDING
THE
TYPE
SYSTEM
FOR
MATCHING
.
78
7.9
FORMATS
AND
TEMPLATES
WITH
FIRST-CLASS
RIGHTS
.
78
II
7.10
UPDATE
OPERATIONS
ON
TUPLES
IN
TUPLE
SPACE
.
79
7.11
PROCESS
CREATION
AND
PROCESS
IDENTITIES
.
79
7.12
MULTIPLE
TUPLE
SPACES
AND
TUPLE-SPACE
IDENTITIES
.
80
7.13
DATA
PARALLELISM
IN
GENERATIVE
COMMUNICATION
.
82
7.14
FAULT-TOLERANCE
.
83
7.15
PERSISTENCE
.
84
7.16
OVERLOADING
PREDEFINED
OPERATORS
.
84
7.17
SUMMARY
.
85
8
FORMAL
SEMANTICS
OF
PROSET-LINDA
87
8.1
BASIC
DEFINITIONS
.
87
8.1.1
ABSTRACTIONS
FOR
THE
EMBEDDING
INTO
THE
COMPUTATION
LANGUAGE
.
87
8.1.2
TYPES
AND
VALUES
.
88
8.1.3
TUPLES
.
89
8.1.4
FORMALS
AND
TEMPLATES
.
90
8.2
MATCHING
.
92
8.3
TUPLE
SPACES
.
92
8.4
PROGRAMS
AND
PROCESSES
.
94
8.5
EXCEPTIONS
.
97
8.6
HANDLING
MULTIPLE
TUPLE
SPACES
.
97
8.6.1
CREATETS
.
98
8.6.2
EXISTSTS
.
99
8.6.3
CLEARTS
.
100
8.6.4
REMOVETS
.
101
8.6.5
THE
TUPLE-SPACE
LIBRARY
.
101
8.7
TUPLE-SPACE
OPERATIONS
.
102
8.7.1
SOME
PRELIMINARY
DEFINITIONS
.
102
8.7.2
DEPOSITING
TUPLES
.
106
8.7.3
FETCHING
TUPLES
.
107
8.7.4
MEETING
TUPLES
.
109
8.7.5
FAIRNESS
OF
THE
TUPLE-SPACE
OPERATIONS
.
ILL
8.8
PROGRAM
EXECUTION
.
112
8.9
SUMMARY
.
113
ILL
IMPLEMENTATION
115
9
REFINING
THE
FORMAL
SPECIFICATION
117
9.1
SEMANTICS
VERSUS
IMPLEMENTATION
DESIGN
.
117
9.2
DATA
REFINEMENT
.
118
9.3
OPERATION
REFINEMENT
.
119
9
3.1
SOME
PRELIMINARY
DEFINITIONS
.
122
9.3.2
DEPOSITING
TUPLES
.
124
9.3.3
FETCHING
TUPLES
.
124
9.3.4
MEETING
TUPLES
.
126
9.4
CORRECTNESS
OF
THE
REFINEMENT
.
126
9.4.1
MODELING
BAGS
BY
SEQUENCES
.
127
9.4.2
SATISFACTION
OF
THE
FAIRNESS
PROPERTIES
.
128
9.5
SUMMARY
.
129
10
A
PROTOTYPE
IMPLEMENTATION
131
10.1
THE
COMPILER
.
131
10.2
THE
TUPLE-SPACE
MANAGEMENT
.
132
10.2.1
HANDLING
MULTIPLE
TUPLE
SPACES
.
132
10.2.2
TUPLE-SPACE
OPERATIONS
.
134
10.3
SUMMARY
.
140
11
SOME
GENERAL
ISSUES
FOR
IMPLEMENTATIONS
OF
PROSET-LINDA
141
11.1
SOME
EXISTING
IMPLEMENTATIONS
OF
LINDA
VARIANTS
.
141
11.2
IMPLEMENTATION
TECHNIQUES
.
142
11.3
OPTIMIZATIONS
.
144
11.3.1
PARTITIONING
THE
TUPLE
SPACE
.
144
11.3.2
IN-PLACE
UPDATES
.
145
11.3.3
HARDWARE
SUPPORT
.
145
11.3.4
DATA
STRUCTURE
SELECTION
.
145
11.4
THE
UNPREDICTABLE
PERFORMANCE
OF
LINDA
.
146
11.5
SUMMARY
.
146
IV
RESUME
AND
OUTLOOK
147
12
RESUME
149
13
OUTLOOK
151
13.1
EXTENDING
MATCHING
TO
UNIFICATION
.
151
13.2
AN
IMPLEMENTATION
OF
A
GRAPHICAL
DEBUGGER
.
152
13.3
AN
IMPLEMENTATION
ON
A
LOCAL
AREA
NETWORK
.
153
13.4
OPTIMIZING
ANALYSIS
OF
TUPLE-SPACE
ACCESS
.
153
IV
V
APPENDICES
155
A
THE
ABSTRACT
GRAMMAR
FOR
THE
TUPLE-SPACE
OPERATIONS
157
B
THE
SPECIFICATION
LANGUAGE
OBJECT-Z
159
B.L
SCHEMAS
.
160
B.2
AXIOMATIC
DESCRIPTIONS
.
161
B.3
GENERIC
DESCRIPTIONS
.
161
B.4
FREE
TYPE
DEFINITIONS
.
161
B.5
EXPRESSIONS
.
162
B.6
CLASSES
.
162
B.7
REMARKS
CONCERNING
THE
USABILITY
OF
Z
AND
OBJECT-Z
.
164
C
TYPES
OF
ALL
NAMES
DEFINED
GLOBALLY
165
INDICES
173
INDEX
OF
FORMAL
DEFINITIONS
.
173
INDEX
OF
EXPLAINED
OBJECT-Z
SYMBOLS
AND
KEYWORDS
.
175
GENERAL
INDEX
.
177
BIBLIOGRAPHY
181 |
| any_adam_object | 1 |
| author | Hasselbring, Wilhelm |
| author_facet | Hasselbring, Wilhelm |
| author_role | aut |
| author_sort | Hasselbring, Wilhelm |
| author_variant | w h wh |
| building | Verbundindex |
| bvnumber | BV009956720 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.642 |
| callnumber-search | QA76.642 |
| callnumber-sort | QA 276.642 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)34359037 (DE-599)BVBBV009956720 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV009956720</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200504</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941212s1994 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">942974166</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3860642022</subfield><subfield code="9">3-86064-202-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34359037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009956720</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.642</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hasselbring, Wilhelm</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Prototyping parallel algorithms in a set-oriented language</subfield><subfield code="c">Wilhelm Hasselbring</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hamburg</subfield><subfield code="b">Kovač</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 195 Seiten</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Dortmund, Univ., Diss.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prototyping</subfield><subfield code="0">(DE-588)4205527-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Prototyping</subfield><subfield code="0">(DE-588)4205527-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006598523&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006598523</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009956720 |
| illustrated | Illustrated |
| indexdate | 2024-08-16T00:42:22Z |
| institution | BVB |
| isbn | 3860642022 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006598523 |
| oclc_num | 34359037 |
| open_access_boolean | |
| owner | DE-739 DE-188 |
| owner_facet | DE-739 DE-188 |
| physical | VII, 195 Seiten graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Kovač |
| record_format | marc |
| spelling | Hasselbring, Wilhelm Verfasser aut Prototyping parallel algorithms in a set-oriented language Wilhelm Hasselbring Hamburg Kovač 1994 VII, 195 Seiten graph. Darst. txt rdacontent n rdamedia nc rdacarrier Zugl.: Dortmund, Univ., Diss. Parallel algorithms Parallel programming (Computer science) Prototyping (DE-588)4205527-1 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Paralleler Algorithmus (DE-588)4193615-2 s Prototyping (DE-588)4205527-1 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006598523&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hasselbring, Wilhelm Prototyping parallel algorithms in a set-oriented language Parallel algorithms Parallel programming (Computer science) Prototyping (DE-588)4205527-1 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| subject_GND | (DE-588)4205527-1 (DE-588)4193615-2 (DE-588)4113937-9 |
| title | Prototyping parallel algorithms in a set-oriented language |
| title_auth | Prototyping parallel algorithms in a set-oriented language |
| title_exact_search | Prototyping parallel algorithms in a set-oriented language |
| title_full | Prototyping parallel algorithms in a set-oriented language Wilhelm Hasselbring |
| title_fullStr | Prototyping parallel algorithms in a set-oriented language Wilhelm Hasselbring |
| title_full_unstemmed | Prototyping parallel algorithms in a set-oriented language Wilhelm Hasselbring |
| title_short | Prototyping parallel algorithms in a set-oriented language |
| title_sort | prototyping parallel algorithms in a set oriented language |
| topic | Parallel algorithms Parallel programming (Computer science) Prototyping (DE-588)4205527-1 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| topic_facet | Parallel algorithms Parallel programming (Computer science) Prototyping Paralleler Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006598523&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hasselbringwilhelm prototypingparallelalgorithmsinasetorientedlanguage |