<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Quaestiones Informaticae Vol 2 No 3</title>
<link>https://ir.unisa.ac.za/handle/10500/24003</link>
<description/>
<pubDate>Wed, 06 May 2026 12:40:33 GMT</pubDate>
<dc:date>2026-05-06T12:40:33Z</dc:date>
<item>
<title>Modelling Blocking on Admission of Tasks to Computer Systems</title>
<link>https://ir.unisa.ac.za/handle/10500/24057</link>
<description>Modelling Blocking on Admission of Tasks to Computer Systems
Wulf, S.
The need for modelling techniques to allow blocking of tasks prior to admission to the computer system in queueing&#13;
network models is described. A detailed algorithm which presents a technique to enforce blocking by priority of class&#13;
for an arbitrary number of blocking constraints is presented. The resultant solution is exact and produces an analysis&#13;
by class of admission queueing delays.
</description>
<pubDate>Sat, 01 Jan 1983 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24057</guid>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Nebulas as Structural Data Models</title>
<link>https://ir.unisa.ac.za/handle/10500/24056</link>
<description>Nebulas as Structural Data Models
Van Rooyen, H.O.; Weiermans, D.J.
Nebula modell_ing is_ a generalised structural modelling technique which applies to any finite set of objects (entities)&#13;
and n-ary relat1onsh1ps (n ~2). A nebula model can be presented in either diagrammatic or tabular form, and combines&#13;
the properties of graph (binary) data models with those of tabular (relational) data models. We give a brief introduction&#13;
to nebula data modelling by means of a simple illustration.
</description>
<pubDate>Sat, 01 Jan 1983 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24056</guid>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>An Improved Implementation of Grimbleby's Algorithm</title>
<link>https://ir.unisa.ac.za/handle/10500/24055</link>
<description>An Improved Implementation of Grimbleby's Algorithm
Schach, Stephen R.
Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running&#13;
times up to 50% less than for the original implementation. An explanation is given as to why implementations with&#13;
even lower running times are unlikely.
</description>
<pubDate>Sat, 01 Jan 1983 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24055</guid>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>An Analytical Model of a Mixed-Workload MVS Computer System</title>
<link>https://ir.unisa.ac.za/handle/10500/24054</link>
<description>An Analytical Model of a Mixed-Workload MVS Computer System
Mann, R.J.
A basic description of the facilities of the computer modelling package, AUTO-CONFIGURATER, is presented together&#13;
with detailed procedures to calculate the required input parameters from monitor statistics. Techniques to calibrate&#13;
the model are described together with an investigation into how the modelling package enables configuration and&#13;
tuning alternatives to be evaluated.
</description>
<pubDate>Sat, 01 Jan 1983 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24054</guid>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
