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

André Turgeon

dblp:72/752 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 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
Performance modeling and evaluation · 46% Cloud and datacenter computing · 30% Electronic design automation · 23%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling › resource scheduling
application placement
0.012000
Application Placement using Performance Surfaces · HPDC 2000
Performance modeling and evaluation › performance prediction
network performance prediction
0.012000
Application Placement using Performance Surfaces · HPDC 2000
Performance modeling and evaluation
performance prediction
0.012000
Application Placement using Performance Surfaces · HPDC 2000
Electronic design automation › high-level synthesis
scheduling
0.012000
Application Placement using Performance Surfaces · HPDC 2000
Cloud and datacenter computing › resource allocation
resource selection
0.012000
Application Placement using Performance Surfaces · HPDC 2000

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

performance surfaces · 0.0affinity measures · 0.0
YearPublicationVenuePosition
2000 Application Placement using Performance Surfaces
abstract
Heterogeneous parallel clusters of workstations are being used to solve many important computational problems. Scheduling parallel applications on the best collection of machines in a heterogeneous computing environment is a complex problem. Performance prediction is vital to good application performance in this environment since utilization of an ill-suited machine can slow the computation down significantly. The heterogeneity of the different pieces composing the parallel platform (network links, CPU, memory, and OS) makes it incredibly difficult to accurately predict performance. This paper addresses the problem of network performance prediction. Since communication speed is often the bottleneck for parallel application perfomance, network performance prediction is important to the overall performance prediction problem. A new methodology for characterizing network links and application's need for network resources is developed which makes use of performance surfaces (Clement et al., 1998). Mathematical operations on the performance surfaces are introduced that calculate an application's affinity for a network configuration. These affinity measures can be used for the scheduling of parallel applications.
André Turgeon, Quinn Snell, Mark J. Clement
HPDC1