[1991] Proceedings. 11th International Conference on Distributed Computing Systems
DOI: 10.1109/icdcs.1991.148686
|View full text |Cite
|
Sign up to set email alerts
|

The Stealth distributed scheduler

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 68 publications
(22 citation statements)
references
References 9 publications
0
22
0
Order By: Relevance
“…Where both load-sharing and load-balancing approach tends to maximize the rate at which distribution systems work, when required resources are available, load-balancing additionally attempts to equalize the loads on the available nodes [23]. Additionally, load distribution algorithms can be categorized as: Sender-Initiated Algorithms [10], Receiver-Initiated Algorithms [10], Symmetrically Initiated Algorithms [20] and Adaptive Algorithm [21]. As the name suggests, in Sender-Initiated Algorithms, load-distribution is initiated by an overloaded sender that tends to send a task to an under-loaded receiver.…”
Section: Basics Of Load Balancing In a Distributed Environmentmentioning
confidence: 99%
“…Where both load-sharing and load-balancing approach tends to maximize the rate at which distribution systems work, when required resources are available, load-balancing additionally attempts to equalize the loads on the available nodes [23]. Additionally, load distribution algorithms can be categorized as: Sender-Initiated Algorithms [10], Receiver-Initiated Algorithms [10], Symmetrically Initiated Algorithms [20] and Adaptive Algorithm [21]. As the name suggests, in Sender-Initiated Algorithms, load-distribution is initiated by an overloaded sender that tends to send a task to an under-loaded receiver.…”
Section: Basics Of Load Balancing In a Distributed Environmentmentioning
confidence: 99%
“…In fact, many studies show that typical desktop workloads leave the vast majority of the resources idle most of the time. For example, reports regarding average system idle time range from 75% [509] to 91% [417]. On desktop machines, which are often networked together, the spare cycles on one machine may be used by applications initiated on another.…”
Section: Desktop and Worktation Workloadsmentioning
confidence: 99%
“…The Linger-Longer approach permits slightly more disruption of the user, but tries to limit the delay to an acceptable level. One system that used non-idle workstations was the Stealth distributed scheduler [11]. It implemented a priority-based approach to running guest processes.…”
Section: Related Workmentioning
confidence: 99%