Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures 1999
DOI: 10.1145/305619.305630
|View full text |Cite
|
Sign up to set email alerts
|

A closer look at coscheduling approaches for a network of workstations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
52
0

Year Published

2000
2000
2011
2011

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 41 publications
(54 citation statements)
references
References 17 publications
2
52
0
Order By: Relevance
“…Periodic Boost (PB) [12], [19] is an alternative coscheduling scheme to avoid expensive interrupt costs. In PB, the receiver is busy-waiting in send and receive operations, as with DCS; however, rather than raising an interrupt for each incoming message, a kernel thread periodically examines message queues of each process in a round-robin way and boosts the priority of one of the processes with unconsumed (or pending) messages.…”
Section: Communication-driven Coscheduling (Cdc)mentioning
confidence: 99%
See 2 more Smart Citations
“…Periodic Boost (PB) [12], [19] is an alternative coscheduling scheme to avoid expensive interrupt costs. In PB, the receiver is busy-waiting in send and receive operations, as with DCS; however, rather than raising an interrupt for each incoming message, a kernel thread periodically examines message queues of each process in a round-robin way and boosts the priority of one of the processes with unconsumed (or pending) messages.…”
Section: Communication-driven Coscheduling (Cdc)mentioning
confidence: 99%
“…Two main strategies for coordinating individual local schedulers have been proposed: gang scheduling (GS) [8], [14] and communication-driven coscheduling (CDC) [2]- [5], [11], [12], [15], [19]. GS uses explicit global synchronization to schedule all the processes of a job simultaneously.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…• Dynamic Co-Scheduling Schemes Dynamic co-scheduling schemes are proposed to further boost the system utilization [5,1,21,15]. These schemes allocate multiple tasks (from different jobs) to a node, and leave the temporal scheduling of that node to its local CPU scheduler.…”
Section: Summary Of Cluster Scheduling Strategiesmentioning
confidence: 99%
“…In this paper, we present a new methodology that conjugates the positive aspects of explicit and implicit coscheduling using three techniques: communication buffering to amortize communication overhead (a technique similar to periodic boost [11]); strobing to globally exchange information at regular intervals; and non-blocking, one-sided communication to decouple communication and synchronization. By leveraging these techniques, we can perform effective optimizations based on the status of the parallel machine rather than on the limited knowledge available locally to each processor.…”
Section: Introductionmentioning
confidence: 99%