Mapping symbolic programs with dynamic tree structure to parallel machines:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
München ; Wien
Oldenbourg
1996
|
| Schriftenreihe: | GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte
265 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 245 S. Ill. |
| ISBN: | 3486239627 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010967101 | ||
| 003 | DE-604 | ||
| 005 | 20160128 | ||
| 007 | t | ||
| 008 | 960916s1996 gw a||| m||| 00||| ger d | ||
| 016 | 7 | |a 947960317 |2 DE-101 | |
| 020 | |a 3486239627 |c kart. : ca. DM 70.00, ca. sfr 61.00, ca. S 518.00 |9 3-486-23962-7 | ||
| 035 | |a (OCoLC)37125089 | ||
| 035 | |a (DE-599)BVBBV010967101 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-739 |a DE-12 |a DE-19 |a DE-83 |a DE-11 |a DE-525 | ||
| 050 | 0 | |a QA1 | |
| 084 | |a SI 210 |0 (DE-625)143104: |2 rvk | ||
| 084 | |a DAT 773d |2 stub | ||
| 084 | |a DAT 325d |2 stub | ||
| 084 | |a DAT 516d |2 stub | ||
| 084 | |a DAT 706d |2 stub | ||
| 100 | 1 | |a Sodan, Angela |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Mapping symbolic programs with dynamic tree structure to parallel machines |c Angela Sodan |
| 264 | 1 | |a München ; Wien |b Oldenbourg |c 1996 | |
| 300 | |a 245 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte |v 265 | |
| 502 | |a Zugl.: Berlin, Tech. Univ., Diss.,1996 | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence |x Data processing | |
| 650 | 4 | |a COMMON LISP (Computer program language) | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 0 | 7 | |a LISP |0 (DE-588)4035918-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Strukturbaum |0 (DE-588)4183789-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelrechner |0 (DE-588)4173280-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Objektorientierte Programmierung |0 (DE-588)4233947-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fuzzy-Menge |0 (DE-588)4061868-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dynamik |0 (DE-588)4013384-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmtransformation |0 (DE-588)4263654-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Symbolic programming language |0 (DE-588)4184193-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 0 | 1 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 2 | |a Programmtransformation |0 (DE-588)4263654-1 |D s |
| 689 | 0 | 3 | |a Fuzzy-Menge |0 (DE-588)4061868-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Parallelrechner |0 (DE-588)4173280-7 |D s |
| 689 | 1 | 1 | |a Symbolic programming language |0 (DE-588)4184193-1 |D s |
| 689 | 1 | 2 | |a Strukturbaum |0 (DE-588)4183789-7 |D s |
| 689 | 1 | 3 | |a Dynamik |0 (DE-588)4013384-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 689 | 3 | 0 | |a Objektorientierte Programmierung |0 (DE-588)4233947-9 |D s |
| 689 | 3 | |8 2\p |5 DE-604 | |
| 689 | 4 | 0 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |D s |
| 689 | 4 | |8 3\p |5 DE-604 | |
| 689 | 5 | 0 | |a LISP |0 (DE-588)4035918-9 |D s |
| 689 | 5 | |8 4\p |5 DE-604 | |
| 689 | 6 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 6 | |8 5\p |5 DE-604 | |
| 830 | 0 | |a GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte |v 265 |w (DE-604)BV010701409 |9 265 | |
| 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=007337704&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007337704 | |
Datensatz im Suchindex
| _version_ | 1807505535108382720 |
|---|---|
| adam_text |
VIII
CONTENTS
PREFACE
.
V
PREFACE
OF
AUTHOR
.VI
ACKNOWLEDGMENTS
.
VII
TABLE
OF
CONTENTS
.
VIII
1
INTRODUCTION,
PROBLEM
DESCRIPTION,
AND
MOTIVATION
.
1
1.1
THE
PROBLEMS
IN
PARALLEL
SYMBOLIC
PROCESSING
AND
WHY
WE
FOCUS
ON
MAPPING
DYNAMIC
TREE-LIKE
PROCESS
STRUCTURES
.
1
1.2
THE
NEED
FOR
IMPROVING
SOLUTIONS
TO
THE
PROBLEM
OF
MAPPING
DYNAMIC
TREES
AND
THE
APPROACH
ADOPTED
.
4
1.3
HOW
THE
THESIS
IS
ORGANIZED
.
7
2
BEHAVIOR
CHARACTERISTICS
OF
SYMBOLIC
PROGRAMS
.
9
2.1
OVERALL
PROGRAM
STRUCTURE
.
9
2.2
GENERAL
CHARACTERISTICS
OF
SYMBOLIC
PROCESSING
.
10
2.3
CHARACTERISTICS
OF
TREE-SEARCH
PROBLEMS
.
12
2.4
BASIC
CHARACTERISTICS
OF
TREE-LIKE
BEHAVIOR
.
19
2.5
SUMMARY
.
22
3
THE
HARDWARE
AND
SOFTWARE
ENVIRONMENT
.
23
3.1
THE
MANNA
MACHINE
.
23
3.2
PEACE
OPERATING
SYSTEM
.
24
3.3
VSM
.
25
3.4
PARLISP
.
26
3.5
MULTIPROCESSING
.
28
3.6
SUMMARY
.
30
4
OUTLINE
OF
OUR
MAPPING
APPROACH
.
32
4.1
PARTITIONING
AND
ASSIGNMENT
.
32
4.2
PROVIDING
AN
ENVIRONMENT
.
33
4.3
BEHAVIOR
CHARACTERISTICS
-
THEIR
EXPLOITATION
AND
SUPPORT
USING
A
SET
OF
STRAT
EGIES
AND
APPROPRIATE
SELECTION
AND
PARAMETERIZATION
TECHNIQUES
.
37
4.4
SEMI-AUTOMATIC
CONFIGURATION
.
39
IX
4.5
AN
EXCURSION
INTO
THE
PARALLELIZATION
OF
SEQUENTIAL
PROGRAMS
.
40
4.6
SUMMARY
.
41
5
LANGUAGE
SUPPORT
FOR
MAPPING
.
43
5.1
DYNAMIC
GROUPING
OF
PARALLEL
PROCESSES
.
43
5.2
CREATION
GROUPS
AND
TASK
ATTACHMENT
.
44
5.3
SYNCHRONIZATION
GROUPS
.
47
5.4
EXTENSIONS
FOR
SEMI-STATIC
MAPPING
AND
ADVANCED
SUPPORT
FOR
SPECULATIVE
PARALLELISM
.
48
5.5
IMPLEMENTATION
.
51
5.6
SUMMARY
.
52
6
SYSTEM
AND
APPLICATION
MODELS
.
53
6.1
SYSTEM
MODEL
.
53
6.2
APPLICATION
MODEL
.
57
6.3
SUMMARY
.
65
7
GRANULARITY
CONTROL
.
66
7.1
GENERAL
TASKS
AND
DEFINITIONS
.
66
7.2
DETERMINING
A
DEPENDENCE
CRITERION
.
69
7.3
DYNAMIC
GRANULARITY-CONTROL
STRATEGIES
AND
SYSTEM-ASSIGNED
PRIORITIES
.
77
7.4
CLASSES
OF
THE
RELATIVE
DEGREE
OF
PARALLELISM
.
78
7.5
SUMMARY
.
82
8
DYNAMIC
LOAD
BALANCING
AND
SCHEDULING
.
85
8.1
DYNAMIC
LOAD
BALANCING
.
85
8.2
SCHEDULING
.
93
8.3
SUMMARY
.
99
9
EXTRACTING
AND
EVALUATING
DYNAMIC
BEHAVIOR
INFORMATION
.
103
9.1
EXTRACTION
.
103
9.2
EVALUATION
.
108
9.3
SUMMARY
.
109
X
10
COST
FUNCTIONS
FOR
ESTIMATING
PERFORMANCE
.
ILL
10.1
CONTEXT
AND
SITUATIONS
CONSIDERED
.
ILL
10.2
COST
FUNCTION
FOR
THE
CASE
OF
"LOW
PARALLELISM"
.
112
10.3
COST
FUNCTION
FOR
THE
CASE
OF
"MEDIUM
PARALLELISM"
.
116
10.4
COST
FUNCTION
FOR
THE
CASE
OF
"HIGH
PARALLELISM"
.
118
10.5
ESTIMATION
OF
THE
NUMBER
OF
TASKS
MOVED
.
123
10.6
BOUNDARY
BETWEEN
MEDIUM
AND
HIGH
PARALLELISM
.
125
10.7
SUMMARY
.
129
11
CONFIGURATION:
SELECTION
AND
PARAMETERIZATION
.
130
11.1
THE
OVERALL
CONFIGURATION
APPROACH
.
130
11.2
GRANULARITY
CONFIGURATION
ALGORITHM
.
135
11.3
APPLICATION
OF
RULES
AND
PRE-SELECTION
OF
STRATEGIES
.
136
11.4
SUMMARY
.
137
12
EXPERIMENTAL
RESULTS
.
138
12.1
EXAMPLE
DEMONSTRATING
OUR
MAPPING
APPROACH
.
138
12.2
INVESTIGATIONS
OF
OTHER
SMALL
PROBLEMS
.
147
12.3
BOYER-MOORE
THEOREM
PROVER
.
151
12.4
FURTHER
REMARKS
ON
TEST
EXAMPLES
.
159
12.5
SYNTHETIC
APPLICATION
FOR
TESTING
CONCEPTS
.
160
12.6
SUMMARY
.
170
13
COMPARISON
WITH
OTHER
RESEARCH
.
171
14
SUMMARY,
DISCUSSION,
AND
FUTURE
WORK
.
177
14.1
SUMMARY
.
177
14.2
DISCUSSION
.
180
14.3
FUTURE
WORK
.
181
14.4
OUR
MAIN
CONTRIBUTION
TO
RESEARCH
.
183
LITERATURE
.
184
APPENDIX
A
PARLISP
-
BASIC
LANGUAGE
FEATURES
.
198
APPENDIX
B
ADVANCED
LANGUAGE
FEATURES
RELATING
TO
MAPPING
.
201
XI
APPENDIX
C
COST
PARAMETERS
.
206
C.
1
BASIC
COST
PARAMETERS
ON
MANNA
.
206
C.2
VSM
VERSUS
CODING/DECODING
.
207
C.3
COST
PARAMETERS
FOR
DYNAMIC
LOAD
BALANCING
.
209
C.4
COST
PARAMETERS
FOR
SIMULATION
OF
"ACTIVE"
MESSAGES
.
209
C.5
COST
PARAMETERS
FOR
SIMULATION
OF
SHARED-MEMORY
SYSTEM
.
210
C.6
SIMULATED
DYNAMIC
LOAD-BALANCING
STRATEGIES
.
210
C.7
LEVEL
CHARACTERISTIC,
MINIMUM
GRANULARITIES
AND
LOAD-SERVING
RATE
FOR
SYNTHETIC
APPLICATION
.
212
APPENDIX
D
DETAILS
OF
SYSTEM
MODEL
.
215
D.
1
COMMUNICATION
TIME
.
215
D.2
MULTIPROCESSING,
GARBAGE
COLLECTION,
AND
DYNAMIC
LOAD
BALANCING
.
219
D.3
THE
INFLUENCE
OF
GARBAGE
COLLECTION
.
224
APPENDIX
E
FURTHER
RESULTS
FROM
EXPERIMENTS
.
226
E.
1
MOVED
TASKS
IN
TESTS
WITH
T
=
10
MSEC
.
226
E.2
TESTS
WITH
T
=
1
MSEC
.
227
E.3
ADDITIONAL
RESULTS
FOR
LEAF
PARTITIONINGS
.
231
APPENDIX
F
FORMAL
DEFINITION
OF
RULES
.
232
F.
1
RULES
FOR
GRANULARITY
CONTROL,
DYNAMIC
LOAD
BALANCING,
AND
SCHEDULING
.
233
F.2
SUMMARY
OF
CONSIDERED
STRATEGIES
.
238
F.3
SUMMARY
AND
DEFINITION
OF
PREDICATES
.
242 |
| any_adam_object | 1 |
| author | Sodan, Angela |
| author_facet | Sodan, Angela |
| author_role | aut |
| author_sort | Sodan, Angela |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV010967101 |
| callnumber-first | Q - Science |
| callnumber-label | QA1 |
| callnumber-raw | QA1 |
| callnumber-search | QA1 |
| callnumber-sort | QA 11 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SI 210 |
| classification_tum | DAT 773d DAT 325d DAT 516d DAT 706d |
| ctrlnum | (OCoLC)37125089 (DE-599)BVBBV010967101 |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010967101</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160128</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1996 gw a||| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947960317</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3486239627</subfield><subfield code="c">kart. : ca. DM 70.00, ca. sfr 61.00, ca. S 518.00</subfield><subfield code="9">3-486-23962-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37125089</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010967101</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">ger</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-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-525</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 210</subfield><subfield code="0">(DE-625)143104:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 773d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 325d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sodan, Angela</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mapping symbolic programs with dynamic tree structure to parallel machines</subfield><subfield code="c">Angela Sodan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München ; Wien</subfield><subfield code="b">Oldenbourg</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">245 S.</subfield><subfield code="b">Ill.</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="490" ind1="1" ind2=" "><subfield code="a">GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte</subfield><subfield code="v">265</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Berlin, Tech. Univ., Diss.,1996</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMMON LISP (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Strukturbaum</subfield><subfield code="0">(DE-588)4183789-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Objektorientierte Programmierung</subfield><subfield code="0">(DE-588)4233947-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fuzzy-Menge</subfield><subfield code="0">(DE-588)4061868-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dynamik</subfield><subfield code="0">(DE-588)4013384-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Symbolic programming language</subfield><subfield code="0">(DE-588)4184193-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</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">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Fuzzy-Menge</subfield><subfield code="0">(DE-588)4061868-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Symbolic programming language</subfield><subfield code="0">(DE-588)4184193-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Strukturbaum</subfield><subfield code="0">(DE-588)4183789-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Dynamik</subfield><subfield code="0">(DE-588)4013384-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Objektorientierte Programmierung</subfield><subfield code="0">(DE-588)4233947-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte</subfield><subfield code="v">265</subfield><subfield code="w">(DE-604)BV010701409</subfield><subfield code="9">265</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=007337704&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007337704</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010967101 |
| illustrated | Illustrated |
| indexdate | 2024-08-16T01:26:43Z |
| institution | BVB |
| isbn | 3486239627 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007337704 |
| oclc_num | 37125089 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-12 DE-19 DE-BY-UBM DE-83 DE-11 DE-525 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-12 DE-19 DE-BY-UBM DE-83 DE-11 DE-525 |
| physical | 245 S. Ill. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Oldenbourg |
| record_format | marc |
| series | GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte |
| series2 | GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte |
| spelling | Sodan, Angela Verfasser aut Mapping symbolic programs with dynamic tree structure to parallel machines Angela Sodan München ; Wien Oldenbourg 1996 245 S. Ill. txt rdacontent n rdamedia nc rdacarrier GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte 265 Zugl.: Berlin, Tech. Univ., Diss.,1996 Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing COMMON LISP (Computer program language) Parallel processing (Electronic computers) LISP (DE-588)4035918-9 gnd rswk-swf Logische Programmierung (DE-588)4195096-3 gnd rswk-swf Strukturbaum (DE-588)4183789-7 gnd rswk-swf Parallelrechner (DE-588)4173280-7 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Objektorientierte Programmierung (DE-588)4233947-9 gnd rswk-swf Fuzzy-Menge (DE-588)4061868-7 gnd rswk-swf Künstliche Intelligenz (DE-588)4033447-8 gnd rswk-swf Dynamik (DE-588)4013384-9 gnd rswk-swf Programmtransformation (DE-588)4263654-1 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Symbolic programming language (DE-588)4184193-1 gnd rswk-swf Funktionale Programmierung (DE-588)4198740-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Logische Programmierung (DE-588)4195096-3 s Parallelverarbeitung (DE-588)4075860-6 s Programmtransformation (DE-588)4263654-1 s Fuzzy-Menge (DE-588)4061868-7 s DE-604 Parallelrechner (DE-588)4173280-7 s Symbolic programming language (DE-588)4184193-1 s Strukturbaum (DE-588)4183789-7 s Dynamik (DE-588)4013384-9 s Funktionale Programmierung (DE-588)4198740-8 s 1\p DE-604 Objektorientierte Programmierung (DE-588)4233947-9 s 2\p DE-604 Künstliche Intelligenz (DE-588)4033447-8 s 3\p DE-604 LISP (DE-588)4035918-9 s 4\p DE-604 Datenstruktur (DE-588)4011146-5 s 5\p DE-604 GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte 265 (DE-604)BV010701409 265 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007337704&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Sodan, Angela Mapping symbolic programs with dynamic tree structure to parallel machines GMD-Forschungszentrum Informationstechnik <Sankt Augustin>: GMD-Berichte Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing COMMON LISP (Computer program language) Parallel processing (Electronic computers) LISP (DE-588)4035918-9 gnd Logische Programmierung (DE-588)4195096-3 gnd Strukturbaum (DE-588)4183789-7 gnd Parallelrechner (DE-588)4173280-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Objektorientierte Programmierung (DE-588)4233947-9 gnd Fuzzy-Menge (DE-588)4061868-7 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd Dynamik (DE-588)4013384-9 gnd Programmtransformation (DE-588)4263654-1 gnd Datenstruktur (DE-588)4011146-5 gnd Symbolic programming language (DE-588)4184193-1 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| subject_GND | (DE-588)4035918-9 (DE-588)4195096-3 (DE-588)4183789-7 (DE-588)4173280-7 (DE-588)4075860-6 (DE-588)4233947-9 (DE-588)4061868-7 (DE-588)4033447-8 (DE-588)4013384-9 (DE-588)4263654-1 (DE-588)4011146-5 (DE-588)4184193-1 (DE-588)4198740-8 (DE-588)4113937-9 |
| title | Mapping symbolic programs with dynamic tree structure to parallel machines |
| title_auth | Mapping symbolic programs with dynamic tree structure to parallel machines |
| title_exact_search | Mapping symbolic programs with dynamic tree structure to parallel machines |
| title_full | Mapping symbolic programs with dynamic tree structure to parallel machines Angela Sodan |
| title_fullStr | Mapping symbolic programs with dynamic tree structure to parallel machines Angela Sodan |
| title_full_unstemmed | Mapping symbolic programs with dynamic tree structure to parallel machines Angela Sodan |
| title_short | Mapping symbolic programs with dynamic tree structure to parallel machines |
| title_sort | mapping symbolic programs with dynamic tree structure to parallel machines |
| topic | Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing COMMON LISP (Computer program language) Parallel processing (Electronic computers) LISP (DE-588)4035918-9 gnd Logische Programmierung (DE-588)4195096-3 gnd Strukturbaum (DE-588)4183789-7 gnd Parallelrechner (DE-588)4173280-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Objektorientierte Programmierung (DE-588)4233947-9 gnd Fuzzy-Menge (DE-588)4061868-7 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd Dynamik (DE-588)4013384-9 gnd Programmtransformation (DE-588)4263654-1 gnd Datenstruktur (DE-588)4011146-5 gnd Symbolic programming language (DE-588)4184193-1 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| topic_facet | Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing COMMON LISP (Computer program language) Parallel processing (Electronic computers) LISP Logische Programmierung Strukturbaum Parallelrechner Parallelverarbeitung Objektorientierte Programmierung Fuzzy-Menge Dynamik Programmtransformation Datenstruktur Symbolic programming language Funktionale Programmierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007337704&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV010701409 |
| work_keys_str_mv | AT sodanangela mappingsymbolicprogramswithdynamictreestructuretoparallelmachines |