Show simple item record

dc.contributor.authorNikolopoulos, Dimitrios
dc.contributor.authorPapatheodorou, Theodore
dc.contributor.authorPolychronopoulos, Constantine D.
dc.contributor.authorLabarta Mancho, Jesús José
dc.contributor.authorAyguadé Parra, Eduard
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2021-06-01T08:39:00Z
dc.date.available2021-06-01T08:39:00Z
dc.date.issued2000
dc.identifier.citationNikolopoulos, D. [et al.]. A case for user-level dynamic page migration. A: International Conference on Supercomputing. "ICS'00: proceedings of the 14th international Conference on Supercomputing". New York: Association for Computing Machinery (ACM), 2000, p. 119-130. ISBN 1-58113-270-0. DOI 10.1145/335231.335243.
dc.identifier.isbn1-58113-270-0
dc.identifier.urihttp://hdl.handle.net/2117/346445
dc.description.abstractThis paper presents user-level dynamic page migration, a runtime technique which transparently enables parallel programs to tune their memory performance on distributed shared memory multiprocessors, with feedback obtained from dynamic monitoring of memory activity. Our technique exploits the iterative nature of parallel programs and information available to the program both at compile time and at runtime in order to improve the accuracy and the timeliness of page migrations, as well as amortize better the overhead, compared to page migration engines implemented in the operating system. We present an adaptive page migration algorithm based on a competitive and a predictive criterion. The competitive criterion is used to correct poor page placement decisions of the operating system, while the predictive criterion makes the algorithm responsive to scheduling events that necessitate immediate page migrations, such as preemptions and migrations of threads. We also present a new technique for preventing page pingpong and a mechanism for monitoring the performance of page migration algorithms at runtime and tuning their sensitive parameters accordingly. Our experimental evidence on a SGI Origin2000 shows that unmodified OpenMP codes linked with our runtime system for dynamic page migration are effectively immune to the page placement strategy of the operating system and the associated problems with data locality. Furthermore, our runtime system achieves solid performance improvements compared to the IRIX 6.5.5 page migration engine, for single parallel OpenMP codes and multiprogrammed workloads.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherAssociation for Computing Machinery (ACM)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshMemory management (Computer science)
dc.subject.lcshOperating systems
dc.subject.lcshParallel programming (Computer science)
dc.subject.otherDistributed shared memory systems
dc.subject.otherStorage management
dc.titleA case for user-level dynamic page migration
dc.typeConference report
dc.subject.lemacGestió de memòria (Informàtica)
dc.subject.lemacSistemes operatius (Ordinadors)
dc.subject.lemacProgramació en paral·lel (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1145/335231.335243
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://dl.acm.org/doi/abs/10.1145/335231.335243
dc.rights.accessOpen Access
local.identifier.drac2452023
dc.description.versionPostprint (author's final draft)
local.citation.authorNikolopoulos, D.; Papatheodorou, T.; Polychronopoulos, C.; Labarta, J.; Ayguadé, E.
local.citation.contributorInternational Conference on Supercomputing
local.citation.pubplaceNew York
local.citation.publicationNameICS'00: proceedings of the 14th international Conference on Supercomputing
local.citation.startingPage119
local.citation.endingPage130


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record