backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-22 04:42:10 +08:00
Code Issues Projects Releases Wiki Activity
Files
gh-pages
C-Plus-Plus/d7/d1a/non__preemptive__sjf__scheduling_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

411 lines
32 KiB
HTML
Raw Permalink Blame History

<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('d7/d1a/non__preemptive__sjf__scheduling_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">non_preemptive_sjf_scheduling.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of <a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> CPU scheduling algorithm.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iomanip&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;queue&gt;</code><br />
<code>#include &lt;random&gt;</code><br />
<code>#include &lt;unordered_set&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for non_preemptive_sjf_scheduling.cpp:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d2/dba/non__preemptive__sjf__scheduling_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
<p><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:Compare_3C_20S_2C_20T_2C_20E_20_3E" id="r_Compare_3C_20S_2C_20T_2C_20E_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d4a/class_compare.html">Compare&lt; S, T, E &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comparator class for priority queue. <a href="../../de/d4a/class_compare.html#details">More...</a><br /></td></tr>
<tr class="memitem:SJF_3C_20S_2C_20T_2C_20E_20_3E" id="r_SJF_3C_20S_2C_20T_2C_20E_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d9f/class_s_j_f.html">SJF&lt; S, T, E &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class which implements the <a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm. <a href="../../d7/d9f/class_s_j_f.html#details">More...</a><br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a18920aa331faf4476b251c8cdb2c2bec" id="r_a18920aa331faf4476b251c8cdb2c2bec"><td class="memTemplParams" colspan="2">template&lt;typename S, typename T, typename E&gt; </td></tr>
<tr class="memitem:a18920aa331faf4476b251c8cdb2c2bec template"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a> (tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</td></tr>
<tr class="memdesc:a18920aa331faf4476b251c8cdb2c2bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comparator function for sorting a vector. <br /></td></tr>
<tr class="memitem:a23667f16acc4035988e7cd7ae80b6ff3" id="r_a23667f16acc4035988e7cd7ae80b6ff3"><td class="memTemplParams" colspan="2">template&lt;typename S, typename T, typename E&gt; </td></tr>
<tr class="memitem:a23667f16acc4035988e7cd7ae80b6ff3 template"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a23667f16acc4035988e7cd7ae80b6ff3">get_final_status</a> (<a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; tuple&lt; S, T, E &gt; &gt; input)</td></tr>
<tr class="memdesc:a23667f16acc4035988e7cd7ae80b6ff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the final status of processes after applying non-preemptive <a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling. <br /></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> CPU scheduling algorithm. </p>
<p>shortest job first (<a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a>), also known as shortest job next (SJN), is a scheduling policy that selects for execution the waiting process with the smallest execution time. SJN is a non-preemptive algorithm. Shortest remaining time is a preemptive variant of SJN. <a href="https://www.guru99.com/shortest-job-first-sjf-scheduling.html">detailed description on SJF scheduling </a> <a href="https://github.com/LakshmiSrikumar">Author : Lakshmi Srikumar </a> </p>
<p class="definition">Definition in file <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">non_preemptive_sjf_scheduling.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="a23667f16acc4035988e7cd7ae80b6ff3" name="a23667f16acc4035988e7cd7ae80b6ff3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a23667f16acc4035988e7cd7ae80b6ff3">&#9670;&#160;</a></span>get_final_status()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename S, typename T, typename E&gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; get_final_status </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; tuple&lt; S, T, E &gt; &gt;</td> <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Computes the final status of processes after applying non-preemptive <a class="el" href="../../d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">S</td><td>Data type of Process ID </td></tr>
<tr><td class="paramname">T</td><td>Data type of Arrival time </td></tr>
<tr><td class="paramname">E</td><td>Data type of Burst time </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">input</td><td>A vector of tuples containing Process ID, Arrival time, and Burst time </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A vector of tuples containing Process ID, Arrival time, Burst time, Completion time, Turnaround time, and Waiting time </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00228">228</a> of file <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">non_preemptive_sjf_scheduling.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 229</span> {</div>
<div class="line"><span class="lineno"> 230</span> <span class="comment">// Sort the processes based on Arrival time and then Burst time</span></div>
<div class="line"><span class="lineno"> 231</span> sort(input.begin(), input.end(), <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol&lt;S, T, E&gt;</a>);</div>
<div class="line"><span class="lineno"> 232</span> </div>
<div class="line"><span class="lineno"> 233</span> <span class="comment">// Result vector to hold the final status of each process</span></div>
<div class="line"><span class="lineno"> 234</span> vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(input.size());</div>
<div class="line"><span class="lineno"> 235</span> <span class="keywordtype">double</span> timeElapsed = 0;</div>
<div class="line"><span class="lineno"> 236</span> </div>
<div class="line"><span class="lineno"> 237</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; input.size(); i++) {</div>
<div class="line"><span class="lineno"> 238</span> <span class="comment">// Extract Arrival time and Burst time</span></div>
<div class="line"><span class="lineno"> 239</span> T arrival = get&lt;1&gt;(input[i]);</div>
<div class="line"><span class="lineno"> 240</span> E burst = get&lt;2&gt;(input[i]);</div>
<div class="line"><span class="lineno"> 241</span> </div>
<div class="line"><span class="lineno"> 242</span> <span class="comment">// If the CPU is idle, move time to the arrival of the next process</span></div>
<div class="line"><span class="lineno"> 243</span> <span class="keywordflow">if</span> (arrival &gt; timeElapsed) {</div>
<div class="line"><span class="lineno"> 244</span> timeElapsed = arrival;</div>
<div class="line"><span class="lineno"> 245</span> }</div>
<div class="line"><span class="lineno"> 246</span> </div>
<div class="line"><span class="lineno"> 247</span> <span class="comment">// Update timeElapsed by adding the burst time</span></div>
<div class="line"><span class="lineno"> 248</span> timeElapsed += burst;</div>
<div class="line"><span class="lineno"> 249</span> </div>
<div class="line"><span class="lineno"> 250</span> <span class="comment">// Calculate Completion time, Turnaround time, and Waiting time</span></div>
<div class="line"><span class="lineno"> 251</span> <span class="keywordtype">double</span> completion = timeElapsed;</div>
<div class="line"><span class="lineno"> 252</span> <span class="keywordtype">double</span> turnaround = completion - arrival;</div>
<div class="line"><span class="lineno"> 253</span> <span class="keywordtype">double</span> waiting = turnaround - burst;</div>
<div class="line"><span class="lineno"> 254</span> </div>
<div class="line"><span class="lineno"> 255</span> <span class="comment">// Store the results in the result vector</span></div>
<div class="line"><span class="lineno"> 256</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[i] = make_tuple(get&lt;0&gt;(input[i]), arrival, burst, completion,</div>
<div class="line"><span class="lineno"> 257</span> turnaround, waiting);</div>
<div class="line"><span class="lineno"> 258</span> }</div>
<div class="line"><span class="lineno"> 259</span> </div>
<div class="line"><span class="lineno"> 260</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 261</span>}</div>
<div class="ttc" id="afcfs__scheduling_8cpp_html_a18920aa331faf4476b251c8cdb2c2bec"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a></div><div class="ttdeci">bool sortcol(tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</div><div class="ttdoc">Comparator function for sorting a vector.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00046">fcfs_scheduling.cpp:46</a></div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on successful exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00313">313</a> of file <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">non_preemptive_sjf_scheduling.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 313</span> {</div>
<div class="line"><span class="lineno"> 314</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 315</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 316</span>}</div>
<div class="ttc" id="anon__preemptive__sjf__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00267">non_preemptive_sjf_scheduling.cpp:267</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a18920aa331faf4476b251c8cdb2c2bec" name="a18920aa331faf4476b251c8cdb2c2bec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a18920aa331faf4476b251c8cdb2c2bec">&#9670;&#160;</a></span>sortcol()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename S, typename T, typename E&gt; </div>
<table class="memname">
<tr>
<td class="memname">bool sortcol </td>
<td>(</td>
<td class="paramtype">tuple&lt; S, T, E &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>t1</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">tuple&lt; S, T, E &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>t2</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Comparator function for sorting a vector. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">S</td><td>Data type of Process ID </td></tr>
<tr><td class="paramname">T</td><td>Data type of Arrival time </td></tr>
<tr><td class="paramname">E</td><td>Data type of Burst time </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">t1</td><td>First tuple&lt;S,T,E&gt;t1 </td></tr>
<tr><td class="paramname">t2</td><td>Second tuple&lt;S,T,E&gt;t2 </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true if t1 and t2 are in the CORRECT order </dd>
<dd>
false if t1 and t2 are in the INCORRECT order </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">non_preemptive_sjf_scheduling.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) &lt; get&lt;1&gt;(t2) ||</div>
<div class="line"><span class="lineno"> 47</span> (get&lt;1&gt;(t1) == get&lt;1&gt;(t2) &amp;&amp; get&lt;0&gt;(t1) &lt; get&lt;0&gt;(t2))) {</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 51</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00267">267</a> of file <a class="el" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html">non_preemptive_sjf_scheduling.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 267</span> {</div>
<div class="line"><span class="lineno"> 268</span> <span class="comment">// A vector to store the results of all processes across all test cases.</span></div>
<div class="line"><span class="lineno"> 269</span> vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;&gt;</div>
<div class="line"><span class="lineno"> 270</span> finalResult;</div>
<div class="line"><span class="lineno"> 271</span> </div>
<div class="line"><span class="lineno"> 272</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i &lt; 10; i++) {</div>
<div class="line"><span class="lineno"> 273</span> std::random_device rd; <span class="comment">// Seeding</span></div>
<div class="line"><span class="lineno"> 274</span> std::mt19937 eng(rd());</div>
<div class="line"><span class="lineno"> 275</span> std::uniform_int_distribution&lt;&gt; distr(1, 10);</div>
<div class="line"><span class="lineno"> 276</span> </div>
<div class="line"><span class="lineno"> 277</span> uint32_t n = distr(eng);</div>
<div class="line"><span class="lineno"> 278</span> <a class="code hl_class" href="../../d7/d9f/class_s_j_f.html">SJF&lt;uint32_t, uint32_t, uint32_t&gt;</a> readyQueue;</div>
<div class="line"><span class="lineno"> 279</span> vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;&gt;</div>
<div class="line"><span class="lineno"> 280</span> input(n);</div>
<div class="line"><span class="lineno"> 281</span> </div>
<div class="line"><span class="lineno"> 282</span> <span class="comment">// Generate random arrival and burst times</span></div>
<div class="line"><span class="lineno"> 283</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 284</span> get&lt;0&gt;(input[i]) = i;</div>
<div class="line"><span class="lineno"> 285</span> get&lt;1&gt;(input[i]) = distr(eng); <span class="comment">// Random arrival time</span></div>
<div class="line"><span class="lineno"> 286</span> get&lt;2&gt;(input[i]) = distr(eng); <span class="comment">// Random burst time</span></div>
<div class="line"><span class="lineno"> 287</span> }</div>
<div class="line"><span class="lineno"> 288</span> </div>
<div class="line"><span class="lineno"> 289</span> <span class="comment">// Print processes before scheduling</span></div>
<div class="line"><span class="lineno"> 290</span> cout &lt;&lt; <span class="stringliteral">&quot;Processes before SJF scheduling:&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 291</span> readyQueue.<a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905">printResult</a>(input);</div>
<div class="line"><span class="lineno"> 292</span> </div>
<div class="line"><span class="lineno"> 293</span> <span class="comment">// Add processes to the queue</span></div>
<div class="line"><span class="lineno"> 294</span> <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 295</span> readyQueue.<a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed">addProcess</a>(get&lt;0&gt;(input[i]), get&lt;1&gt;(input[i]),</div>
<div class="line"><span class="lineno"> 296</span> get&lt;2&gt;(input[i]));</div>
<div class="line"><span class="lineno"> 297</span> }</div>
<div class="line"><span class="lineno"> 298</span> </div>
<div class="line"><span class="lineno"> 299</span> <span class="comment">// Perform SJF schedulings</span></div>
<div class="line"><span class="lineno"> 300</span> <span class="keyword">auto</span> finalResult = readyQueue.<a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30">scheduleForSJF</a>();</div>
<div class="line"><span class="lineno"> 301</span> </div>
<div class="line"><span class="lineno"> 302</span> <span class="comment">// Print processes after scheduling</span></div>
<div class="line"><span class="lineno"> 303</span> cout &lt;&lt; <span class="stringliteral">&quot;\nProcesses after SJF scheduling:&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 304</span> readyQueue.<a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905">printResult</a>(finalResult);</div>
<div class="line"><span class="lineno"> 305</span> }</div>
<div class="line"><span class="lineno"> 306</span> cout &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 307</span>}</div>
<div class="ttc" id="aclass_s_j_f_html"><div class="ttname"><a href="../../d7/d9f/class_s_j_f.html">SJF</a></div><div class="ttdoc">Class which implements the SJF scheduling algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00096">non_preemptive_sjf_scheduling.cpp:96</a></div></div>
<div class="ttc" id="aclass_s_j_f_html_a42d7016523e3adfe5b946fab18ce7905"><div class="ttname"><a href="../../d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905">SJF::printResult</a></div><div class="ttdeci">void printResult(const vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; &amp;processes)</div><div class="ttdoc">Utility function for printing the status of each process after execution.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00197">non_preemptive_sjf_scheduling.cpp:197</a></div></div>
<div class="ttc" id="aclass_s_j_f_html_a61b76afcc94e573d7232ab51c351fd30"><div class="ttname"><a href="../../d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30">SJF::scheduleForSJF</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; scheduleForSJF()</div><div class="ttdoc">Algorithm for scheduling CPU processes according to the Shortest Job First (SJF) scheduling algorithm...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00154">non_preemptive_sjf_scheduling.cpp:154</a></div></div>
<div class="ttc" id="aclass_s_j_f_html_af73fe815835075184724a13c12f613ed"><div class="ttname"><a href="../../d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed">SJF::addProcess</a></div><div class="ttdeci">void addProcess(S id, T arrival, E burst)</div><div class="ttdoc">Adds the process to the ready queue if it isn&#39;t already there.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp_source.html#l00127">non_preemptive_sjf_scheduling.cpp:127</a></div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html">cpu_scheduling_algorithms</a></li><li class="navelem"><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html">non_preemptive_sjf_scheduling.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink