Holdings: Work efficient parallel scheduling algorithms

Work efficient parallel scheduling algorithms:

Saved in:

Bibliographic Details
Main Author:	Stadtherr, Hans 1966- (Author)
Format:	Electronic eBook
Language:	English
Published:	1998
Subjects:	Komplexitätstheorie Paralleler Algorithmus Parallelverarbeitung Effizienter Algorithmus Scheduling Hochschulschrift
Online Access:	http://mediatum.ub.tum.de/?id=601655 http://d-nb.info/962681369/34
Item Description:	München, Techn. Univ., Diss., 1998
Physical Description:	1 Online-Ressource

Staff View

MARC


LEADER	00000nmm a2200000 c 4500
001	BV013983803
003	DE-604
005	20021018
006	a m\|\|\| 00\|\|\|
007	cr\|uuu---uuuuu
008	011023s1998 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
016	7		\|a 962681369 \|2 DE-101
035			\|a (OCoLC)76309475
035			\|a (DE-599)BVBBV013983803
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c DE
049			\|a DE-384 \|a DE-473 \|a DE-703 \|a DE-1051 \|a DE-824 \|a DE-29 \|a DE-12 \|a DE-91 \|a DE-19 \|a DE-1049 \|a DE-92 \|a DE-739 \|a DE-355 \|a DE-20
084			\|a DAT 516d \|2 stub
084			\|a DAT 401d \|2 stub
084			\|a DAT 537d \|2 stub
084			\|a DAT 403d \|2 stub
100	1		\|a Stadtherr, Hans \|d 1966- \|e Verfasser \|0 (DE-588)123204291 \|4 aut
245	1	0	\|a Work efficient parallel scheduling algorithms \|c Hans Stadtherr
264		1	\|c 1998
300			\|a 1 Online-Ressource
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
500			\|a München, Techn. Univ., Diss., 1998
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Paralleler Algorithmus \|0 (DE-588)4193615-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Parallelverarbeitung \|0 (DE-588)4075860-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Effizienter Algorithmus \|0 (DE-588)4125422-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Scheduling \|0 (DE-588)4179449-7 \|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 Scheduling \|0 (DE-588)4179449-7 \|D s
689	0	2	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Parallelverarbeitung \|0 (DE-588)4075860-6 \|D s
689	1	1	\|a Scheduling \|0 (DE-588)4179449-7 \|D s
689	1	2	\|a Effizienter Algorithmus \|0 (DE-588)4125422-3 \|D s
689	1		\|5 DE-604
856	4		\|s ca. 1,2 MB \|u http://mediatum.ub.tum.de/?id=601655
856	4		\|u http://d-nb.info/962681369/34
912			\|a ebook
999			\|a oai:aleph.bib-bvb.de:BVB01-009572366

Record in the Search Index

_version_	1804128836883841024
any_adam_object
author	Stadtherr, Hans 1966-
author_GND	(DE-588)123204291
author_facet	Stadtherr, Hans 1966-
author_role	aut
author_sort	Stadtherr, Hans 1966-
author_variant	h s hs
building	Verbundindex
bvnumber	BV013983803
classification_tum	DAT 516d DAT 401d DAT 537d DAT 403d
collection	ebook
ctrlnum	(OCoLC)76309475 (DE-599)BVBBV013983803
discipline	Informatik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01977nmm a2200541 c 4500</leader><controlfield tag="001">BV013983803</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20021018 </controlfield><controlfield tag="006">a m\|\|\| 00\|\|\| </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">011023s1998 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">962681369</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76309475</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013983803</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-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</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 401d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 403d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stadtherr, Hans</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123204291</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Work efficient parallel scheduling algorithms</subfield><subfield code="c">Hans Stadtherr</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1998</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-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="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">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-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">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">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="s">ca. 1,2 MB</subfield><subfield code="u">http://mediatum.ub.tum.de/?id=601655</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://d-nb.info/962681369/34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009572366</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV013983803
illustrated	Not Illustrated
indexdate	2024-07-09T18:55:35Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-009572366
oclc_num	76309475
open_access_boolean
owner	DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-355 DE-BY-UBR DE-20
owner_facet	DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-355 DE-BY-UBR DE-20
physical	1 Online-Ressource
psigel	ebook
publishDate	1998
publishDateSearch	1998
publishDateSort	1998
record_format	marc
spelling	Stadtherr, Hans 1966- Verfasser (DE-588)123204291 aut Work efficient parallel scheduling algorithms Hans Stadtherr 1998 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier München, Techn. Univ., Diss., 1998 Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Paralleler Algorithmus (DE-588)4193615-2 s Scheduling (DE-588)4179449-7 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Parallelverarbeitung (DE-588)4075860-6 s Effizienter Algorithmus (DE-588)4125422-3 s ca. 1,2 MB http://mediatum.ub.tum.de/?id=601655 http://d-nb.info/962681369/34
spellingShingle	Stadtherr, Hans 1966- Work efficient parallel scheduling algorithms Komplexitätstheorie (DE-588)4120591-1 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Scheduling (DE-588)4179449-7 gnd
subject_GND	(DE-588)4120591-1 (DE-588)4193615-2 (DE-588)4075860-6 (DE-588)4125422-3 (DE-588)4179449-7 (DE-588)4113937-9
title	Work efficient parallel scheduling algorithms
title_auth	Work efficient parallel scheduling algorithms
title_exact_search	Work efficient parallel scheduling algorithms
title_full	Work efficient parallel scheduling algorithms Hans Stadtherr
title_fullStr	Work efficient parallel scheduling algorithms Hans Stadtherr
title_full_unstemmed	Work efficient parallel scheduling algorithms Hans Stadtherr
title_short	Work efficient parallel scheduling algorithms
title_sort	work efficient parallel scheduling algorithms
topic	Komplexitätstheorie (DE-588)4120591-1 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Scheduling (DE-588)4179449-7 gnd
topic_facet	Komplexitätstheorie Paralleler Algorithmus Parallelverarbeitung Effizienter Algorithmus Scheduling Hochschulschrift
url	http://mediatum.ub.tum.de/?id=601655 http://d-nb.info/962681369/34
work_keys_str_mv	AT stadtherrhans workefficientparallelschedulingalgorithms

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!

MARC

Record in the Search Index

There is no print copy available.

Similar Items