Verfügbarkeit: Symbolic parallelization of nested loop programs

Symbolic parallelization of nested loop programs: = Symbolische Parallelisierung verschachtelter Schleifenprogramme

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Tanase, Alexandru-Petru (VerfasserIn)
Format:	Abschlussarbeit Buch
Sprache:	English
Veröffentlicht:	Erlangen ; Nürnberg [2017]
Schlagworte:	Codegenerierung Array > Informatik Feldrechner Parallelrechner Hochschulschrift
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	ix, 196 Seiten Illustrationen, Diagramme 21 cm

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV044546786
003	DE-604
005	20171102
007	t
008	171019s2017 gw a\|\|\| m\|\|\| 00\|\|\| eng d
016	7		\|a 1141821346 \|2 DE-101
035			\|a (OCoLC)1008558192
035			\|a (DE-599)DNB1141821346
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE
049			\|a DE-29T \|a DE-29 \|a DE-83
100	1		\|a Tanase, Alexandru-Petru \|e Verfasser \|4 aut
245	1	0	\|a Symbolic parallelization of nested loop programs \|b = Symbolische Parallelisierung verschachtelter Schleifenprogramme \|c vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien
246	1	3	\|a Symbolische Parallelisierung verschachtelter Schleifenprogramme
246	1	1	\|a Symbolische Parallelisierung verschachtelter Schleifenprogramme
264		1	\|a Erlangen ; Nürnberg \|c [2017]
300			\|a ix, 196 Seiten \|b Illustrationen, Diagramme \|c 21 cm
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
502			\|b Dissertation \|c Friedrich-Alexander-Universität Erlangen-Nürnberg \|d 2017
650	0	7	\|a Codegenerierung \|0 (DE-588)4010346-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Array \|g Informatik \|0 (DE-588)4376624-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Feldrechner \|0 (DE-588)4016692-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Parallelrechner \|0 (DE-588)4173280-7 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Codegenerierung \|0 (DE-588)4010346-8 \|D s
689	0	1	\|a Feldrechner \|0 (DE-588)4016692-2 \|D s
689	0	2	\|a Parallelrechner \|0 (DE-588)4173280-7 \|D s
689	0	3	\|a Array \|g Informatik \|0 (DE-588)4376624-9 \|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=029945732&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-029945732

Datensatz im Suchindex

_version_	1804177908158169088
adam_text	CONTENTS 1 INTRODUCTION 3 1.1 GOALS AND C ONTRIBUTIONS ................................................................ 6 1.2 ORGANIZATION OF THE T H E SIS ............................................................. 9 2 FUNDAMENTALS AND COMPILER FRAMEWORK 11 2.1 INVASIVE COM PUTING.......................................................................... 11 2.2 INVASIVE TIGHTLY COUPLED PROCESSOR A RRA Y S.................................. 15 2.2.1 PROCESSOR A RRA Y ................................................................... 16 2.2.2 ARRAY INTERCONNECT ............................................................. 18 2.2.3 TCPA PERIPHERALS ............................................................. 18 2.3 COMPILER FRAM EW ORK........................................................................ 20 2.3.1 COMPILATION F LOW ................................................................ 21 2.3.2 FRONT E N D ............................................................................. 23 2.3.3 LOOP SPECIFICATION IN THE POLYHEDRON M O D E L .................. 25 2.3.4 PAULA LANGUAGE ................................................................ 29 2.3.5 P A R O ................................................................................... 29 2.3.5.1 HIGH-LEVEL TRANSFORMATIONS ............................... 31 2.3.5.2 LOCALIZATION........................................................... 31 2.3.5.3 STATIC LOOP T ILI N G ............................................... 32 2.3.5.4 STATIC SCHEDULING.................................................. 34 2.3.6 CODE G EN E RA TIO N ................................................................ 37 3 SYMBOLIC PARALLELIZATION 41 3.1 SYMBOLIC T ILIN G ................................................................................. 42 3.1.1 DECOMPOSITION OF THE ITERATION S P A C E ............................... 43 3.1.2 EMBEDDING OF DATA DEPENDENCIES..................................... 46 3.2 SYMBOLIC OUTER LOOP PARALLELIZATION ............................................. 50 3.2.1 TIGHT INTRA-TILE SCHEDULE VECTOR C A N D ID A TE S .................. 52 3.2.2 TIGHT INTER-TILE SCHEDULE VECTORS........................................ 59 3.2.3 PARAMETRIC LATENCY FORM ULA.............................................. 65 3.2.4 RUNTIME SCHEDULE S ELE CTIO N .............................................. 68 3.3 SYMBOLIC INNER LOOP PARALLELIZATION............................................... 70 3.3.1 TIGHT INTRA-TILE SCHEDULE VECTORS .................................... 72 3.3.2 TIGHT INTER-TILE SCHEDULE VECTOR C A N D ID A TE S ................... 73 3.3.3 PARAMETRIC LATENCY FORM ULA .............................................. 77 3.3.4 RUNTIME SCHEDULE S E LE C TIO N .............................................. 79 3.4 RUNTIME SCHEDULE SELECTION ON INVASIVE T C P A S ......................... 81 3.5 EXPERIMENTAL R E SU LTS....................................................................... 83 3.5.1 L A TE N C Y ................................................................................ 84 3.5.2 I/O AND MEMORY D E M A N D ................................................. 86 3.5.3 SCALABILITY............................................................................. 90 3.6 RELATED W O R K ................................................................................... 92 3.7 S U M M A RY ......................................................................................... 96 4 SYMBOLIC MULTI-LEVEL PARALLELIZATION 99 4.1 SYMBOLIC HIERARCHICAL T ILIN G ........................................................... 100 4.1.1 DECOMPOSITION OF THE ITERATION S P A C E ............................... 101 4.1.2 EMBEDDING OF DATA DEPENDENCIES ..................................... 103 4.2 SYMBOLIC HIERARCHICAL S CHEDULING ................................................. 106 4.2.1 LATENCY-MINIMAL SEQUENTIAL SCHEDULE V E C TO R S ............... 107 4.2.2 TIGHT PARALLEL SCHEDULE V E C TO RS ........................................ 112 4.2.3 PARAMETRIC LATENCY FORM ULA .............................................. 114 4.2.4 RUNTIME SCHEDULE S E LE C TIO N .............................................. 117 4.3 EXPERIMENTAL R ESU LTS....................................................................... 117 4.3.1 L A TE N C Y ................................................................................ 118 4.3.2 I/O AND MEMORY B A LA N CIN G .............................................. 121 4.3.3 SCALABILITY............................................................................. 122 4.4 RELATED W O R K ................................................................................... 123 4.5 S U M M A RY .......................................................................................... 125 5 ON-DEMAND FAULT-TOLERANT LOOP PROCESSING 127 5.1 FUNDAMENTALS AND FAULT M O D E L .................................................... 128 5.2 FAULT-TOLERANT LOOP E XECUTION........................................................ 130 5.2.1 LOOP R EPLICATION................................................................. 132 5.2.2 VOTING INSERTION.................................................................... 134 5.2.3 IMMEDIATE, EARLY, AND LATE V O TIN G .................................. 137 5.2.3.1 IMMEDIATE VOTING .............................................. 137 5.2.3.2 EARLY V O TIN G ....................................................... 141 5.2.3.3 LATE V O TIN G ........................................................... 143 5.3 VOTING FUNCTIONS IM PLEM ENTATION ................................................. 145 5.4 ADAPTIVE FAULT TOLERANCE THROUGH INVASIVE C O M P U TIN G ............ 147 5.5 EXPERIMENTAL R ESU LTS....................................................................... 151 5.5.1 LATENCY OVERHEAD .............................................................. 151 5.5.2 AVERAGE ERROR DETECTION L A TE N C Y ..................................... 154 5.6 RELATED W O R K ................................................................................... 155 5.7 SUMMARY ........................................................................................ 158 6 CONCLUSIONS AND OUTLOOK 159 6.1 CONCLUSIONS...................................................................................... 159 6.2 O U TLO O K ............................................................................................ 161 GERMAN PART 163 BIBLIOGRAPHY 169 AUTHOR*S OWN PUBLICATIONS 187 LIST OF SYMBOLS 191 ACRONYMS 195
any_adam_object	1
author	Tanase, Alexandru-Petru
author_facet	Tanase, Alexandru-Petru
author_role	aut
author_sort	Tanase, Alexandru-Petru
author_variant	a p t apt
building	Verbundindex
bvnumber	BV044546786
ctrlnum	(OCoLC)1008558192 (DE-599)DNB1141821346
format	Thesis Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01953nam a2200433 c 4500</leader><controlfield tag="001">BV044546786</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171102 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">171019s2017 gw a\|\|\| m\|\|\| 00\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1141821346</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1008558192</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1141821346</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tanase, Alexandru-Petru</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Symbolic parallelization of nested loop programs</subfield><subfield code="b">= Symbolische Parallelisierung verschachtelter Schleifenprogramme</subfield><subfield code="c">vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Symbolische Parallelisierung verschachtelter Schleifenprogramme</subfield></datafield><datafield tag="246" ind1="1" ind2="1"><subfield code="a">Symbolische Parallelisierung verschachtelter Schleifenprogramme</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Erlangen ; Nürnberg</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">ix, 196 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">21 cm</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="b">Dissertation</subfield><subfield code="c">Friedrich-Alexander-Universität Erlangen-Nürnberg</subfield><subfield code="d">2017</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Codegenerierung</subfield><subfield code="0">(DE-588)4010346-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Array</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4376624-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Feldrechner</subfield><subfield code="0">(DE-588)4016692-2</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="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">Codegenerierung</subfield><subfield code="0">(DE-588)4010346-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Feldrechner</subfield><subfield code="0">(DE-588)4016692-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Array</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4376624-9</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=029945732&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029945732</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV044546786
illustrated	Illustrated
indexdate	2024-07-10T07:55:33Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-029945732
oclc_num	1008558192
open_access_boolean
owner	DE-29T DE-29 DE-83
owner_facet	DE-29T DE-29 DE-83
physical	ix, 196 Seiten Illustrationen, Diagramme 21 cm
publishDate	2017
publishDateSearch	2017
publishDateSort	2017
record_format	marc
spelling	Tanase, Alexandru-Petru Verfasser aut Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien Symbolische Parallelisierung verschachtelter Schleifenprogramme Erlangen ; Nürnberg [2017] ix, 196 Seiten Illustrationen, Diagramme 21 cm txt rdacontent n rdamedia nc rdacarrier Dissertation Friedrich-Alexander-Universität Erlangen-Nürnberg 2017 Codegenerierung (DE-588)4010346-8 gnd rswk-swf Array Informatik (DE-588)4376624-9 gnd rswk-swf Feldrechner (DE-588)4016692-2 gnd rswk-swf Parallelrechner (DE-588)4173280-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Codegenerierung (DE-588)4010346-8 s Feldrechner (DE-588)4016692-2 s Parallelrechner (DE-588)4173280-7 s Array Informatik (DE-588)4376624-9 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029945732&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Tanase, Alexandru-Petru Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme Codegenerierung (DE-588)4010346-8 gnd Array Informatik (DE-588)4376624-9 gnd Feldrechner (DE-588)4016692-2 gnd Parallelrechner (DE-588)4173280-7 gnd
subject_GND	(DE-588)4010346-8 (DE-588)4376624-9 (DE-588)4016692-2 (DE-588)4173280-7 (DE-588)4113937-9
title	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme
title_alt	Symbolische Parallelisierung verschachtelter Schleifenprogramme
title_auth	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme
title_exact_search	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme
title_full	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien
title_fullStr	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien
title_full_unstemmed	Symbolic parallelization of nested loop programs = Symbolische Parallelisierung verschachtelter Schleifenprogramme vorgelegt von Alexandru-Petru Tanase aus Hermannstadt, Rumänien
title_short	Symbolic parallelization of nested loop programs
title_sort	symbolic parallelization of nested loop programs symbolische parallelisierung verschachtelter schleifenprogramme
title_sub	= Symbolische Parallelisierung verschachtelter Schleifenprogramme
topic	Codegenerierung (DE-588)4010346-8 gnd Array Informatik (DE-588)4376624-9 gnd Feldrechner (DE-588)4016692-2 gnd Parallelrechner (DE-588)4173280-7 gnd
topic_facet	Codegenerierung Array Informatik Feldrechner Parallelrechner Hochschulschrift
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029945732&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT tanasealexandrupetru symbolicparallelizationofnestedloopprogramssymbolischeparallelisierungverschachtelterschleifenprogramme AT tanasealexandrupetru symbolischeparallelisierungverschachtelterschleifenprogramme

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge