Processor scheduling in shared memory multiprocessors
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
NUMA policies and their relation to memory architecture
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Experimental comparison of memory management policies for NUMA multiprocessors
ACM Transactions on Computer Systems (TOCS)
The robustness of NUMA memory management
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Scheduling for locality in shared-memory multiprocessors
Scheduling for locality in shared-memory multiprocessors
Scheduling and page migration for multiprocessor compute servers
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Operating system support for improving data locality on CC-NUMA compute servers
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
The DASH Prototype: Logic Overhead and Performance
IEEE Transactions on Parallel and Distributed Systems
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Resource Management Methods for General Purpose Massively Parallel OS SSS-Core
ISHPC '97 Proceedings of the International Symposium on High Performance Computing
Thread Tranquilizer: Dynamically reducing performance variation
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
| Hi-index | 0.00 |
For Non-Uniform Memory Access (NUMA) multiprocessors, memory access overhead is crucial to system performance. Processor scheduling and page placement schemes, dominant factors of memory access overhead, are closely related. In particular, if the processor scheduling scheme is dynamic space-sharing, it should be considered together with the page placement scheme for efficient process execution. Most research in this area, however, has focused exclusively on either the processor scheduling scheme or the page placement scheme alone without considering the interaction between the two. This paper proposes several policies for cluster-based NUMA multiprocessors that are combinations of a processor scheduling scheme and a page placement scheme and investigates the interaction between them. The simulation results show that policies that cooperate to employ the home-cluster concept achieve the best performance. The paper also compares the best of the proposed policies with other existing dynamic processor scheduling policies. Based on our study reported here, the best policy is found to perform better than other existing policies.