Portable parallel irregular applications

Yelick, Katherine; Wen, Chih-Po; Chakrabarti, Soumen; Deprit, Etienne; Jones, Jeff

doi:10.1007/bfb0023060

Cited by 6 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several examples of hash tables used in high-performance computing [36,37]. The Multipol library of distributed data structures from Yelick et al [38] contains a general-purpose non-blocking distributed hash table. Several design criteria came into play for the hash table library described next.…”

Section: A Close Look At a Distributed Hash Table Librarymentioning

confidence: 99%

A role for Pareto optimality in mining performance data

Malard

2004

Concurrency Computat.: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYImprovements in performance modeling and identification of computational regimes within software libraries is a critical first step in developing software libraries that are truly agile with respect to the application as well as to the hardware. It is shown here that Pareto ranking, a concept from multiobjective optimization, can be an effective tool for mining large performance datasets. The approach is illustrated using software performance data gathered using both the public domain LAPACK library and an asynchronous communication library based on IBM LAPI active message library.

show abstract

Section: A Close Look At a Distributed Hash Table Librarymentioning

confidence: 99%