Sally A. McKee

Sally A. McKee

Auto-generated profile, based on publicly available information

Sally A. McKee

Clemson University

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 March 2017 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
DZDarko Zivanovic
Darko Zivanovic
MPMilan Pavlovic
Milan Pavlovic
MRMilan Radulovic
Milan Radulovic
HSHyunsung Shin
Hyunsung Shin
JSJongpil Son
Jongpil Son
EAEduard Ayguadé
Eduard Ayguadé
An important aspect of High-Performance Computing (HPC) system design is the choice of main memory capacity. This choice becomes increasingly important now that 3D-stacked memories are entering the market. Compared with conventional Dual In-line Memory Modules (DIMMs), 3D memory chiplets provide better performance and energy efficiency but lower memory capacities. Therefore, the adoption of 3D-stacked memories in the HPC domain depends on whether we can find use cases that require much less memory than is available now. This study analyzes the memory capacity requirements of important HPC benchmarks and applications. We find that the High-Performance Conjugate Gradients (HPCG) benchmark could be an important success story for 3D-stacked memories in HPC, but High-Performance Linpack (HPL) is likely to be constrained by 3D memory capacity. The study also emphasizes that the analysis of memory footprints of production HPC applications is complex and that it requires an understanding of application scalability and target category, i.e., whether the users target capability or capacity computing. The results show that most of the HPC applications under study have per-core memory footprints in the range of hundreds of megabytes, but we also detect applications and use cases that require gigabytes per core. Overall, the study identifies the HPC applications and use cases with memory footprints that could be provided by 3D-stacked memory chiplets, making a first step toward adoption of this novel technology in the HPC domain.

1 October 2018
Verified
Conference Paper
Open access
PDF file
MJMatthias Jung
Matthias Jung
SMSally A. McKee
Sally A. McKee
CSChirag Sudarshan
Chirag Sudarshan
CDChristoph Dropmann
Christoph Dropmann
CWChristian Weis
Christian Weis
NWNorbert Wehn
Norbert Wehn

1 September 2012
Verified
Conference Paper
Closed access
PLPer Larsen
Per Larsen
RLRazya Ladelsky
Razya Ladelsky
JLJacob Lidman
Jacob Lidman
SMSally A. McKee
Sally A. McKee
SKSven Karlsson
Sven Karlsson
AZAyal Zaks
Ayal Zaks
The performance of many parallel applications relies not on instruction-level parallelism but on loop-level parallelism. Unfortunately, automatic parallelization of loops is a fragile process, many different obstacles affect or prevent it in practice. To address this predicament we developed an interactive compilation feedback system that guides programmers in iteratively modifying their application source code. This helps leverage the compiler's ability to generate loop-parallel code. We employ our system to modify two sequential benchmarks dealing with image processing and edge detection, resulting in scalable parallelized code that runs up to 8.3 times faster on an eight-core Intel Xeon 5570 system and up to 12.5 times faster on a quad-core IBM POWER6 system. Benchmark performance varies significantly between the systems. This suggests that semi-automatic parallelization should be combined with target-specific optimizations. Furthermore, comparing the first benchmark to manually-parallelized, hand-optimized pthreads and OpenMP versions, we find that code generated using our approach typically outperforms the pthreads code (within 93-339%). It also performs competitively against the OpenMP code (within 75-111%). The second benchmark outperforms manually-parallelized and optimized OpenMP code (within 109-242%).

11 June 2003
Verified
Conference Paper
Open access
PDF file
TMTao Mu
Tao Mu
JTJie Tao
Jie Tao
MSMartin Schulz
Martin Schulz
SMSally A. McKee
Sally A. McKee

1 January 1999 in Scientific Programming
Verified
Journal Article
Open access
PDF file
JCJohn B. Carter
John B. Carter
WHWilson C. Hsieh
Wilson C. Hsieh
LSLeigh B. Stoller
Leigh B. Stoller
MSMark Swanson
Mark Swanson
LZLixin Zhang
Lixin Zhang
SMSally A. McKee
Sally A. McKee
Impulse is a new memory system architecture that adds two important features to a traditional memory controller. First, Impulse supports application‐specific optimizations through configurable physical address remapping. By remapping physical addresses, applications control how their data is accessed and cached, improving their cache and bus utilization. Second, Impulse supports prefetching at the memory controller, which can hide much of the latency of DRAM accesses. Because it requires no modification to processor, cache, or bus designs, Impulse can be adopted in conventional systems. In this paper we describe the design of the Impulse architecture, and show how an Impulse memory system can improve the performance of memory‐bound scientific applications. For instance, Impulse decreases the running time of the NAS conjugate gradient benchmark by 67%. We expect that Impulse will also benefit regularly strided, memory‐bound applications of commercial importance, such as database and multimedia programs.

4 October 2017 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
ZJZhen Jia
Zhen Jia
WGWanling Gao
Wanling Gao
YSYingjie Shi
Yingjie Shi
SMSally A. McKee
Sally A. McKee
ZJZhenyan Ji
Zhenyan Ji
LZLixin Zhang
Lixin Zhang
Our global economy increasingly depends on our ability to gather, analyze, link, and compare very large data sets. Keeping up with such big data poses challenges in terms of both computational performance and energy efficiency, and motivates different approaches to explore data center systems and architectures. To better understand the processor design decisions in context of data analytics in data centers, we conduct comprehensive evaluations using representative data analaytics workloads on representative conventional multi-core and many-core processors. After a comprehensive analysis of performance, power, energy efficiency and performance-cost efficiency, we have the following observations: contrasted with the conventional wisdom that uses wimpy many-core processors to improve energy-efficiency, the brawny multi-core processors with SMT (simultaneous multithreading) and dynamic overclocking technologies outperform the counterparts in terms of not only execution time, but also energy-efficiency for most of data analytics workloads in our experiments.