This file is indexed.

/usr/share/mozart/doc/system/node30.html is in mozart-doc 1.4.0-8ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

1
2
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>6.2 Distribution</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node29.html#section.schedule.unary">&lt;&lt; Prev</A></TD><TD><A href="node28.html">- Up -</A></TD><TD><A href="node31.html#section.schedule.cumulative">Next &gt;&gt;</A></TD></TR></TABLE><DIV id="section.schedule.distribute"><H2><A name="section.schedule.distribute">6.2 Distribution</A></H2><P>In addition to the conventions used in <A href="node29.html#section.schedule.unary">Section&nbsp;6.1</A> the record of start times <I>StartR</I> must have the feature <CODE>pe</CODE>. This feature denotes the task which is to be scheduled last, i.&nbsp;e. the makespan of the schedule. </P><P></P><DL><DT><A name="label287"></A> <CODE>firstsDist</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Schedule<SPAN class="keyword">.</SPAN>firstsDist&nbsp;</CODE><CODE>+<I>TasksLIvv</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>StartR</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>DurR</I></CODE><CODE>}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>distributes the tasks occurring in <I>TasksLIvv</I>, such that every resource is serialized. </P><P>More details can be found in&nbsp;<A href="bib.html#baptiste.95a">[BPN95]</A>. </P></DD><DT><A name="label289"></A> <CODE>lastsDist</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Schedule<SPAN class="keyword">.</SPAN>lastsDist&nbsp;</CODE><CODE>+<I>TasksLIvv</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>StartR</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>DurR</I></CODE><CODE>}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>distributes the tasks occurring in <I>TasksLIvv</I>, such that every resource is serialized. </P><P>More details can be found in&nbsp;<A href="bib.html#baptiste.95a">[BPN95]</A>. </P></DD><DT><A name="label291"></A> <CODE>firstsLastsDist</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Schedule<SPAN class="keyword">.</SPAN>firstsLastsDist&nbsp;</CODE><CODE>+<I>TasksLIvv</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>StartR</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>DurR</I></CODE><CODE>}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>distributes the tasks occurring in <I>TasksLIvv</I>, such that every resource is serialized. </P><P>More details can be found in&nbsp;<A href="bib.html#baptiste.95a">[BPN95]</A>. </P></DD><DT><A name="label293"></A> <CODE>taskIntervalsDistP</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Schedule<SPAN class="keyword">.</SPAN>taskIntervalsDistP&nbsp;</CODE><CODE>+<I>TasksLIvv</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>StartR</I></CODE><CODE>&nbsp;&nbsp;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</CODE><CODE>+<I>DurR</I></CODE><CODE>}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>distributes the tasks occurring in <I>TasksLIvv</I>, such that every resource is serialized. This strategy is well suited for proving optimality. </P><P>More details can be found in&nbsp;<A href="bib.html#caseau.95">[CL95]</A>. The distribution strategy implemented in Oz differs slightly from the one described in&nbsp;<A href="bib.html#caseau.95">[CL95]</A>. </P></DD><DT><A name="label295"></A> <CODE>taskIntervalsDistO</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Schedule<SPAN class="keyword">.</SPAN>taskIntervalsDistO&nbsp;</CODE><CODE>+<I>TasksLIvv</I></CODE><CODE>&nbsp;</CODE><CODE>+<I>StartR</I></CODE><CODE>&nbsp;&nbsp;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</CODE><CODE>+<I>DurR</I></CODE><CODE>}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>distributes the tasks occurring in <I>TasksLIvv</I>, such that every resource is serialized. This strategy is well suited for finding good solutions in combination with local search techniques. </P><P>More details can be found in&nbsp;<A href="bib.html#caseau.95">[CL95]</A>. The distribution strategy implemented in Oz differs slightly from the one described in&nbsp;<A href="bib.html#caseau.95">[CL95]</A>.</P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node29.html#section.schedule.unary">&lt;&lt; Prev</A></TD><TD><A href="node28.html">- Up -</A></TD><TD><A href="node31.html#section.schedule.cumulative">Next &gt;&gt;</A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys&nbsp;Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif&nbsp;Kornstaedt</A>, <A href="http://www.ps.uni-sb.de/~homik/">Martin&nbsp;Homik</A>, <A href="http://www.ps.uni-sb.de/~tmueller/">Tobias&nbsp;Müller</A>, <A href="http://www.ps.uni-sb.de/~schulte/">Christian&nbsp;Schulte</A> and&nbsp;<A href="http://www.info.ucl.ac.be/~pvr">Peter&nbsp;Van Roy</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>