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://sameekhan.org/pub/I_K_2008_IPDPS.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy
<span title="">2008</span>
<i title="IEEE">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5vsih2yegrfubf7el6ncng3mgq" style="color: black;">Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)</a>
</i>
Preserved Fulltext
Multi-core processors are beginning to revolutionize the landscape of high-performance computing. In this paper, we address the problem of power-aware scheduling/mapping of tasks onto heterogeneous and homogeneous multi-core processor architectures. The objective of scheduling is to minimize the energy consumption as well as the makespan of computationally intensive problems. The multiobjective optimization problem is not properly handled by conventional approaches that try to maximize a single
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2008.4536420">doi:10.1109/ipdps.2008.4536420</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/AhmadRK08.html">dblp:conf/ipps/AhmadRK08</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4krzdxkrsvhnfj6symdpjiyofi">fatcat:4krzdxkrsvhnfj6symdpjiyofi</a>
</span>
more »
... objective. Our proposed solution is based on game theory. We formulate the problem as a cooperate game. Although we can guarantee the existence of a Bargaining Point in this problem, the classical cooperative game theoretical techniques such as the Nash axiomatic technique cannot be used to identify the Bargaining Point due to low convergence rates and high complexity. Hence, we transform the problem to a max-max-min problem such that it can generate solutions with fast turnaround time.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811033835/http://sameekhan.org/pub/I_K_2008_IPDPS.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/28/37/2837d07d403e170e1daab46ea699f074764464d6.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2008.4536420">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>