Performance prediction and evaluation of parallel processing on a NUMA multiprocessor (1991) [8 citations — 2 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Zhang91performanceprediction,author = {Xiaodong Zhang and Xiaohan Qin},
title = {Performance prediction and evaluation of parallel processing on a NUMA multiprocessor},
journal = {IEEE Transactions on Software Engineering},
year = {1991},
volume = {17},
pages = {1059--1068}
}
Years of Citing Articles
Abstract:
Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale shared memory multiprocessor systems in comparison with non-scalable Uniform Memory Access (UMA) architectures. Most NUMA multiprocessor operations such as scheduling and synchronizing processes, accessing data from processors to memory models and allocating distributed memory space to different processors, are performed through interconnection networks such as a multistage switching network. The efficiency of these basic operations determines the parallel processing performance on a NUMA multiprocessor. This paper presents several analytical models to predict and evaluate the overhead of interprocessor communication, process scheduling, process synchronization and remote memory access where network contention and memory contention are considered. Performance measurements to support the models and analyses through several numerical examples have been done on the BBN GP1000, a NUMA shared memory multiprocessor. Both analytical and experimental results give a comprehensive and clear understanding of the various effects, which are important for the effective use of a NUMA shared memory multiprocessor. The results in this paper may be used to determine optimal strategies in developing an efficient programming environment for a NUMA system. Index Terms--- barrier, interprocessor communication, interconnection network, NUMA architectures, pre-scheduling, self-scheduling, remote memory access, shared memory, UMA architectures.
