Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingli Xie

dblp:135/8694 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 60% Electronic design automation · 20% Processor architecture and microarchitecture · 20%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › memory synthesis › memory partitioning
bank partitioning
0.212014
Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning · HPCA 2014
Processor architecture and microarchitecture
chip multiprocessor
0.212014
Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning · HPCA 2014
Memory systems
DRAM
0.212014
Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning · HPCA 2014
Memory systems
memory interference
0.212014
Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning · HPCA 2014
Memory systems › memory controller
memory scheduling
0.212014
Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning · HPCA 2014

Methods — techniques the papers use, named apart from their topics

profiling · 0.2memory scheduling · 0.2dynamic bank partitioning · 0.2
YearPublicationVenuePosition
2014 Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning
abstract
Applications running concurrently in CMP systems interfere with each other at DRAM memory, leading to poor system performance and fairness. Memory access scheduling reorders memory requests to improve system throughput and fairness. However, it cannot resolve the interference issue effectively. To reduce interference, memory partitioning divides memory resource among threads. Memory channel partitioning maps the data of threads that are likely to severely interfere with each other to different channels. However, it allocates memory resource unfairly and physically exacerbates memory contention of intensive threads, thus ultimately resulting in the increased slowdown of these threads and high system unfairness. Bank partitioning divides memory banks among cores and eliminates interference. However, previous equal bank partitioning restricts the number of banks available to individual thread and reduces bank level parallelism. In this paper, we first propose a Dynamic Bank Partitioning (DBP), which partitions memory banks according to threads' requirements for bank amounts. DBP compensates for the reduced bank level parallelism caused by equal bank partitioning. The key principle is to profile threads' memory characteristics at run-time and estimate their demands for bank amount, then use the estimation to direct our bank partitioning. Second, we observe that bank partitioning and memory scheduling are orthogonal in the sense; both methods can be illuminated when they are applied together. Therefore, we present a comprehensive approach which integrates Dynamic Bank Partitioning and Thread Cluster Memory scheduling (DBP-TCM, TCM is one of the best memory scheduling) to further improve system performance. Experimental results show that the proposed DBP improves system performance by 4.3% and improves system fairness by 16% over equal bank partitioning. Compared to TCM, DBP-TCM improves system throughput by 6.2% and fairness by 16.7%. When compared with MCP, DBP-TCM provides 5.3% better system throughput and 37% better system fairness. We conclude that our methods are effective in improving both system throughput and fairness.
Mingli Xie, Dong Tong 0001, Kan Huang, Xu Cheng 0001
HPCA1
2013 Page policy control with memory partitioning for DRAM performance and power efficiency
abstract
DRAM performance and power efficiency considerations are becoming increasingly important. Bank partitioning partitions memory banks among cores and eliminates inter-thread interference, thus improving system performance of shared memory CMP systems. However, it doesn't take into account DRAM power consumption. We propose an application-aware page policy, which exploits potential benefits of page policy to optimize DRAM performance or minimize power consumption. The key idea is to dynamically assign page policy to applications according to their memory characteristics. As an improvement, we propose a power-aware bank partitioning to balance DRAM performance and power consumption. Experimental results show that our proposal increases system performance and significantly improves DRAM power efficiency.
Mingli Xie, Dong Tong 0001, Yi Feng 0003, Kan Huang, Xu Cheng 0001
ISLPED1