A scalable time-sharing scheduling for partitionable distributed memory parallel machines.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/hicss/HoriMITK95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/hicss/HoriMITK95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Atsushi_Hori
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hiroki_Konaka
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Munenori_Maeda
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Takashi_Tomokiyo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yutaka_Ishikawa
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FHICSS.1995.375465
>
foaf:
homepage
<
https://doi.org/10.1109/HICSS.1995.375465
>
dc:
identifier
DBLP conf/hicss/HoriMITK95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FHICSS.1995.375465
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
A scalable time-sharing scheduling for partitionable distributed memory parallel machines.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Atsushi_Hori
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hiroki_Konaka
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Munenori_Maeda
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Takashi_Tomokiyo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yutaka_Ishikawa
>
swrc:
pages
173-182
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/hicss/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/hicss/HoriMITK95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/hicss/HoriMITK95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/hicss/hicss1995.html#HoriMITK95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/HICSS.1995.375465
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/hicss
>
dc:
subject
processor scheduling; trees (mathematics); distributed memory systems; parallel machines; time-sharing systems; reconfigurable architectures; scalable time-sharing scheduling; partitionable distributed memory parallel machines; process scheduling queue system; distributed queue tree; dynamically partitionable parallel machines; nested; dynamically nested partitioning; time-sharing scheduling; interactive environment; processor utilization; process scheduling queues; round-robin scheduling algorithm; task allocation policies; simulation results; time-sharing; batch scheduling; high-load situations
(xsd:string)
dc:
title
A scalable time-sharing scheduling for partitionable distributed memory parallel machines.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document