1992
DOI: 10.1016/0167-739x(92)90032-7
|View full text |Cite
|
Sign up to set email alerts
|

Extending multiprogramming to a DMPP

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
2
0

Year Published

1993
1993
1996
1996

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…
is now being ported to a new Cray T3D machine, and several other experimental systems [13,39,4,17,6].At first blush, it might appear that gang scheduling is a luxury that may not be worth the price. An optimal packing of gangs that gives minimal wasted processors is an NPcomplete problem.
…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…
is now being ported to a new Cray T3D machine, and several other experimental systems [13,39,4,17,6].At first blush, it might appear that gang scheduling is a luxury that may not be worth the price. An optimal packing of gangs that gives minimal wasted processors is an NPcomplete problem.
…”
mentioning
confidence: 99%
“…The use of time slicing allows performance to degrade gradually as load increases, and fosters support for interactive response times. In addition, the fact that interacting processes are guaranteed to execute simultaneously allows them to access hardware communication devices in user mode, without the overheads associated with operating system protection [29,39,23].A distributed hierarchical control (DHC) scheme for supporting gang scheduling has been proposed previously [16]. DHC defines a control structure over the parallel machine and combines time slicing with a buddy-system partitioning scheme.…”
mentioning
confidence: 99%