A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://ocean.kisti.re.kr/downfile/volume/kiss/E1EIKI/2012/v6n4/E1EIKI_2012_v6n4_287.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Korean Institute of Information Scientists and Engineers">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xvozmuuqprbr3mvk4th3ep6pea" style="color: black;">Journal of Computing Science and Engineering</a>
We introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report our findings. We assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of other users, in that they must compete for processor time in a time-sharing manner and other limited resources such as memory and I/O in a space-sharing manner. Under the assumption, we developed a methodology to<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5626/jcse.2012.6.4.287">doi:10.5626/jcse.2012.6.4.287</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rrqwhqqmlndg5j3ubuuazv3ffm">fatcat:rrqwhqqmlndg5j3ubuuazv3ffm</a> </span>
more »... mulate job arrivals to a set of compute nodes, and gather and process performance data to calculate the percentage slowdown of parallel jobs. Our goal through this study is to identify a better combination of jobs that minimize performance degradations due to resource sharing and contention. Through our experiments, we found a couple of interesting behaviors for overlapped parallel jobs, which may be used to suggest alternative job allocation schemes aiming to reduce slowdowns that will inevitably result due to resource sharing on a high performance computing cluster. We suggest three job allocation strategies based on our empirical results and propose further studies of the results using a supercomputing facility at the San Diego Supercomputing Center. Category: Smart and intelligent computing
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706105239/http://ocean.kisti.re.kr/downfile/volume/kiss/E1EIKI/2012/v6n4/E1EIKI_2012_v6n4_287.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/76/ca76ddb19f3ac02a610a7d5435f2ac0e6f6d007d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5626/jcse.2012.6.4.287"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>