To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-2001-08253
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-2001-08253
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/H._Jonathan_Chao
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Soheil_Abbasloo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yang_Xu_0010
>
foaf:
homepage
<
https://arxiv.org/abs/2001.08253
>
dc:
identifier
DBLP journals/corr/abs-2001-08253
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/corr
>
rdfs:
label
To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/H._Jonathan_Chao
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Soheil_Abbasloo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yang_Xu_0010
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-2001-08253/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/abs-2001-08253
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08253
>
rdfs:
seeAlso
<
https://arxiv.org/abs/2001.08253
>
dc:
title
To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
abs/2001.08253
(xsd:string)