13th Euromicro Conference on Parallel, Distributed and Network-Based Processing
DOI: 10.1109/empdp.2005.26
|View full text |Cite
|
Sign up to set email alerts
|

Memory Bandwidth Aware Scheduling for SMP Cluster Nodes

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…Liedtke introduced the topic in 2000 [15]. Both Antonopoulos [5] and Koukis [13] have built upon his work by proposing techniques for scheduling jobs on SMP nodes in a manner cognizant of memory bus contention.…”
Section: Smp Memory Bus Contentionmentioning
confidence: 99%
“…Liedtke introduced the topic in 2000 [15]. Both Antonopoulos [5] and Koukis [13] have built upon his work by proposing techniques for scheduling jobs on SMP nodes in a manner cognizant of memory bus contention.…”
Section: Smp Memory Bus Contentionmentioning
confidence: 99%
“…It may be possible to acquire such information by automated experimentation [22,23] or by correlating profiling statistics with application properties [5,10,25,30]. The most straight forward approach, however, is to simply ask the user.…”
Section: Symbiotic Space-sharing In Prac-ticementioning
confidence: 98%
“…Liedtke introduced the topic in 2000 [12]. Both Antonopoulos [5] and Koukis [10] have built upon this by proposing techniques for scheduling jobs on SMP nodes in a manner cognizant of memory bus contention.…”
Section: Smp Memory Bus Contentionmentioning
confidence: 98%
“…Proposed contention-aware scheduling frameworks rely on an application classification scheme that predicts application interference under a co-execution scenario [5,7,8,11,12]. Our classification approach has the following novel objectives: (a) detect contention on both the shared memory link and LLC; (b) rely only on information that can be collected at runtime by existing monitoring mechanisms of Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page.…”
Section: Introductionmentioning
confidence: 99%