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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Wanqian Liu

dblp:06/4006 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
0000-0001-8173-5436ORCID · corroborated

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

Systems, architecture and hardware · 2 · 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
2 papers
Parallel and multicore computing · 81% Memory systems · 16% Performance modeling and evaluation · 3%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
non-contiguous allocations		 0.021997
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers · IEEE Trans. Parallel Distributed Syst. 1997
Non-contiguous processor allocation algorithms for distributed memory multicomputers · SC 1994
Parallel and multicore computing
processor allocation		 0.021997
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers · IEEE Trans. Parallel Distributed Syst. 1997
Non-contiguous processor allocation algorithms for distributed memory multicomputers · SC 1994
Memory systems › memory management
fragmentation		 0.011997
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers · IEEE Trans. Parallel Distributed Syst. 1997
Parallel and multicore computing › parallel architecture
mesh-connected computer		 0.011997
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers · IEEE Trans. Parallel Distributed Syst. 1997
Parallel and multicore computing
multicomputer		 0.011994
Non-contiguous processor allocation algorithms for distributed memory multicomputers · SC 1994
Performance modeling and evaluation › simulation
simulation-based evaluation		 0.011994
Non-contiguous processor allocation algorithms for distributed memory multicomputers · SC 1994

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

simulation · 0.0experimental evaluation · 0.0multiple buddy strategy · 0.0
YearPublicationVenuePosition
1997 Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
abstract
Current processor allocation techniques for highly parallel systems are typically restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. As a result, message-passing systems have yet to achieve the high utilization levels exhibited by traditional vector supercomputers. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation. Three noncontiguous processor allocation strategies-paging allocation, random allocation, and the Multiple Buddy Strategy (MBS)-are proposed and studied in this paper. Simulations compare the performance of the noncontiguous strategies with that of several well-known contiguous algorithms. We show that noncontiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous allocation is feasible with current technologies.
Virginia Mary Lo, Kurt J. Windisch, Wanqian Liu, Bill Nitzberg
 IEEE Trans. Parallel Distributed Syst.3
1994 Non-contiguous processor allocation algorithms for distributed memory multicomputers
abstract
Current processor allocation techniques for highly parallel systems have thus far been restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation. Three non-contiguous processor allocation strategies: naive, random and the multiple buddy strategy (MBS) are proposed and studied in this paper. Simulations compare the performance of the non-contiguous strategies with that of several well-known contiguous algorithms. We show that non-contiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show non-contiguous allocation is feasible with current technologies.>
Wanqian Liu, Virginia Mary Lo, Kurt J. Windisch, Bill Nitzberg
 SC1