The complexity of preemptive scheduling algorithms for multiprocessor systems:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
1974
|
| Schriftenreihe: | Bericht / Technische Universität Berlin, Fachbereich 20, Kybernetik
74,20 |
| Beschreibung: | 53 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV024291716 | ||
| 003 | DE-604 | ||
| 005 | 20220906 | ||
| 007 | t | ||
| 008 | 090924s1974 |||| 00||| eng d | ||
| 035 | |a (OCoLC)916134435 | ||
| 035 | |a (DE-599)BVBBV024291716 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 100 | 1 | |a Hennings, Dirk |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of preemptive scheduling algorithms for multiprocessor systems |c Dirk Hennings ; Sigram Schindler ; Michael Steinacker |
| 264 | 1 | |a Berlin |c 1974 | |
| 300 | |a 53 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Bericht / Technische Universität Berlin, Fachbereich 20, Kybernetik |v 74,20 | |
| 700 | 1 | |a Schindler, Sigram |d 1936- |e Verfasser |0 (DE-588)108011151 |4 aut | |
| 700 | 1 | |a Steinacker, Michael |e Verfasser |4 aut | |
| 810 | 2 | |a Technische Universität Berlin, Fachbereich 20, Kybernetik |t Bericht |v 74,20 |w (DE-604)BV002795897 |9 74,20 | |
| 940 | 1 | |q TUB-53oS | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018193023 | ||
Datensatz im Suchindex
| _version_ | 1804140165674827776 |
|---|---|
| any_adam_object | |
| author | Hennings, Dirk Schindler, Sigram 1936- Steinacker, Michael |
| author_GND | (DE-588)108011151 |
| author_facet | Hennings, Dirk Schindler, Sigram 1936- Steinacker, Michael |
| author_role | aut aut aut |
| author_sort | Hennings, Dirk |
| author_variant | d h dh s s ss m s ms |
| building | Verbundindex |
| bvnumber | BV024291716 |
| ctrlnum | (OCoLC)916134435 (DE-599)BVBBV024291716 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01074nam a2200301 cb4500</leader><controlfield tag="001">BV024291716</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220906 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1974 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916134435</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024291716</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hennings, Dirk</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of preemptive scheduling algorithms for multiprocessor systems</subfield><subfield code="c">Dirk Hennings ; Sigram Schindler ; Michael Steinacker</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">1974</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">53 Bl.</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">Bericht / Technische Universität Berlin, Fachbereich 20, Kybernetik</subfield><subfield code="v">74,20</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schindler, Sigram</subfield><subfield code="d">1936-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108011151</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steinacker, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin, Fachbereich 20, Kybernetik</subfield><subfield code="t">Bericht</subfield><subfield code="v">74,20</subfield><subfield code="w">(DE-604)BV002795897</subfield><subfield code="9">74,20</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-53oS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018193023</subfield></datafield></record></collection> |
| id | DE-604.BV024291716 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:55:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018193023 |
| oclc_num | 916134435 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 53 Bl. |
| psigel | TUB-53oS |
| publishDate | 1974 |
| publishDateSearch | 1974 |
| publishDateSort | 1974 |
| record_format | marc |
| series2 | Bericht / Technische Universität Berlin, Fachbereich 20, Kybernetik |
| spelling | Hennings, Dirk Verfasser aut The complexity of preemptive scheduling algorithms for multiprocessor systems Dirk Hennings ; Sigram Schindler ; Michael Steinacker Berlin 1974 53 Bl. txt rdacontent n rdamedia nc rdacarrier Bericht / Technische Universität Berlin, Fachbereich 20, Kybernetik 74,20 Schindler, Sigram 1936- Verfasser (DE-588)108011151 aut Steinacker, Michael Verfasser aut Technische Universität Berlin, Fachbereich 20, Kybernetik Bericht 74,20 (DE-604)BV002795897 74,20 |
| spellingShingle | Hennings, Dirk Schindler, Sigram 1936- Steinacker, Michael The complexity of preemptive scheduling algorithms for multiprocessor systems |
| title | The complexity of preemptive scheduling algorithms for multiprocessor systems |
| title_auth | The complexity of preemptive scheduling algorithms for multiprocessor systems |
| title_exact_search | The complexity of preemptive scheduling algorithms for multiprocessor systems |
| title_full | The complexity of preemptive scheduling algorithms for multiprocessor systems Dirk Hennings ; Sigram Schindler ; Michael Steinacker |
| title_fullStr | The complexity of preemptive scheduling algorithms for multiprocessor systems Dirk Hennings ; Sigram Schindler ; Michael Steinacker |
| title_full_unstemmed | The complexity of preemptive scheduling algorithms for multiprocessor systems Dirk Hennings ; Sigram Schindler ; Michael Steinacker |
| title_short | The complexity of preemptive scheduling algorithms for multiprocessor systems |
| title_sort | the complexity of preemptive scheduling algorithms for multiprocessor systems |
| volume_link | (DE-604)BV002795897 |
| work_keys_str_mv | AT henningsdirk thecomplexityofpreemptiveschedulingalgorithmsformultiprocessorsystems AT schindlersigram thecomplexityofpreemptiveschedulingalgorithmsformultiprocessorsystems AT steinackermichael thecomplexityofpreemptiveschedulingalgorithmsformultiprocessorsystems |