Can I read Processor-pool-based scheduling for large-scale NUMA multiprocessors on EtoBox?

Processor-pool-based scheduling for large-scale NUMA multiprocessors by Songnian Zhou; Timothy Brecht is a Computer Science article available to read on EtoBox.

What is Processor-pool-based scheduling for large-scale NUMA multiprocessors about?

Large-scale Non-Uniform Memory Access (NUMA) multiprocessors are gaining increased attention due to their potential for achieving high performance through the replication of relatively simple components. Because of the complexity of such systems, scheduling algorithms for parallel applications are crucial in realizing the performance potential of these systems. In particular, scheduling methods must consider the scale of the system, with the increased likelihood of creating bottlenecks, along with the NUMA characteristics of the system, and the benefits to be gained by placing threads close to their code and data.We propose a class of scheduling algorithms based on __processor pools__ . A processor pool is a software construct for organizing and managing a large number of processors by dividing them into groups called pools. The parallel threads of a job are run in a single processor pool, unless there are performance advantages for a job to span multiple pools. Several jobs may share one pool. Our simulation experiments show that processor pool-based scheduling may effectively reduce the average job response time. The performance improvements attained by using processor pools incr

Who reads Processor-pool-based scheduling for large-scale NUMA multiprocessors?

Author

Songnian Zhou; Timothy Brecht

Publisher

ACM

Published

1991

Language

EN

Field

Computer Science (Physical Sciences)