1997
DOI: 10.1006/jpdc.1997.1387
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Real-Time Task Scheduling on Hypercubes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2010
2010

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…However, the simulations described in the paper are limited. Their conclusions on comparing their proposed MWF (Maximum Workload derivative First) schemes with the EDF and FIXED algorithms [27,7] hold true only in certain scenarios (see Section 6.3 for a detailed explanation). The work on scheduling ''moldable jobs'' [8,14,20,34,36] is also related, but only He et al [20] have considered QoS support.…”
Section: Related Workmentioning
confidence: 90%
“…However, the simulations described in the paper are limited. Their conclusions on comparing their proposed MWF (Maximum Workload derivative First) schemes with the EDF and FIXED algorithms [27,7] hold true only in certain scenarios (see Section 6.3 for a detailed explanation). The work on scheduling ''moldable jobs'' [8,14,20,34,36] is also related, but only He et al [20] have considered QoS support.…”
Section: Related Workmentioning
confidence: 90%