Vis enkel innførsel

dc.contributor.authorNatvig, Thorvaldnb_NO
dc.date.accessioned2014-12-19T13:37:15Z
dc.date.available2014-12-19T13:37:15Z
dc.date.created2011-09-12nb_NO
dc.date.issued2010nb_NO
dc.identifier440076nb_NO
dc.identifier.isbn978-82-471-2465-9 (printed ver.)nb_NO
dc.identifier.urihttp://hdl.handle.net/11250/252454
dc.description.abstractAs computing systems grow more complex, they also grow harder to use. On today’scommodity clusters, achieving some degree of speedup can often be easy, but achievingoptimal speedup is hard. Suboptimal use of shared resources like clusters not only increasesthe wallclock time for the individual job, but also decreases the throughput of theclusters and reduces the amount of resources available for other researchers. At the sametime, improving application efficiency often requires much more time of the researchers,which reduces the time they can spend on other research tasks. The goal of this thesis is to present a series of automatic optimizations that allow researcherswriting parallel applications to use simple and understandable programmingparadigms while getting close to the performance of hand optimized code. In this dissertation,we specifically focus on node-to-node communication and file I/O operations ofparallel applications using MPI. The core of our ideas are being presented in the papersincluded as part of this work. The optimizations are injected at run-time through a library that is loaded into the application.No recompilation or even access to source code of the application is necesary. Whenthe application issues a communication request or a file operation, our injected library interceptsthe request, and the request is then issued in an asynchronous and non-blockingmanner. At the same time, the memory area the application used for the request is protectedfrom access. This allows the request to continue in the background, and we canensure data consistency. Memory protection does have some overhead due to updating the page tables and flushingthe buffers of the CPU. To overcome this, modeling has been developed which allowsaccurate prediction of overhead and request completion times. This ensures that suchoptimizations will only be performed when they are beneficial. Additionally, several optimizationsto the page protection itself are presented, which reduce the effective overhead.Further reduction of this overhead is an ongoing research topic.nb_NO
dc.languageengnb_NO
dc.publisherNTNUnb_NO
dc.relation.ispartofseriesDoktoravhandlinger ved NTNU, 1503-8181; 2010:237nb_NO
dc.titleAutomatic Run-Time Communication and I/O Optimizationsnb_NO
dc.typeDoctoral thesisnb_NO
dc.contributor.departmentNorges teknisk-naturvitenskapelige universitet, Fakultet for informasjonsteknologi, matematikk og elektroteknikk, Institutt for datateknikk og informasjonsvitenskapnb_NO
dc.description.degreePhD i Informasjonsteknologinb_NO
dc.description.degreePhD in Information Technologyen_GB


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel