⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 安全性算法.htm

📁 操作系统的安全性算法
💻 HTM
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0069)http://61.153.216.104/xxxy/gg/shownews.asp?newsID=495&type=教研室通知 -->
<HTML><HEAD><TITLE>公共计算机教研室</TITLE>
<META http-equiv=Content-Type content="text/html; charset=gb2312"><!-- Fireworks 4.0  Dreamweaver 4.0 target.  Created Fri Jan 02 13:31:57 GMT+0800 (?D1ú±ê×?ê±??) 2004--><LINK 
href="安全性算法.files/left.css" type=text/css rel=stylesheet>
<META content="MSHTML 6.00.2800.1106" name=GENERATOR></HEAD>
<BODY bgColor=#006699 leftMargin=0 topMargin=0>
<DIV align=center><IMG height=80 src="安全性算法.files/index_r1_c1.gif" 
width=770></DIV>
<TABLE cellSpacing=0 cellPadding=0 width=770 align=center bgColor=#ffffff 
border=0>
  <TBODY>
  <TR>
    <TD height=40><SPAN class=right>当前位置&gt;&gt;<A class=right 
      href="http://61.153.216.104/xxxy/gg">计算机科学与技术教研室</A>&gt;&gt;资讯</SPAN></TD></TR>
  <TR>
    <TD>
      <DIV align=center><FONT class=title color=#003366>安全性算法</FONT></DIV></TD></TR>
  <TR>
    <TD height=129>
      <TABLE cellSpacing=0 cellPadding=0 width="96%" align=center border=0>
        <TBODY>
        <TR>
          <TD class=smaller>
            <TABLE width="100%" border=0>
              <TBODY>
              <TR>
                <TD>
                  <DIV align=center><FONT 
              color=#333333></FONT></DIV></TD></TR></TBODY></TABLE>#include&nbsp;"stdio.h"<BR>#include&nbsp;"conio.h"<BR>#include&nbsp;"string.h"<BR><BR>#define&nbsp;PN&nbsp;5<BR>#define&nbsp;RN&nbsp;3<BR><BR><BR>//int&nbsp;P[N]=1,P2,P3,P4};&nbsp;//all&nbsp;processes<BR>int&nbsp;resource[RN]={10,5,7};<BR>int&nbsp;Work[RN]={0,0,0};<BR>int&nbsp;Available[RN]={10,5,7};<BR>int&nbsp;Max[PN][RN]={{7,5,3},<BR>&nbsp;{3,2,2},<BR>&nbsp;{9,0,2},<BR>&nbsp;{2,2,2},<BR>&nbsp;{4,3,3}<BR>};//max&nbsp;number&nbsp;of&nbsp;process[i]<BR>int&nbsp;Allocation[PN][RN]={<BR>{0,1,0},<BR>{2,0,0},<BR>{3,0,2},<BR>{2,1,1},<BR>{0,0,2}<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;};&nbsp;//allcation&nbsp;of&nbsp;process[i]<BR>int&nbsp;Need[PN][RN];&nbsp;//still&nbsp;need&nbsp;of&nbsp;process[i]<BR>int&nbsp;Finish[PN];<BR>int&nbsp;Outlist[PN];<BR>int&nbsp;no=0;//to&nbsp;save&nbsp;the&nbsp;output&nbsp;list<BR><BR><BR>void&nbsp;init()<BR>{<BR>&nbsp;&nbsp;//still&nbsp;need&nbsp;number<BR><BR><BR>&nbsp;&nbsp;int&nbsp;i;<BR>&nbsp;&nbsp;int&nbsp;j;<BR><BR>&nbsp;&nbsp;for(i=0;i&lt;PN;i++)<BR>&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for(j=0;j&lt;RN;j++)<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Finish[i]=0;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Need[i][j]=Max[i][j]-Allocation[i][j];<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Available[j]-=Allocation[i][j];<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Work[j]=Available[j];<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>&nbsp;&nbsp;}<BR><BR>}<BR><BR><BR><BR><BR>int&nbsp;issafe()<BR>{<BR>&nbsp;int&nbsp;i,j;<BR><BR>l1:&nbsp;for(i=0;i&lt;PN;i++)<BR>&nbsp;&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;for(j=0;j&lt;RN;j++)<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(Finish[i]==0&amp;&amp;Need[i][j]&lt;=Work[j])<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<BR>Work[j]=Work[j]+Allocation[i][j];<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;else<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;break;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(j==RN)<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<BR>Finish[i]=1;<BR>Outlist[no++]=i;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
            i=j=0;<BR>goto&nbsp;l1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<BR><BR>&nbsp;&nbsp;&nbsp;}<BR><BR><BR>&nbsp;&nbsp;for(i=0;i&lt;PN;i++)<BR>&nbsp;&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;if(Finish[i]==0)<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;<BR>&nbsp;&nbsp;&nbsp;}<BR><BR>&nbsp;printf("the&nbsp;safe&nbsp;list&nbsp;:\n");<BR>&nbsp;for(i=0;i&lt;PN;i++)<BR>&nbsp;{<BR>&nbsp;&nbsp;printf("P%d--&gt;",Outlist[i]);<BR>&nbsp;}<BR>&nbsp;return&nbsp;1;<BR>}<BR><BR>void&nbsp;main()<BR>{<BR>clrscr();<BR>init();<BR>if(issafe())<BR>printf("\nthe&nbsp;system&nbsp;is&nbsp;under&nbsp;safe&nbsp;conditions");<BR>else<BR>printf("\nAlarm!the&nbsp;system&nbsp;is&nbsp;under&nbsp;unsafe&nbsp;condition");<BR>}<BR><BR>
            <P align=left><FONT class=right color=#333333><A class=right 
            href="http://61.153.216.104/xxxy/upload/"></A><BR><A class=right 
            href="http://61.153.216.104/xxxy/upload/"></A></FONT></P></TD></TR></TBODY></TABLE>
      <DIV align=center><BR><BR><BR><SPAN class=left>Copyright &copy; 
      浙江海洋学院信息学院<BR>制作维护:信息学院网络维护小组 <FONT 
      color=#ff0000>Email:hiron@zjou.net.cn</FONT> 
</SPAN></DIV></TD></TR></TBODY></TABLE></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -