Show simple item record

dc.contributor.authorSudarsan, Rajeshen_US
dc.date.accessioned2014-03-14T20:16:54Z
dc.date.available2014-03-14T20:16:54Z
dc.date.issued2009-09-25en_US
dc.identifier.otheretd-09292009-191237en_US
dc.identifier.urihttp://hdl.handle.net/10919/29137
dc.description.abstractAs terascale supercomputers become more common, and as the high-performance computing community turns its attention to petascale machines, the challenge of providing effective resource management for high-end machines grows in both importance and difficulty. These computing resources are by definition expensive, so the cost of underutilization is also high, e.g., wasting 5% of the compute nodes on a 10,000 node cluster is a much more serious problem than on a 100 node cluster. Moreover, the high energy and cooling costs incurred in maintaining these high end machines (often millions of dollars per year) can be justified only when these machines are used to their full capacity. On large clusters, conventional jobs schedulers are hard-pressed to achieve over 90% utilization with typical job-mixes. A fundamental problem is that most conventional parallel job schedulers only support static scheduling, so that the number of processors allocated to an application cannot be changed at runtime. As a result, it is common to see jobs stuck in the queue because they require just a few more processors than are currently available, resulting in long queue wait times for applications and low overall system utilization. A more flexible and effective approach is to support dynamic resource management and scheduling, where the number of processors allocated to jobs can be expanded or contracted at runtime. This is the focus of this dissertation --- dynamic resizing of parallel applications. Dynamic resizing significantly improves individual application turn-around time and helps the scheduler to achieve higher machine utilization and job throughput. This dissertation focuses on the potential benefits and challenges of dynamic resizing using ReSHAPE, a new framework for dynamic Resizing and Scheduling of Homogeneous Applications in a Parallel Environment. It also details several interesting and effective scheduling policies implemented in ReSHAPE and demonstrates their effectiveness to improve overall cluster utilization and individual application turn-around time.en_US
dc.publisherVirginia Techen_US
dc.relation.haspartSudarsan_R_D_2009.pdfen_US
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectResizing LAMMPSen_US
dc.subjectReSHAPEen_US
dc.subjectpriority schedulingen_US
dc.subjectadaptive resizingen_US
dc.subjectdata redistributionen_US
dc.titleReSHAPE: A Framework for Dynamic Resizing of Parallel Applicationsen_US
dc.typeDissertationen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreePh. D.en_US
thesis.degree.namePh. D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
thesis.degree.disciplineComputer Scienceen_US
dc.contributor.committeechairRibbens, Calvin J.en_US
dc.contributor.committeememberVaradarajan, Srinidhien_US
dc.contributor.committeememberCameron, Kirk W.en_US
dc.contributor.committeememberde Sturler, Ericen_US
dc.contributor.committeememberSandu, Adrianen_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-09292009-191237/en_US
dc.date.sdate2009-09-29en_US
dc.date.rdate2009-10-20
dc.date.adate2009-10-20en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record