mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
375 lines
46 KiB
HTML
375 lines
46 KiB
HTML
<!-- 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 Source File</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"> 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_source.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</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <algorithm></span> </div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <cassert></span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <iomanip></span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <queue></span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <random></span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <unordered_set></span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <vector></span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">using </span>std::cin;</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keyword">using </span>std::cout;</div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">using </span>std::endl;</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">using </span>std::get;</div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">using </span>std::left;</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">using </span>std::make_tuple;</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keyword">using </span>std::priority_queue;</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">using </span>std::tuple;</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">using </span>std::unordered_set;</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">using </span>std::vector;</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="keyword">template</span> <<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E></div>
|
|
<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec"> 45</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a>(tuple<S, T, E>& t1, tuple<S, T, E>& t2) {</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (get<1>(t1) < get<1>(t2) ||</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> (get<1>(t1) == get<1>(t2) && get<0>(t1) < get<0>(t2))) {</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="keyword">template</span> <<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="keyword">class </span><a class="code hl_class" href="../../de/d4a/class_compare.html">Compare</a> {</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c"> 74</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">operator()</a>(tuple<S, T, E, double, double, double>& t1,</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> tuple<S, T, E, double, double, double>& t2) {</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Compare burst times for SJF</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">if</span> (get<2>(t2) < get<2>(t1)) {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// If burst times are the same, compare arrival times</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (get<2>(t2) == get<2>(t1)) {</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> get<1>(t2) < get<1>(t1);</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span>};</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="keyword">template</span> <<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E></div>
|
|
<div class="foldopen" id="foldopen00096" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../d7/d9f/class_s_j_f.html"> 96</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d7/d9f/class_s_j_f.html">SJF</a> {</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> priority_queue<tuple<S, T, E, double, double, double>,</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> vector<tuple<S, T, E, double, double, double>>,</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_class" href="../../de/d4a/class_compare.html">Compare<S, T, E></a>></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea"> 110</a></span> <a class="code hl_variable" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">schedule</a>;</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// Stores final status of all the processes after completing the execution.</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> vector<tuple<S, T, E, double, double, double>> result;</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// Stores process IDs. Used for confirming absence of a process while it.</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> unordered_set<S> idList;</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> </div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00127" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="../../d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed"> 127</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed">addProcess</a>(S <span class="keywordtype">id</span>, T arrival, E burst) {</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// Add if a process with process ID as id is not found in idList.</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">if</span> (idList.find(<span class="keywordtype">id</span>) == idList.end()) {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> tuple<S, T, E, double, double, double> t =</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> make_tuple(<span class="keywordtype">id</span>, arrival, burst, 0, 0, 0);</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">schedule</a>.push(t);</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> idList.insert(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> }</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="foldopen" id="foldopen00154" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"><a class="line" href="../../d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30"> 154</a></span> vector<tuple<S, T, E, double, double, double>> <a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#a61b76afcc94e573d7232ab51c351fd30">scheduleForSJF</a>() {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// Variable to keep track of time elapsed so far</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">double</span> timeElapsed = 0;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> </div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">schedule</a>.empty()) {</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> tuple<S, T, E, double, double, double> cur = <a class="code hl_variable" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">schedule</a>.top();</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// If the current process arrived at time t2, the last process</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// completed its execution at time t1, and t2 > t1.</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">if</span> (get<1>(cur) > timeElapsed) {</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> timeElapsed += get<1>(cur) - timeElapsed;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> }</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// Add Burst time to time elapsed</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> timeElapsed += get<2>(cur);</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// Completion time of the current process will be same as time</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// elapsed so far</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> get<3>(cur) = timeElapsed;</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// Turnaround time = Completion time - Arrival time</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> get<4>(cur) = get<3>(cur) - get<1>(cur);</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// Waiting time = Turnaround time - Burst time</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> get<5>(cur) = get<4>(cur) - get<2>(cur);</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// Turnaround time >= Burst time</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> assert(get<4>(cur) >= get<2>(cur));</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// Waiting time is never negative</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> assert(get<5>(cur) >= 0);</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> result.push_back(cur);</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <a class="code hl_variable" href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">schedule</a>.pop();</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905"> 197</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#a42d7016523e3adfe5b946fab18ce7905">printResult</a>(</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keyword">const</span> vector<tuple<S, T, E, double, double, double>>& processes) {</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> cout << std::setw(17) << left << <span class="stringliteral">"Process ID"</span> << std::setw(17) << left</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> << <span class="stringliteral">"Arrival Time"</span> << std::setw(17) << left << <span class="stringliteral">"Burst Time"</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> << std::setw(17) << left << <span class="stringliteral">"Completion Time"</span> << std::setw(17)</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> << left << <span class="stringliteral">"Turnaround Time"</span> << std::setw(17) << left</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> << <span class="stringliteral">"Waiting Time"</span> << <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& process : processes) {</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> cout << std::setprecision(2) << std::fixed << std::setw(17) << left</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> << get<0>(process) << std::setw(17) << left << get<1>(process)</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> << std::setw(17) << left << get<2>(process) << std::setw(17)</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> << left << get<3>(process) << std::setw(17) << left</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> << get<4>(process) << std::setw(17) << left << get<5>(process)</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> << <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="keyword">template</span> <<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E></div>
|
|
<div class="foldopen" id="foldopen00228" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a23667f16acc4035988e7cd7ae80b6ff3"> 228</a></span>vector<tuple<S, T, E, double, double, double>> <a class="code hl_function" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a23667f16acc4035988e7cd7ae80b6ff3">get_final_status</a>(</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> vector<tuple<S, T, E>> input) {</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// Sort the processes based on Arrival time and then Burst time</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> sort(input.begin(), input.end(), <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol<S, T, E></a>);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> </div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// Result vector to hold the final status of each process</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> vector<tuple<S, T, E, double, double, double>> result(input.size());</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordtype">double</span> timeElapsed = 0;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < input.size(); i++) {</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// Extract Arrival time and Burst time</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> T arrival = get<1>(input[i]);</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> E burst = get<2>(input[i]);</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><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"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">if</span> (arrival > timeElapsed) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> timeElapsed = arrival;</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> }</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// Update timeElapsed by adding the burst time</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> timeElapsed += burst;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> </div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// Calculate Completion time, Turnaround time, and Waiting time</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordtype">double</span> completion = timeElapsed;</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keywordtype">double</span> turnaround = completion - arrival;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordtype">double</span> waiting = turnaround - burst;</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> </div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// Store the results in the result vector</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> result[i] = make_tuple(get<0>(input[i]), arrival, burst, completion,</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> turnaround, waiting);</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> }</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span></div>
|
|
<div class="foldopen" id="foldopen00267" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"><a class="line" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 267</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><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"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> vector<tuple<uint32_t, uint32_t, uint32_t, double, double, double>></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> finalResult;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i < 10; i++) {</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> std::random_device rd; <span class="comment">// Seeding</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> std::mt19937 eng(rd());</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> std::uniform_int_distribution<> distr(1, 10);</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> uint32_t n = distr(eng);</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <a class="code hl_class" href="../../d7/d9f/class_s_j_f.html">SJF<uint32_t, uint32_t, uint32_t></a> readyQueue;</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> vector<tuple<uint32_t, uint32_t, uint32_t, double, double, double>></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> input(n);</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// Generate random arrival and burst times</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keywordflow">for</span> (uint32_t i{}; i < n; i++) {</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> get<0>(input[i]) = i;</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> get<1>(input[i]) = distr(eng); <span class="comment">// Random arrival time</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> get<2>(input[i]) = distr(eng); <span class="comment">// Random burst time</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> }</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> </div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// Print processes before scheduling</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> cout << <span class="stringliteral">"Processes before SJF scheduling:"</span> << <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><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"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> </div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// Add processes to the queue</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keywordflow">for</span> (uint32_t i{}; i < n; i++) {</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> readyQueue.<a class="code hl_function" href="../../d7/d9f/class_s_j_f.html#af73fe815835075184724a13c12f613ed">addProcess</a>(get<0>(input[i]), get<1>(input[i]),</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> get<2>(input[i]));</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// Perform SJF schedulings</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><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"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">// Print processes after scheduling</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> cout << <span class="stringliteral">"\nProcesses after SJF scheduling:"</span> << <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><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"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> }</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> cout << <span class="stringliteral">"All the tests have successfully passed!"</span> << <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span></div>
|
|
<div class="foldopen" id="foldopen00313" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 313</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <a class="code hl_function" href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span>}</div>
|
|
</div>
|
|
<div class="ttc" id="aclass_compare_html"><div class="ttname"><a href="../../de/d4a/class_compare.html">Compare</a></div><div class="ttdoc">Comparator class for priority queue.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00063">fcfs_scheduling.cpp:63</a></div></div>
|
|
<div class="ttc" id="aclass_compare_html_afbdf9a44adb49728dc704155d7d1570c"><div class="ttname"><a href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare::operator()</a></div><div class="ttdeci">bool operator()(tuple< S, T, E, double, double, double > &t1, tuple< S, T, E, double, double, double > &t2)</div><div class="ttdoc">A comparator function that checks whether to swap the two tuples or not. detailed description of comp...</div><div class="ttdef"><b>Definition</b> <a href="#l00074">non_preemptive_sjf_scheduling.cpp:74</a></div></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="#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< tuple< S, T, E, double, double, double > > &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="#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< tuple< S, T, E, double, double, double > > 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="#l00154">non_preemptive_sjf_scheduling.cpp:154</a></div></div>
|
|
<div class="ttc" id="aclass_s_j_f_html_ac86d31ea081e671adeb82b3f92376fea"><div class="ttname"><a href="../../d7/d9f/class_s_j_f.html#ac86d31ea081e671adeb82b3f92376fea">SJF::schedule</a></div><div class="ttdeci">priority_queue< tuple< S, T, E, double, double, double >, vector< tuple< S, T, E, double, double, double > >, Compare< S, T, E > > schedule</div><div class="ttdef"><b>Definition</b> <a href="#l00110">non_preemptive_sjf_scheduling.cpp:110</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't already there.</div><div class="ttdef"><b>Definition</b> <a href="#l00127">non_preemptive_sjf_scheduling.cpp:127</a></div></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< S, T, E > &t1, tuple< S, T, E > &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="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 class="ttc" id="anon__preemptive__sjf__scheduling_8cpp_html_a18920aa331faf4476b251c8cdb2c2bec"><div class="ttname"><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a></div><div class="ttdeci">bool sortcol(tuple< S, T, E > &t1, tuple< S, T, E > &t2)</div><div class="ttdoc">Comparator function for sorting a vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00045">non_preemptive_sjf_scheduling.cpp:45</a></div></div>
|
|
<div class="ttc" id="anon__preemptive__sjf__scheduling_8cpp_html_a23667f16acc4035988e7cd7ae80b6ff3"><div class="ttname"><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#a23667f16acc4035988e7cd7ae80b6ff3">get_final_status</a></div><div class="ttdeci">vector< tuple< S, T, E, double, double, double > > get_final_status(vector< tuple< S, T, E > > input)</div><div class="ttdoc">Computes the final status of processes after applying non-preemptive SJF scheduling.</div><div class="ttdef"><b>Definition</b> <a href="#l00228">non_preemptive_sjf_scheduling.cpp:228</a></div></div>
|
|
<div class="ttc" id="anon__preemptive__sjf__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#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="#l00267">non_preemptive_sjf_scheduling.cpp:267</a></div></div>
|
|
<div class="ttc" id="anon__preemptive__sjf__scheduling_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d1a/non__preemptive__sjf__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00313">non_preemptive_sjf_scheduling.cpp:313</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</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>
|