Locality-information-based scheduling in shared-memory multiprocessors

Bellosa, Frank

doi:10.1007/bfb0022298

Cited by 5 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bellosa [1,2] first proposed to use hardware memoryrelated counters in thread scheduling for shared memory multiprocessors. Threads that share large parts of their working set are co-located onto the same processor and scheduled sequentially to reduce cache misses across context switches.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Improving Priority Enforcement via Non-Work-Conserving Scheduling

Sáez

Perez

Prieto

2008

2008 37th International Conference on Parallel Processing

View full text Add to dashboard Cite

Current operating system schedulers are not fully aware of multi-core and multi-threaded architectures, and as a result, schedule threads in a way that may cause contention for critical resources such as the last level in the cache memory hierarchy or the memory access bandwidth. This contention has a significant impact on the system productivity and the quality of service that each individual thread gets from the platform, which can widely vary depending on the behavior of its simultaneous co-runners. In this paper we describe the design and implementation of a non-workconserving framework to schedule threads that tries to improve priority enforcement, based on on-line statistics collected through hardware performance counters. We have implemented our scheme in Linux running on both multicore and SMT processors. For synthetic workloads based on the latest SPEC CPU2006 benchmarks, our framework speeds up high-priority threads by up to 50%, while keeping or even slightly improving the overall system throughput.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Juan Carlos Saez is supported by a MEC FPU fellowship grant. 1 We should make clear that when we refer to CPUs in the rest of this paper, we mean cores on multicore systems and virtual processors (hardware contexts) on multithreaded architectures. a chip, rather than increase the clock frequency.…”

Section: Introductionmentioning

confidence: 99%

Improving Priority Enforcement via Non-Work-Conserving Scheduling

Sáez

Perez

Prieto

2008

2008 37th International Conference on Parallel Processing

View full text Add to dashboard Cite

show abstract

“…Grammar used to build IF-THEN-ELSE rulesthe necessary data to accomplish the work[2]; and (3) Random assignment: WUIs are selected randomly.…”

mentioning

confidence: 99%

A distributed evolutionary method to design scheduling policies for volunteer computing

Estrada

Fuentes

Taufer

2008

Proceedings of the 5th Conference on Computing Frontiers

View full text Add to dashboard Cite

Volunteer Computing (VC) is a paradigm that uses idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale, loosely-coupled simulations. A big challenge in VC projects is the scheduling of work-units across heterogeneous, volatile, and error-prone computers. The design of effective scheduling policies for VC projects involves subjective and time-demanding tuning that is driven by the knowledge of the project designer. VC projects are in need of a faster and projectindependent method to automate the scheduling design.To automatically generate a scheduling policy, we must explore the extremely large space of syntactically valid policies. Given the size of this search space, exhaustive search is not feasible. Thus in this paper we propose to solve the problem using an evolutionary method to automatically generate a set of scheduling policies that are project-independent, minimize errors, and maximize throughput in VC projects. Our method includes a genetic algorithm where the representation of individuals, the fitness function, and the genetic operators are specifically tailored to get effective policies in a short time. The effectiveness of our method is evaluated with SimBA, a Simulator of BOINC Applications. Contrary to manuallydesigned scheduling policies that often perform well only for the specific project they were designed for and require months of tuning, our resulting scheduling policies provide better overall throughput across the different VC projects considered in this work and were generated by our method in a time window of one week.

show abstract

An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors

Brecht

1997

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

Locality-information-based scheduling in shared-memory multiprocessors

Abstract: Abstract

Cited by 5 publications

References 12 publications

Improving Priority Enforcement via Non-Work-Conserving Scheduling

Improving Priority Enforcement via Non-Work-Conserving Scheduling

A distributed evolutionary method to design scheduling policies for volunteer computing

An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors

Contact Info

Product

Resources

About