Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Toronto
1972
|
| Schriftenreihe: | University <Toronto> / Computer Systems Research Group: Technical report / CSRG
16 |
| Umfang: | 21Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009933740 | ||
| 003 | DE-604 | ||
| 005 | 20010105 | ||
| 007 | t| | ||
| 008 | 941206s1972 xx |||| 00||| undod | ||
| 035 | |a (OCoLC)632398145 | ||
| 035 | |a (DE-599)BVBBV009933740 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sevcik, Kenneth C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| 264 | 1 | |a Toronto |c 1972 | |
| 300 | |a 21Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Toronto> / Computer Systems Research Group: Technical report / CSRG |v 16 | |
| 810 | 2 | |a Computer Systems Research Group: Technical report / CSRG |t University <Toronto> |v 16 |w (DE-604)BV009933593 |9 16 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006581207 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6125-16 |
|---|---|
| DE-BY-TUM_katkey | 641256 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010160386 |
| _version_ | 1821938129161945089 |
| any_adam_object | |
| author | Sevcik, Kenneth C. |
| author_facet | Sevcik, Kenneth C. |
| author_role | aut |
| author_sort | Sevcik, Kenneth C. |
| author_variant | k c s kc kcs |
| building | Verbundindex |
| bvnumber | BV009933740 |
| ctrlnum | (OCoLC)632398145 (DE-599)BVBBV009933740 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00929nam a2200265 cb4500</leader><controlfield tag="001">BV009933740</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010105 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">941206s1972 xx |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)632398145</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009933740</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sevcik, Kenneth C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Toronto</subfield><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21Bl.</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">University <Toronto> / Computer Systems Research Group: Technical report / CSRG</subfield><subfield code="v">16</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Systems Research Group: Technical report / CSRG</subfield><subfield code="t">University <Toronto></subfield><subfield code="v">16</subfield><subfield code="w">(DE-604)BV009933593</subfield><subfield code="9">16</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006581207</subfield></datafield></record></collection> |
| id | DE-604.BV009933740 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:44:45Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006581207 |
| oclc_num | 632398145 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 21Bl. |
| publishDate | 1972 |
| publishDateSearch | 1972 |
| publishDateSort | 1972 |
| record_format | marc |
| series2 | University <Toronto> / Computer Systems Research Group: Technical report / CSRG |
| spellingShingle | Sevcik, Kenneth C. Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_auth | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_exact_search | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_full | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_fullStr | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_full_unstemmed | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_short | Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| title_sort | optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible |
| volume_link | (DE-604)BV009933593 |
| work_keys_str_mv | AT sevcikkennethc optimalprocessorschedulingwhenservicetimesarehyperexponentiallydistributedandpreemptionoverheadisnotnegligible |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6125-16 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |